Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Asteroid orbit determination using Bayesian probabilities

Bayesian a priori and a posteriori probability densities are employed to determine asteroid orbital elements from optical astrometric observations. For near-earth asteroids and Jupiter Trojans, the two-body approximation can yield grossly erroneous uncertainty estimates because of the scattering effect of close planetary encounters or prolonged weak planetary perturbations. For main-belt asteroids, the two-body approximation works efficiently, from which it is inferred that, although the ephemeris must be computed from an integrated orbit, only approximate partial derivatives are needed to attain sufficient accuracy in predicting ephemeris uncertainties. The semimajor and semiminor axes of the 2D 1-sigma sky-plane uncertainty ellipse during the years 1993 to 2005 in the many-body and two-body linear approximations are shown.

Muinonen, Karri↗
DOE OSTI2024

Posterior Covariance Matrix Approximations

Here, the Davis equation of state (EOS) is commonly used to model thermodynamic relationships for high explosive (HE) reactants. Typically, the parameters in the EOS are calibrated, with uncertainty, using a Bayesian framework and Markov Chain Monte Carlo (MCMC) methods. However, MCMC methods are computationally expensive, especially for complex models with many parameters. This paper provides a comparison between MCMC and less computationally expensive Variational methods (Variational Bayesian and Hessian Variational Bayesian) for computing the posterior distribution and approximating the posterior covariance matrix based on heterogeneous experimental data. All three methods recover similar posterior distributions and posterior covariance matrices. This study demonstrates that for this EOS parameter calibration application, the assumptions made in the two Variational methods significantly reduce the computational cost but do not substantially change the results compared to MCMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Integration of multiple coinflip devices for high-quality random sampling

Artificial intelligence, scientific computing, and probabilistic computing use random sampling to approximate solutions to various problems, with larger models requiring a substantial quantity of random numbers. To generate the required vast quantity of random numbers at high rates, we explore so-called “coinflip” devices, which are stochastic microelectronic devices ideally capable of independently generating random bits with a tunable weight at a high rate. However, coinflip devices are inherently analog and demonstrate nonidealities, like temperature dependence and drift, that can introduce determinism into the outputs. We present important considerations for building systems of multiple coinflip devices to produce high-quality bitstreams with low error and little dependency on previous bits. Using tunnel diodes as coinflip devices, we implement a control loop to adapt to temperature dependence and generate fair bitstreams with each device. While this can lead to dependencies between bits in a single bitstream, we demonstrate that combining results generated in parallel with individual tunnel diodes can produce fair and unpredictable bitstreams. The suitability of these bitstreams for use in probabilistic computing is then demonstrated through a Monte Carlo approximation of π.

Taylor, Brady Garland [Sandia National Laboratorie↗
NASA NTRS1989

Computers boost structural technology

Derived from matrix methods of structural analysis and finite element methods developed over the last three decades, computational structures technology (CST) blends computer science, numerical analysis, and approximation theory into structural analysis and synthesis. Recent significant advances in CST include stochastic-based modeling, strategies for performing large-scale structural calculations on new computing systems, and the integration of CST with other disciplinary modules for multidisciplinary analysis and design. New methodologies have been developed at NASA for integrated fluid-thermal structural analysis and integrated aerodynamic-structure-control design. The need for multiple views of data for different modules also led to the development of a number of sophisticated data-base management systems. For CST to play a role in the future development of structures technology and in the multidisciplinary design of future flight vehicles, major advances and computational tools are needed in a number of key areas.

Noor, Ahmed K.↗
DOE OSTI2021

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Three-dimensional viscous flows with large secondary velocity

A new system of approximation equations is derived for three-dimensional steady viscous compressible flows in which a primary-flow direction is present, but in which both transverse velocity components can be large. Previous approaches which address simplification of the steady Navier-Stokes equations are discussed, and a new approach is proposed. The transverse velocity vector which corrects a given potential flow has been decomposed into potential and rotational components. It is found that the potential-velocity vector may be assumed small, whereas the rotational-velocity vector may be assumed small, whereas the rotational velocity vector and hence the composite secondary flow can be of order unity. This assumption leads to a system of governing equations whose characteristic polynomial has a non-elliptic form for arbitrary Mach numbers. The resulting non-elliptic approximation equations can be solved as an initial/boundary-value problem. Computed results confirm the small scalar-potential approximation.

Briley, W. R.↗
DOE OSTI2024

Multiphysics Degradation Modeling of Energy Storage Materials via RKPM with a Neural Network-Enhancement

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. A coupled electro-chemo-mechanical reproducing kernel particle method (RKPM) formulation is developed, and a patch-test is formulated to certify optimal convergence of the proposed RKPM method for the coupled physics system. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), pixel-based model construction by RKPM is then used to represent the complex material microstructures for modeling the coupled physics of these systems. Further, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1, 2] is introduced to effectively model damage and crack propagation in the material microstructures; the location, orientation, and solution transition near a localization are automatically captured by superimposed block-level NN optimizations. This NN enrichment approach allows for effective modeling of localizations via a fixed background discretization, relieving tedious efforts for adaptive refinement in traditional mesh-based methods. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022. [2] Baek, J., Chen, J. S., "A Neural Network-Based Enrichment of Reproducing Kernel Approximation for Modeling Brittle Fracture", Computer Methods in Applied Mechanics and Engineering Vol. 410, 116590, 2024.

