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 919 records · Page 51

Cost-effective accurate coarse-grid method for highly convective multidimensional unsteady flows

A fundamentally multidimensional convection scheme is described based on vector transient interpolation modeling rewritten in conservative control-volume form. Vector third-order upwinding is used as the basis of the algorithm; this automatically introduces important cross-difference terms that are absent from schemes using component-wise one-dimensional formulas. Third-order phase accuracy is good; this is important for coarse-grid large-eddy or full simulation. Potential overshoots or undershoots are avoided by using a recently developed universal limiter. Higher order accuracy is obtained locally, where needed, by the cost-effective strategy of adaptive stencil expansion in a direction normal to each control-volume face; this is controlled by monitoring the absolute normal gradient and curvature across the face. Higher (than third) order cross-terms do not appear to be needed. Since the wider stencil is used only in isolated narrow regions (near discontinuities), extremely high (in this case, seventh) order accuracy can be achieved for little more than the cost of a globally third-order scheme.

Leonard, B. P.↗

Efficient use of direct solvers for the calculation of compressible flows

While the direct solution of systems of linear equations resulting from fluid dynamic problems has generally not been practical in the past, it is presently demonstrated that the direct method is often more efficient than the most popular iterative schemes when constructed in such a way as to take advantage of presently available vector processing capabilities and large memory. The vertical line Gauss-Seidel algorithm was chosen as the iterative method to be compared with the direct method. It is fond that the direct method becomes efficient only when large residual reductions are desired.

Riggins, David W.↗

Computational modeling of femtosecond optical solitons from Maxwell's equations

An algorithm is developed that permits the direct time integration of full-vector nonlinear Maxwell's equations. This capability permits the modeling of both linear and nonlinear instantaneous and dispersive effects in the electric polarization in material media. The modeling of the optical carrier is retained. The fundamental innovation is to notice that it is possible to treat the linear and nonlinear convolution integrals, which describe the dispersion, as new dependent variables. A coupled system of nonlinear second-order ordinary differential equations can then be derived for the linear and nonlinear convolution integrals, by differentiating them in the time domain. These equations, together with Maxwell's equations, are solved to determine the electromagnetic fields in nonlinear dispersive media. Results are presented of calculations in one dimension of the propagation and collision of femtosecond electromagnetic solitons that retain the optical carrier, taking into account as the Kerr and Raman interactions.

Goorjian, Peter M.↗

Can Machine Learning Reveal Precursors of Reversals of the Geomagnetic Axial Dipole Field?

It is well known that the axial dipole part of Earth’s magnetic field reverses polarity, so that the magnetic North Pole becomes the South Pole and vice versa. The timing of reversals is well documented for the past 160 Myr, but the conditions that lead to a reversal are still not well understood. It is not known if there are reliable ‘precursors’ of reversals (events that indicate that a reversal is upcoming) or what they might be. We investigate if machine learning (ML) techniques can reliably identify precursors of reversals based on time-series of the axial magnetic dipole field. The basic idea is to train a classifier using segments of time-series of the axial magnetic dipole. This training step requires modification of standard ML techniques to account for the fact that we are interested in rare events—a reversal is unusual, while a non-reversing field is the norm. Without our tweak, the ML classifiers lead to useless predictions. Perhaps even more importantly, the usable observational record is limited to 0–2 Ma and contains only five reversals, necessitating that we determine if the data are even sufficient to reliably train and validate an ML algorithm. To answer these questions we use several ML classifiers (linear/non-linear support vector machines and long short-term memory networks), invoke a hierarchy of numerical models (from simplified models to 3-D geodynamo simulations), and two palaeomagnetic reconstructions (PADM2M and Sint-2000). The performance of the ML classifiers varies across the models and the observational record and we provide evidence that this is not an artefact of the numerics, but rather reflects how ‘predictable’ a model or observational record is. Studying models of Earth’s magnetic field via ML classifiers thus can help with identifying shortcomings or advantages of the various models. For Earth’s magnetic field, we conclude that the ability of ML to identify precursors of reversals is limited, largely due to the small amount and low frequency resolution of data, which makes training and subsequent validation nearly impossible. Put simply: the ML techniques we tried are not currently capable of reliably identifying an axial dipole moment (ADM) precursor for geomagnetic reversals. This does not necessarily imply that such a precursor does not exist, and improvements in temporal resolution and length of ADM records may well offer better prospects in the future.

Kyle Gwirtz↗

