Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32

Analytical study of the liquid phase transient behavior of a high temperature heat pipe

The transient operation of the liquid phase of a high temperature heat pipe is studied. The study was conducted in support of advanced heat pipe applications that require reliable transport of high temperature drops and significant distances under a broad spectrum of operating conditions. The heat pipe configuration studied consists of a sealed cylindrical enclosure containing a capillary wick structure and sodium working fluid. The wick is an annular flow channel configuration formed between the enclosure interior wall and a concentric cylindrical tube of fine pore screen. The study approach is analytical through the solution of the governing equations. The energy equation is solved over the pipe wall and liquid region using the finite difference Peaceman-Rachford alternating direction implicit numerical method. The continuity and momentum equations are solved over the liquid region by the integral method. The energy equation and liquid dynamics equation are tightly coupled due to the phase change process at the liquid-vapor interface. A kinetic theory model is used to define the phase change process in terms of the temperature jump between the liquid-vapor surface and the bulk vapor. Extensive auxiliary relations, including sodium properties as functions of temperature, are used to close the analytical system. The solution procedure is implemented in a FORTRAN algorithm with some optimization features to take advantage of the IBM System/370 Model 3090 vectorization facility. The code was intended for coupling to a vapor phase algorithm so that the entire heat pipe problem could be solved. As a test of code capabilities, the vapor phase was approximated in a simple manner.

Roche, Gregory Lawrence↗

A computational procedure for the dynamics of flexible beams within multibody systems

The dynamic analysis of three dimensional elastic beams which experience large rotational and large deformational motions are examined. The beam motion is modeled using an inertial reference for the translational displacements and a body-fixed reference for the rotational quantities. Finite strain rod theories are then defined in conjunction with the beam kinematic description which accounts for the effects of stretching, bending, torsion, and transverse shear deformations. A convected coordinate representation of the Cauchy stress tensor and a conjugate strain definition is introduced to model the beam deformation. To treat the beam dynamics, a two-stage modification of the central difference algorithm is presented to integrate the translational coordinates and the angular velocity vector. The angular orientation is then obtained from the application of an implicit integration algorithm to the Euler parameter/angular velocity kinematical relation. The combined developments of the objective internal force computation with the dynamic solution procedures result in the computational preservation of total energy for undamped systems. The present methodology is also extended to model the dynamics of deployment/retrieval of the flexible members. A moving spatial grid corresponding to the configuration of a deployed rigid beam is employed as a reference for the dynamic variables. A transient integration scheme which accurately accounts for the deforming spatial grid is derived from a space-time finite element discretization of a Hamiltonian variational statement. The computational results of this general deforming finite element beam formulation are compared to reported results for a planar inverse-spaghetti problem.

Downer, Janice Diane↗

Discarding Information from Previous Iterations in an Optimal Way To Solve the Coupled Cluster Amplitude Equations

The direct inversion of the iterative subspace (DIIS) convergence acceleration algorithm is used in most electronic structure programs to solve the nonlinear coupled cluster amplitude equations. When the DIIS algorithm is used, the storage of previous trial vectors may become a bottleneck and the discarding of trial vectors may lead to a degradation of the convergence or even divergence. Here, we discuss an alternative way of storing information from trial vectors where only the last three trial vectors are needed to maintain the convergence of the full set of previous trial vectors, and which requires only minor modifications of an existing DIIS code

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Contour Mapping Based Radiation Source Localization by UAS Swarm

The unmanned swarm of aerial systems (UAS) can be used for remote radiation sensing and search for source location. Recently, the cost of developing UAS platforms has dropped drastically partly due to the increase in their popularity. The radiation sensing using multiple UAS has becomes economically viable. Different algorithms for determining the location of a radiation source using simultaneous measurements taken from drones in formation have been studied including gradient-based methods. Generally in order to accomplish contour mapping, the swarm of drones with on board sensors use gradient estimation to determine the direction of steepest gradient which governs a bulk heading vector for the swarm to follow. However, some algorithms and test methods are useful only in a specific set of circumstances with particular initial conditions. Besides, implementation of drones in swarm formation was generally not tested in the context of radiation source detection. The objective of this research is to advance the state-of-the-art by conducting experiments using multiple UAS and radiative sources in an indoor flight test-bed. The dynamic flight characteristic of the UAS swarm were considered in the search and mapping algorithms. In this paper, the radiation source detection using algorithms pertaining to swarm formation of UAS, gradient estimation, contour mapping, and experimental flight test-bed are discussed. In addition, more effective and practical ways of constructing the contour maps are explored. (authors)