electro-chemo-mechanical coupling↗
NASA NTRS1991

Ionosphere-exosphere coupling through charge exchange and momentum transfer in hydrogen-proton collisions

The implications of a traditional assumption of exospheric physics, that collisions of hydrogen atoms and protons preferentially result in charge exchange with negligible momentum transfer are examined. Initially adopted as a necessary convenience to accommodate limited computer resources in exosphere model calculations, this approximation results in a direct transformation of the proton velocity distribution into a hot component of neutral hydrogen. With expanding computational facilities, the need for the approximation has passed. As the first step toward its replacement with a realistic, quantum mechanical model of the H - H(+) collision process, differential and cumulative cross sections were calculated for quantum elastic scattering of indistinguishable nuclei for a fine grid of encounter energies and scattering angles. These data are used to study the nature of ionosphere-exosphere coupling through H - H(+) collisions, and to demonstrate that the distribution of velocities of scattered H produced in the traditional exospheric charge exchange approximation, as well as that arising from an alternative, fluid dynamic approach, leads to unacceptable abundances of coronal atoms in long-term, highly elliptic trajectories.

Hodges, R. R., Jr.↗
NASA NTRS1994

Theoretical, Experimental, and Computational Evaluation of Several Vane-Type Slow-Wave Structures

Several types of periodic vane slow-wave structures were fabricated. The dispersion characteristics were found by theoretical analysis, experimental testing, and computer simulation using the MAFIA code. Computer-generated characteristics agreed to approximately within 2 percent of the experimental characteristics for all structures. The theoretical characteristics, however, deviated increasingly as the width to height ratio became smaller. Interaction impedances were also computed based on the experimental and computer-generated resonance frequency shifts due to the introduction of a perturbing dielectric rod.

Wallett, Thomas M.↗
NASA NTRS2012

Computational Modeling of Micro-Crack Induced Attenuation in CFRP Composites

A computational study is performed to determine the contribution to ultrasound attenuation in carbon fiber reinforced polymer composite laminates of linear elastic scattering by matrix micro-cracking. Multiple scattering approximations are benchmarked against exact computational approaches. Results support linear scattering as the source of observed increased attenuation in the presence of micro-cracking.

Roberts, R. A.↗
DOE OSTI2023

Auger spectroscopy beyond the ultra-short core-hole relaxation time approximation