The PACE-MAPP Algorithm: Simultaneous Aerosol and Ocean Products From Combined Polarimeter and Shortwave Infrared Measurements

PACE-MAPP collaborative algorithm project - Produce accurate aerosol optical and microphysical properties and ocean properties - Use a coupled atmosphere-ocean vector radiative transfer (VRT) model - Use accurate but fast Mie/SS/T-matrix LUTs - Use scientific machine learning to speed-up retrievals by 1000x (PACE-MAPP Neural Network) - PACE-MAPP is a multi-instrument polarimeter algorithm for SPEXone, HARP2, OCI shortwave infrared channels

Snorre Alfred Moen Stamnes↗

Improving Adhesive Bondline Time of Flight Predictions During Autoclave Cure Utilizing Machine Learning

Composite materials are increasingly being used in aerospace applications due to their superior strength-to-weight ratio compared to commonly used metals. A current limitation to widespread adoption is the certification of adhesively bonded joints. One approach to improving adhesive bonding in composites is accurately measuring the thickness of adhesive bondlines in composite laminates. Precise bondline thickness control is essential for aerospace applications where adhesive layer thickness directly affects joint fracture properties and structural performance. This study focused on implementing machine learning techniques to determine the ultrasonic time of flight (directly correlated to thickness) in adhesive bondlines throughout autoclave cure cycles. A high-temperature (use up to 180°C) ultrasonic scanning system was deployed in an autoclave to provide time of flight data through composite panels. Three experiments were conducted on the curing of 305 mm × 305 mm unidirectional composite panels. In the first experiment, a piecewise function was fit for the temperature correction factor to account for changing autoclave temperatures. Due to deficiencies in the first calibration experiment, a second experiment was run, and the results were used to train a machine learning model. The revised experiment, in combination with the machine learning model, significantly increased the accuracy of the bondline time of flight predictions (~14% error reduced to <1%). Data was processed using the Regression Learner Application in MATLAB®, with a Support Vector Machine selected for the model. The result was a machine learning algorithm capable of reliably quantifying ultrasonic time of flight through adhesive bondlines. The third experiment provided independent test data for the machine learning model, demonstrating that the model produces accurate predictions from data beyond its training set.

Machine Learning↗

An implementation analysis of the linear discontinuous finite element method

This paper provides an implementation analysis of the linear discontinuous finite element method (LD-FEM) that spans the space of (l, x, y, z). A practical implementation of LD includes 1) selecting a computationally efficient algorithm to solve the 4 x 4 matrix system Ax = b that describes the angular flux in a mesh element, and 2) choosing how to store the data used to construct the matrix A and the vector b to either reduce memory consumption or increase computational speed. To analyze the first of these, three algorithms were selected to solve the 4 x 4 matrix equation: Cramer's rule, a streamlined implementation of Gaussian elimination, and LAPACK's Gaussian elimination subroutine dgesv. The results indicate that Cramer's rule and the streamlined Gaussian elimination algorithm perform nearly equivalently and outperform LAPACK's implementation of Gaussian elimination by a factor of 2. To analyze the second implementation detail, three formulations of the discretized LD-FEM equations were provided for implementation in a transport solver: 1) a low-memory formulation, which relies heavily on 'on-the-fly' calculations and less on the storage of pre-computed data, 2) a high-memory formulation, which pre-computes much of the data used to construct A and b, and 3) a reduced-memory formulation, which lies between the low - and high-memory formulations. These three formulations were assessed in the Jaguar transport solver based on relative memory footprint and computational speed for increasing mesh size and quadrature order. The results indicated that the memory savings of the low-memory formulation were not sufficient to warrant its implementation. The high-memory formulation resulted in a significant speed advantage over the reduced-memory option (10-50%), but also resulted in a proportional increase in memory consumption (5-45%) for increasing quadrature order and mesh count; therefore, the practitioner should weigh the system memory constraints against any required runtime constraints to determine which option is more suitable for his or her specific applications. (authors)

97 MATHEMATICS AND COMPUTING↗

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗

Algorithmic Patterns for $$\mathcal {H}$$-Matrices on Many-Core Processors