42 ENGINEERING↗

Implicit flux-split schemes for the Euler equations

Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

Thomas, J. L.↗

Enhancing and Archiving the APS Catalog of the POSS I

We have worked on two different projects: 1) Archiving the APS Catalog of the POSS I for distribution to NASA's NED at IPAC, SIMBAD in France, and individual astronomers and 2) The automated morphological classification of galaxies. We have completed archiving the Catalog into easily readable binary files. The database together with the software to read it has been distributed on DVD's to the national and international data centers and to individual astronomers. The archived Catalog contains more than 89 million objects in 632 fields in the first epoch Palomar Observatory Sky Survey. Additional image parameters not available in the original on-line version are also included in the archived version. The archived Catalog is also available and can be queried at the APS web site (URL: http://aps.umn.edu) which has been improved with a much faster and more efficient querying system. The Catalog can be downloaded as binary datafiles with the source code for reading it. It is also being integrated into the SkyQuery system which includes the Sloan Digital Sky Survey, 2MASS, and the FIRST radio sky survey. We experimented with different classification algorithms to automate the morphological classification of galaxies. This is an especially difficult problem because there are not only a large number of attributes or parameters and measurement uncertainties, but also the added complication of human disagreement about the adopted types. To solve this problem we used 837 galaxy images from nine POSS I fields at the North Galactic Pole classified by two independent astronomers for which they agree on the morphological types. The initial goal was to separate the galaxies into the three broad classes relevant to issues of large scale structure and galaxy formation and evolution: early (ellipticals and lenticulars), spirals, and late (irregulars) with an accuracy or success rate that rivals the best astronomer classifiers. We also needed to identify a set of parameters derived from the digitized images that separate the galaxies by type. The human eye can easily recognize complicated patterns in images such as spiral arms which can be spotty, blotchy affairs that are difficult for automated techniques. A galaxy image can potentially be described by hundreds of parameters, all of which may have some relation to the morphological type. In the set of initial experiments we used 624 such parameters, in two colors, blue and red. These parameters include the surface brightness and color measured at different radii, ratios of these parameters at different radii, concentration indices, Fourier transforms and wavelet decomposition coefficients. We experimented with three different classes of classification algorithms; decision trees, k-nearest neighbors, and support vector machines (SVM). A range of experiments were conducted and we eventually narrowed the parameters to 23 selected parameters. SVM consistently outperformed the other algorithms with both sets of features. By combining the results from the different algorithms in a weighted scheme we achieved an overall classification success of 86%.

Humphreys, Roberta M.↗

Performance Analysis of Apollo Navigational Starter Routine

The focus of this project is to recreate and analyze the effectiveness of the original Apollo Starter Routine (ASR) which was used to generate the state vector of the Apollo spacecraft based on a series of radiometric observations. The original Apollo navigation software is unavailable in a modern programming language and the original coding has not been preserved. This necessitates its recreation using the original software documentation. Space Shuttle navigation software does not typically use the ASR or an algorithm like it since the Shuttle s state vector is easily deduced from GPS information or other sources. However, this tactic will be ineffective when trying to determine the state vector of a craft approaching, departing or in orbit around the Moon since the GPS network faces the surface of the Earth, not outer space. The recreation of the ASR from the original documentation is therefore vital as a simulation baseline for the navigation software under development for the Constellation program. The algorithms that make up the ASR will be extracted from the original documentation and adapted for and then implemented in a modern programming language; the majority of it will be coded in Matlab. The ASR s effectiveness will then be tested using simulated tracking data. The ability of the ASR to handle realistically noisy data and the accuracy with which it generates state vectors were analyzed. The ASR proved to be robust enough to process data with range and angle noise as large as 10,000 meters and 10(exp -6) radians together and 300,000 meters and 5x10(exp -4) radians separately at Lunar distances. The ASR was able to handle marginally more noise at distances closer to the Earth where the angle noise was less significant. The ASR is capable of effectively processing 40-80 data points gathered at a rate of one per 20 seconds at close Earth orbit and up to 28-40 data points gathered at a rate of one per minute at distant Earth orbit and Lunar orbit.

Ivanov, Stoyan I.↗

Machine-learning Classifiers for Intermediate Redshift Emission-line Galaxies

Classification of intermediate redshift (z = 0.3-0.8) emission line galaxies as star-forming galaxies, composite galaxies, active galactic nuclei (AGNs), or low-ionization nuclear emission regions (LINERs) using optical spectra alone was impossible because the lines used for standard optical diagnostic diagrams: [N ii], Hα, and [S ii] are redshifted out of the observed wavelength range. In this work, we address this problem using four supervised machine-learning classification algorithms: k-nearest neighbors (KNN), support vector classifier (SVC), random forest (RF), and a multilayer perceptron (MLP) neural network. For input features, we use properties that can be measured from optical galaxy spectra out to z < 0.8 - [O iii]/Hβ, [O ii]/Hβ, [O iii] line width, and stellar velocity dispersion - and four colors (u - g, g - r, r - i, and i - z) corrected to z = 0.1. The labels for the low redshift emission line galaxy training set are determined using standard optical diagnostic diagrams. RF has the best area under curve score for classifying all four galaxy types, meaning the highest distinguishing power. Both the AUC scores and accuracies of the other algorithms are ordered as MLP > SVC > KNN. The classification accuracies with all eight features (and the four spectroscopically determined features only) are 93.4% (92.3%) for star-forming galaxies, 69.4% (63.7%) for composite galaxies, 71.8% (67.3%) for AGNs, and 65.7% (60.8%) for LINERs. The stacked spectrum of galaxies of the same type as determined by optical diagnostic diagrams at low redshift and RF at intermediate redshift are broadly consistent. Our publicly available code (https://github.com/zkdtc/MLC_ELGs) and trained models will be instrumental for classifying emission line galaxies in upcoming wide-field spectroscopic surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian classification of falls risk

Background. Prior research in falls risk prediction often relies on qualitative and/or clinical methods. There are two challenges with these methods. First, qualitative methods typically use falls history to determine falls risk. Second, clinical methods do not quantify the uncertainty in the classification decision. In this paper, we propose using Bayesian classification to predict falls risk using vectors of gait variables shown to contribute to falls risk. Research Questions: (1) Using a vector of risk ratios for specific gait variables shown to contribute to falls risk, how can older adults be classified as low or high falls risk? and (2) how can the uncertainty in the classifier decision be quantified when using a vector of gait variables? Methods. Using a pressure sensitive walkway, biomechanical measurements of gait were collected from 854 adults over the age of 65. In our method, we first determine low and high falls risk labels for vectors of risk ratios using the k-means algorithm. Next, the posterior probability of low or high falls risk class membership is obtained from a two component Gaussian mixture model (GMM) of gait vectors, which enables risk assessment directly from the underlying biomechanics. We classify the gait vectors using a threshold based on Youden's J statistic. Results. Through a Monte Carlo simulation and an analysis of the receiver operating characteristic (ROC), we demonstrate that our Bayesian classifier, when compared to the k-means falls risk labels, achieves an accuracy greater than 96% at predicting low or high falls risk. Significance. Our analysis indicates that our approach based on a Bayesian framework and an individual's underlying biomechanics can predict falls risk while quantifying uncertainty in the classification decision.

59 BASIC BIOLOGICAL SCIENCES↗

Predicting nepheline precipitation in waste glasses using ternary submixture model and machine learning

Nepheline precipitation in nuclear waste glasses during vitrification can be detrimental due to its negative effect on chemical durability. Developing models to accurately predict nepheline precipitation from compositions is important to increase waste loading since existing models can be overly conservative. In this study, an expanded dataset containing 955 glasses was compiled from literature data, where 355 glasses are for high-level waste (HLW). Previously developed submixture models were refitted using the new dataset, where a misclassification rate of 7.8% was achieved. Nine machine learning (ML) algorithms (e.g., k-nearest neighbor, Gaussian process regression, artificial neural network, support vector machine, decision tree, etc.) were applied to evaluate their ability of predicting nepheline precipitation from compositions. Model accuracy, precision, recall/sensitivity, and F1 score were systemically compared between different ML algorithms and modeling protocols. Good model prediction with an accuracy ~0.9 (misclassification rate of ~10%) was observed with different algorithms under certain protocol. This study evaluated various ML models to predict nepheline precipitations in waste glasses, highlighting the importance of data preparation, modeling protocol, and their effect on model stability and reproducibility. The results provide insights into applying ML to predict glass properties and suggest areas for future research on modeling nepheline precipitations.

Lu, Xiaonan↗

Angular-Rate Estimation Using Delayed Quaternion Measurements

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared one that uses differentiated quaternion measurements to yield coarse rate measurements, which are then fed into two different estimators. In the other approach the raw quaternion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear part of the rotas rotational dynamics equation of a body into a product of an angular-rate dependent matrix and the angular-rate vector itself. This non unique decomposition, enables the treatment of the nonlinear spacecraft (SC) dynamics model as a linear one and, thus, the application of a PseudoLinear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the gain matrix and thus eliminates the need to compute recursively the filter covariance matrix. The replacement of the rotational dynamics by a simple Markov model is also examined. In this paper special consideration is given to the problem of delayed quaternion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results are presented.

Azor, R.↗

Data-Enabled Predictive Control for Building HVAC Systems

Model predictive control is widely used as a control technology for the computation of optimal control inputs of building heating, ventilating, and air conditioning (HVAC) systems. However, both the benefits and widespread adoption of model predictive control (MPC) are hindered by the effort of model creation, calibration, and accuracy of the predictions. In this paper, we apply the data-enabled predictive control (DeePC) algorithm for designing controls for building HVAC systems. The algorithm solely depends on input/output data from the system to predict future state trajectories without the need for system identification. The algorithm relies on the idea that a vector space of all input–output trajectories of a discrete-time linear time-invariant (LTI) system is spanned by time-shifts of a single measured trajectory, given the input signal is persistently exciting. Closed-loop simulations using EnergyPlus are performed to demonstrate the approach. The simulated building modeled in EnergyPlus is a modified commercial large office prototype building served by an air handling unit-variable air volume HVAC system. Temperature setpoints of zones are used as control variables to minimize the HVAC energy cost of the building considering a time-of-use electricity rate structure. Furthermore, sensitivity analysis is conducted to gain insights into the effect of parameter tuning on DeePC performance. Simulation results are used to illustrate the performance of the algorithm and compare the algorithm with model-based MPC and occupancy-based setpoint controller. Overall, DeePC achieves similar performance compared to MPC for lower engineering effort.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Angular-Rate Estimation Using Star Tracker Measurements

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared, one that uses differentiated quatemion measurements to yield coarse rate measurements which are then fed into two different estimators. In the other approach the raw quatemion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear rate dependent part of the rotational dynamics equation of a rigid body into a product of an angular-rate dependent matrix and the angular-rate vector itself This decomposition, which is not unique, enables the treatment of the nonlinear spacecraft dynamics model as a linear one and, consequently, the application of a Pseudo-Linear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the Kalman gain matrix and thus eliminates the need to propagate and update the filter covariance matrix. The replacement of the elaborate rotational dynamics by a simple first order Markov model is also examined. In this paper a special consideration is given to the problem of delayed quatemion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results of these tests are presented.

Azor, R.↗

Angular-Rate Estimation using Star Tracker Measurements

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared, one that uses differentiated quaternion measurements to yield coarse rate measurements which are then fed into two different estimators. In the other approach the raw quaternion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear rate dependent part of the rotational dynamics equation of a rigid body into a product of an angular-rate dependent matrix and the angular-rate vector itself. This decomposition, which is not unique, enables the treatment of the nonlinear spacecraft dynamics model as a linear one and, consequently, the application of a Pseudo-Linear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the Kalman gain matrix and thus eliminates the need to propagate and update the filter covariance matrix. The replacement of the elaborate rotational dynamics by a simple first order Markov model is also examined. In this paper a special consideration is given to the problem of delayed quaternion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results of these tests are presented.

Azor, R.↗

Using nonproduct quadrature grids to solve the vibrational Schroedinger equation in 12D

In this paper we propose a new quadrature scheme for computing vibrational spectra and apply it, using a Lanczos algorithm, to CH{sub 3}CN. All 12 coordinates are treated explicitly. We need only 157'419'523 quadrature points. It would not be possible to use a product Gauss grid because 33 853 318 889 472 product Gauss points would be required. The nonproduct quadrature we use is based on ideas of Smolyak, but they are extended so that they can be applied when one retains basis functions {theta}{sub n{sub 1}}(r{sub 1}){center_dot}{center_dot}{center_dot}{theta}{sub n{sub D}}(r{sub D}) that satisfy the condition {alpha}{sub 1}n{sub 1} + {center_dot}{center_dot}{center_dot} + {alpha}{sub D}n{sub D}{<=}b, where the {alpha}{sub k} are integers. We demonstrate that it is possible to exploit the structure of the grid to efficiently evaluate the matrix-vector products required to use the Lanczos algorithm.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast gravity, gravity partials, normalized gravity, gravity gradient torque and magnetic field: Derivation, code and data

Derivation of first and second partials of the gravitational potential is given in both normalized and unnormalized form. Two different recursion formulas are considered. Derivation of a general gravity gradient torque algorithm which uses the second partial of the gravitational potential is given. Derivation of the geomagnetic field vector is given in a form that closely mimics the gravitational algorithm. Ada code for all algorithms that precomputes all possible data is given. Test cases comparing the new algorithms with previous data are given, as well as speed comparisons showing the relative efficiencies of the new algorithms.

Gottlieb, Robert G.↗

Scalable Parallel Methods for Analyzing Metagenomics Data at Extreme Scale

The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid development and deployment of numerous cost-effective, high-throughput next-generation sequencing technologies. The result is that the DNA and protein sequence repositories are being bombarded with new sequence information. Databases are continuing to report a Moore’s law-like growth trajectory in their database sizes, roughly doubling every 18 months. In what seems to be a paradigm-shift, individual projects are now capable of generating billions of raw sequence data that need to be analyzed in the presence of already annotated sequence information. While it is clear that data-driven methods, such as sequencing homology detection, are becoming the mainstay in the field of computational life sciences, the algorithmic advancements essential for implementing complex data analytics at scale have mostly lagged behind. Sequence homology detection is central to a number of bioinformatics applications including genome sequencing and protein family characterization. Given millions of sequences, the goal is to identify all pairs of sequences that are highly similar (or “homologous”) on the basis of alignment criteria. While there are optimal alignment algorithms to compute pairwise homology, their deployment for large-scale is currently not feasible; instead, heuristic methods are used at the expense of quality. In this dissertation, we present the design and evaluation of a parallel implementation for conducting optimal homology detection on distributed memory supercomputers. Our approach uses a combination of techniques from asynchronous load balancing (viz. work stealing, dynamic task counters), data replication, and exact-matching filters to achieve homology detection at scale. Results for a collection of 2.56M sequences show parallel efficiencies of ~75-100% on up to 8K cores, representing a time-to-solution of 33 seconds. We extend this work with a detailed analysis of single-node sequence alignment performance using the latest CPU vector instruction set extensions. Preliminary results reveal that current sequence alignment algorithms are unable to fully utilize widening vector registers.

59 BASIC BIOLOGICAL SCIENCES↗

Improved parallel data partitioning by nested dissection with applications to information retrieval.

The computational work in many information retrieval and analysis algorithms is based on sparse linear algebra. Sparse matrix-vector multiplication is a common kernel in many of these computations. Thus, an important related combinatorial problem in parallel computing is how to distribute the matrix and the vectors among processors so as to minimize the communication cost. We focus on minimizing the total communication volume while keeping the computation balanced across processes. In [1], the first two authors presented a new 2D partitioning method, the nested dissection partitioning algorithm. In this paper, we improve on that algorithm and show that it is a good option for data partitioning in information retrieval. We also show partitioning time can be substantially reduced by using the SCOTCH software, and quality improves in some cases, too.

99 GENERAL AND MISCELLANEOUS↗