Abstract We present a time-dependent computational approach to study Auger electron spectroscopy (AES) beyond the ultra-short core-hole relaxation time approximation and, as a test case, we apply it to the paradigmatic example of a one-dimensional Mott insulator represented by a half-filled Hubbard chain. The Auger spectrum is usually calculated by assuming that, after the creation of a core-hole, the system thermalizes almost instantaneously. This leads to a relatively simple analytical expression that uses the ground-state with a core-hole as a reference state and ignores all the transient dynamics related to the screening of the core-hole. In this picture, the response of the system can be associated to the pair spectral function. On the other hand, in our numerical calculations, the core hole is created by a light pulse, allowing one to study the transient dynamics of the system in terms of the pulse duration and in the non-perturbative regime. Time-dependent density matrix renormalization group calculations reveal that the relaxation process involves the creation of a polarization cloud of doublon excitations that have an effect similar to photo-doping. As a consequence, there is a leak of spectral weight to higher energies into what otherwise would be the Mott gap. For longer pulses, these excited states, mostly comprised of doublons, can dominate the spectrum. By changing the duration of the light-pulse, the entire screening process can be resolved in time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Numerical simulation of supersonic inlets using a three-dimensional viscous flow analysis

A three-dimensional fully viscous computer analysis, which retains the viscous nature of the Navier-Stokes equations, was evaluated to determine its usefulness in the design of supersonic inlets. This procedure takes advantage of physical approximations to limit the high computer time and storage associated with complete Navier-Stokes solutions. Computed results are presented for a Mach 3.0 supersonic inlet with bleed and a Mach 7.4 hypersonic inlet. Good agreement was obtained between theory and data for both inlets. Results of a mesh sensitivity study are also shown.

Anderson, B. H.↗
NASA NTRS1975

Approximate method for calculating transonic flow about lifting wing-body configurations: Computer program and user's manual

A user's manual is presented for a computer program which calculates inviscid flow about lifting configurations in the free-stream Mach-number range from zero to low supersonic. Angles of attack of the order of the configuration thickness-length ratio and less can be calculated. An approximate formulation was used which accounts for shock waves, leading-edge separation and wind-tunnel wall effects.

Barnwell, R. W.↗
NASA NTRS1975

Comment on the accuracy of Rabitz' effective potential approximation for rotational excitation by collisions

Cross sections for rotational excitation of HCN by low-energy collisions with He have been computed with the effective-potential approximation of Rabitz (1972) and compared with accurate quantum close-coupling results. Elastic cross sections are found to agree to about 20%; inelastic cross sections agree in general magnitude, but not in detailed values for specific quantum transitions.

Green, S.↗
DOE OSTI2017

Genten: Software for Generalized Tensor Decompositions v. 1.0.0

Tensors, or multidimensional arrays, are a powerful mathematical means of describing multiway data. This software provides computational means for decomposing or approximating a given tensor in terms of smaller tensors of lower dimension, focusing on decomposition of large, sparse tensors. These techniques have applications in many scientific areas, including signal processing, linear algebra, computer vision, numerical analysis, data mining, graph analysis, neuroscience and more. The software is designed to take advantage of parallelism present emerging computer architectures such has multi-core CPUs, many-core accelerators such as the Intel Xeon Phi, and computation-oriented GPUs to enable efficient processing of large tensors.

Phipps, EricT.↗
NASA NTRS1993

Improvements to a method for the geometrically nonlinear analysis of compressively loaded stiffened composite panels

The NLPAN computer code uses a finite-strip approach to the analysis of thin-walled prismatic composite structures such as stiffened panels. The code can model in-plane axial loading, transverse pressure loading, and constant through-the-thickness thermal loading, and can account for shape imperfections. The NLPAN code represents an attempt to extend the buckling analysis of the VIPASA computer code into the geometrically nonlinear regime. Buckling mode shapes generated using VIPASA are used in NLPAN as global functions for representing displacements in the nonlinear regime. While the NLPAN analysis is approximate in nature, it is computationally economical in comparison with finite-element analysis, and is thus suitable for use in preliminary design and design optimization. A comprehensive description of the theoretical approach of NLPAN is provided. A discussion of some operational considerations for the NLPAN code is included. NLPAN is applied to several test problems in order to demonstrate new program capabilities, and to assess the accuracy of the code in modeling various types of loading and response. User instructions for the NLPAN computer program are provided, including a detailed description of the input requirements and example input files for two stiffened-panel configurations.

Stoll, Frederick↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