In this work, we consider the reformulation of hierarchical ( \(\mathcal {H}\) ) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). \(\mathcal {H}\) matrices approximate specific dense matrices, e.g., from discretized integral equations or kernel ridge regression, leading to log-linear time complexity in dense matrix–vector products. The parallelization of \(\mathcal {H}\) matrix operations on many-core processors is difficult due to the complex nature of the underlying algorithms. While previous algorithmic advances for many-core hardware focused on accelerating existing \(\mathcal {H}\) matrix CPU implementations by many-core processors, we here aim at totally relying on that processor type. As main contribution, we introduce the necessary parallel algorithmic patterns allowing to map the full \(\mathcal {H}\) matrix construction and the fast matrix–vector product to many-core hardware. In this work, crucial ingredients are space filling curves, parallel tree traversal and batching of linear algebra operations. The resulting model GPU implementation hmglib is the, to the best of the authors knowledge, first entirely GPU-based Open Source \(\mathcal {H}\) matrix library of this kind. We investigate application examples as present in kernel ridge regression, Gaussian Process Regression and kernel-based interpolation. In this context, an in-depth performance analysis and a comparative performance study against a standard multi-core CPU \(\mathcal {H}\) matrix library highlights profound speedups of our many-core parallel approach.

97 MATHEMATICS AND COMPUTING↗

Algorithmic Classification of Raman Spectra Biosignatures: Improving Life Detection Confidence

“Agnostic” biosignatures – indicators of life (or the absence of life), independent of a particular biochemistry – are increasingly considered a high standard for life detection. The Ladder of Life Detection (2018) called for investigating how combinations of independent and different potential biosignatures affect confidence. To address this gap, statistical classification of elemental abundances, isotopic fractionation, and reflectance spectroscopy (VNIR) has been implemented. Raman spectroscopy, highly desirable due to its wide availability, has the potential to improve this predictive power. This work implemented biosignature classification algorithms on Raman data alone, in preparation for combination with the other data types. Raman spectroscopy data was collected from published databases and papers as part of a manually curated dataset of “indicative” and “non-indicative of life” samples. These currently include 61 non-indicative samples (meteorites, magnetite); 3 indicative living samples (bacteria); 20 indicative non-living samples (chalk, bone); and 12 indicative mixed (with non-indicative material) samples (soil, microbial mats). Laboratory work is ongoing to characterize additional samples, particularly a greater breadth of mixed systems. Spectra were interpolated, filtered with the Savitzsky-Golay filter, and de-noised. For a preliminary examination, agnostic features were manually extracted including mean intensity, number of peaks, and mean peak width. Different peak prominences and filtering polynomials were used to refine features. Classification algorithms were implemented: k-nearest neighbors (KNN), logistic regression (LR), linear support vector machines (SVM), random forest (RF), Gaussian naïve bayes (GNB). Lastly, Monte Carlo simulations on 1,000 50%-train-test-splits were used to validate classification performance and feature significance. The preliminary feature set achieved its highest AUC of 0.52 with LR, with no strongly discriminatory features. Work to improve feature extraction, such as through deep learning with back propagation, is planned. In future work, the Raman data will be combined with the other data types, and potentially new data types such as enantiomeric excess. This project was partially supported through the NASA Ames Project EXcellence (APEX) incubator program.

Astrobiology↗

Lunar Reconnaissance Orbiter (LRO) Guidance, Navigation and Control (GN&C) Overview

The National Aeronautics and Space Administration s (NASA) Lunar Reconnaissance Orbiter (LRO) launched on June 18, 2009 from the Cape Canaveral Air Force Station aboard an Atlas V launch vehicle and into a direct insertion trajectory to the oon. LRO, which was designed, built, and operated by the NASA Goddard Space Flight Center in Greenbelt, MD, is gathering crucial data on the lunar environment that will help astronauts prepare for long-duration lunar expeditions. The mission has a nominal life of 1 year as its seven instruments find safe landing sites, locate potential resources, characterize the radiation environment, and test new technology. To date, LRO has been operating well within the bounds of its requirements and has been collecting excellent science data images taken from the LRO Camera Narrow Angle Camera of the Apollo landing sites appeared on cable news networks. A significant amount of information on LRO s science instruments is provided at the LRO mission webpage. LRO s Guidance, Navigation and Control (GN&C) subsystem is made up of an onboard attitude control system (ACS) and a hardware suite of sensors and actuators. The LRO onboard ACS is a collection of algorithms based on high level and derived requirements, and reflect the science and operational events throughout the mission lifetime. The primary control mode is the Observing mode, which maintains the lunar pointing orientation and any offset pointing from this baseline. It is within this mode that all science instrument calibrations, slews and science data is collected. Because of a high accuracy requirement for knowledge and pointing, the Observing mode makes use of star tracker (ST) measurement data to determine an instantaneous attitude pointing. But even the star trackers alone do not meet the tight requirements, so a six-state Kalman Filter is employed to improve the noisy measurement data. The Observing mode obtains its rate information from an inertial reference unit (IRU) and in the event of an IRU failure, the rate data is be derived from the star tracker, but with degraded pointing performance. The Delta-V control mode responsibility is to maintain attitude pointing during the cruise trajectory, insertion burns and lunar orbit maintenance by adjustments made to the spacecraft s velocity magnitude and vector direction. The ACS also provides for a thruster based system momentum management algorithm (known as Delta-H) to maintain the system and wheel momentum to within acceptable levels. In the event an anomaly causes the LRO spacecraft to lose the ability to maintain its current attitude pointing, a Sun Safe mode is included in the ACS for the purpose of providing a known power and thermally safe coarse inertial sun attitude for an indefinite period of time, within the manageable limits of the reaction wheels. The Sun Safe mode is also the initial spacecraft control mode off of the launch vehicle and provides for a means to null tip-off rates immediately after separation. The nominal configuration is to use the IRU for rate information in the controller. In the event of a gyro failure a gyroless control mode was developed that computes rate information from the CSS data.

Garrick, Joseph↗

White light modeling, algorithm development, and validation on the micro-arcsecond metrology testbed

The Space Interferometry Mission (SIM), scheduled for launch in early 2010, is an optical interferometer that will perform narrow angle and global wide angle astrometry with unprecedented accuracy, providing differential position accuracies of 1uas, and 4uas global accuracies in position, proper motion and parallax. SIM astrometric measurements are synthesized from pathlength delay measurements provided by three Michelson-type, white light interferometers. Two of the interferometers are used for making precise measurements of variations in the spacecraft attitude, while the third interferometer performs the science measurement. The ultimate performance of SIM relies on a combination of precise fringe measurements of the interfered starlight with picometer class relative distance measurements made between a set of fiducials that define the interferometer baseline vectors. The focus of the present paper is on the development and analysis of algorithms for accurate white light fringe estimation, and on the preliminary validation of these algorithms on the Micro-Arcsecond Testbed (MAM).

Shen, Janice TsaePyng↗

Orbital Advection with Magnetohydrodynamics and Vector Potential

Orbital advection is a significant bottleneck in disk simulations, and a particularly tricky one when used in connection with magnetohydrodynamics. We have developed an orbital advection algorithm suitable for the induction equation with magnetic potential. The electromotive force is split into advection and shear terms, and we find that we do not need an advective gauge since solving the orbital advection implicitly precludes the shear term from canceling the advection term. We prove and demonstrate the third order in time accuracy of the scheme. The algorithm is also suited to non-magnetic problems. Benchmarked results of (hydrodynamical) planet–disk interaction and of the magnetorotational instability are reproduced. We include detailed descriptions of the construction and selection of stabilizing dissipations (or high-frequency filters) needed to generate practical results. The scheme is self-consistent, accurate, and elegant in its simplicity, making it particularly efficient for straightforward finite-difference methods. As a result of the work, the algorithm is incorporated in the public version of the Pencil Code, where it can be used by the community.

79 ASTRONOMY AND ASTROPHYSICS↗

A Space-Filling Visualization Technique for Multivariate Small World Graphs

We introduce an information visualization technique, known as GreenCurve, for large sparse graphs that exhibit small world properties. Our fractal-based design approach uses spatial cues to approximate the node connections and thus eliminates the links between the nodes in the visualization. The paper describes a sophisticated algorithm to order the neighboring nodes of a large sparse graph by solving the Fiedler vector of its graph Laplacian, and then fold the graph nodes into a space-filling fractal curve based on the Fiedler vector. The result is a highly compact visualization that gives a succinct overview of the graph with guaranteed visibility of every graph node. We show in the paper that the GreenCurve technology is (1) theoretically sustainable by introducing an error estimation metric to measure the fidelity of the new graph representation, (2) empirically rigorous by conducting a usability study to investigate its strengths and weaknesses against the traditional graph layout, and (3) pragmatically feasible by applying it to analyze stressed conditions of the large scale electric power grid on the west coast.

99 GENERAL AND MISCELLANEOUS↗

Characterization of Used Nuclear Fuel with Multivariate Analysis for Process Monitoring

The Multi-Isotope Process (MIP) Monitor combines gamma spectroscopy and multivariate analysis to detect anomalies in various process streams in a nuclear fuel reprocessing system. Measured spectra are compared to models of nominal behavior at each measurement location to detect unexpected changes in system behavior. In order to improve the accuracy and specificity of process monitoring, fuel characterization may be used to more accurately train subsequent models in a full analysis scheme. This paper presents initial development of a reactor-type classifier that is used to select a reactor-specific partial least squares model to predict fuel burnup. Nuclide activities for prototypic used fuel samples were generated in ORIGEN-ARP and used to investigate techniques to characterize used nuclear fuel in terms of reactor type (pressurized or boiling water reactor) and burnup. A variety of reactor type classification algorithms, including k-nearest neighbors, linear and quadratic discriminant analyses, and support vector machines, were evaluated to differentiate used fuel from pressurized and boiling water reactors. Then, reactor type-specific partial least squares models were developed to predict the burnup of the fuel. Using these reactor type-specific models instead of a model trained for all light water reactors improved the accuracy of burnup predictions. The developed classification and prediction models were combined and applied to a large dataset that included eight fuel assembly designs, two of which were not used in training the models, and spanned the range of the initial 235U enrichment, cooling time, and burnup values expected of future commercial used fuel for reprocessing. Error rates were consistent across the range of considered enrichment, cooling time, and burnup values. Average absolute relative errors in burnup predictions for validation data both within and outside the training space were 0.0574% and 0.0597%, respectively. The errors seen in this work are artificially low, because the models were trained, optimized, and tested on simulated, noise-free data. However, these results indicate that the developed models may generalize well to new data and that the proposed approach constitutes a viable first step in developing a fuel characterization algorithm based on gamma spectra.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Parallel-vector computation for CSI-design code

Computational aspects of Control-Structure Interaction (CSI) DESIGN code is reviewed. Numerical intensive computation portions of CSI-DESIGN code were identified. Improvements in computational speed for the CSI-DESIGN code can be achieved by exploiting parallel and vector capabilities offered by modern computers, such as the Alliant, Convex, Cray-2, and Cray-YMP. Four options to generate the coefficient stiffness matrix and to solve the system of linear, simultaneous equations are currently available in the CSI-DESIGN code. A preprocessor to use RCM (Reverse Cuthill-Mackee) algorithm for bandwidth minimization was also developed for the CSI-DESIGN code. Preliminary results obtained by solving a small-scale, 97 node CSI finite element model (for eigensolution) have indicated that this new CSI-DESIGN code is 5 to 6 times faster (using 1 Alliant processor) than the old version of CSI-DESIGN code. This speed-up was achieved due to the RCM algorithm and the use of a new skyline solver. Efforts are underway to further improve the vector speed for CSI-DESIGN code, to evaluate its performance on a larger scale CSI model (such as phase zero CSI model) to make the code run efficiently on multiprocessor, parallel computer environment, and to make the code portable among different parallel computers available at NASA LaRC, such as Alliant, Convex, and Cray computers.

Nguyen, Duc T.↗

On-the-Fly Decompression and Rendering of Multiresolution Terrain

We present a streaming geometry compression codec for multiresolution, uniformly-gridded, triangular terrain patches that supports very fast decompression. Our method is based on linear prediction and residual coding for lossless compression of the full-resolution data. As simplified patches on coarser levels in the hierarchy already incur some data loss, we optionally allow further quantization for more lossy compression. The quantization levels are adaptive on a per-patch basis, while still permitting seamless, adaptive tessellations of the terrain. Our geometry compression on such a hierarchy achieves compression ratios of 3:1 to 12:1. Our scheme is not only suitable for fast decompression on the CPU, but also for parallel decoding on the GPU with peak throughput over 2 billion triangles per second. Each terrain patch is independently decompressed on the fly from a variable-rate bitstream by a GPU geometry program with no branches or conditionals. Thus we can store the geometry compressed on the GPU, reducing storage and bandwidth requirements throughout the system. In our rendering approach, only compressed bitstreams and the decoded height values in the view-dependent 'cut' are explicitly stored on the GPU. Normal vectors are computed in a streaming fashion, and remaining geometry and texture coordinates, as well as mesh connectivity, are shared and re-used for all patches. We demonstrate and evaluate our algorithms on a small prototype system in which all compressed geometry fits in the GPU memory and decompression occurs on the fly every rendering frame without any cache maintenance.

99 GENERAL AND MISCELLANEOUS↗