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.

SourceResearch connectionFrom yearThrough year

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

At least 1,153 records · Page 64

All sources NASA NTRS DOE OSTI

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.↗

DOE OSTI2015

The interaction of RNA helicase DDX3 with HIV-1 Rev-CRM1-RanGTP complex during the HIV replication cycle

Molecular traffic between the nucleus and the cytoplasm is regulated by the nuclear pore complex (NPC), which acts as a highly selective channel perforating the nuclear envelope in eukaryotic cells. The human immunodeficiency virus (HIV) exploits the nucleocytoplasmic pathway to export its RNA transcripts across the NPC to the cytoplasm. Despite extensive study on the HIV life cycle and the many drugs developed to target this cycle, no current drugs have been successful in targeting the critical process of viral nuclear export, even though HIV’s reliance on a single host protein, CRM1, to export its unspliced and partially spliced RNA transcripts makes it a tempting target. Due to recent findings implicating a DEAD-box helicase, DDX3, in HIV replication and a member of the export complex, it has become an appealing target for anti-HIV drug inhibition. In the present research, we have applied a hybrid computational protocol to analyze protein-protein interactions in the HIV mRNA export cycle. This method is based on molecular docking followed by molecular dynamics simulation and accompanied by approximate free energy calculation (MM/GBSA), computational alanine scanning, clustering, and evolutionary analysis. We highlight here some of the most likely binding modes and interfacial residues between DDX3 and CRM1 both in the absence and presence of RanGTP. This work shows that although DDX3 can bind to free CRM1, addition of RanGTP leads to more concentrated distribution of binding modes and stronger binding between CRM1 and RanGTP.

59 BASIC BIOLOGICAL SCIENCES↗

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 OSTI2014

TH-E-BRE-02: A Forward Scattering Approximation to Dose Calculation Using the Linear Boltzmann Transport Equation

Purpose: To investigate the use of the linear Boltzmann transport equation as a dose calculation tool which can account for interface effects, while still having faster computation times than Monte Carlo methods. In particular, we introduce a forward scattering approximation, in hopes of improving calculation time without a significant hindrance to accuracy. Methods: Two coupled Boltzmann transport equations were constructed, one representing the fluence of photons within the medium, and the other, the fluence of electrons. We neglect the scattering term within the electron transport equation, resulting in an extreme forward scattering approximation to reduce computational complexity. These equations were then solved using a numerical technique for solving partial differential equations, known as a finite difference scheme, where the fluence at each discrete point in space is calculated based on the fluence at the previous point in the particle's path. Using this scheme, it is possible to develop a solution to the Boltzmann transport equations by beginning with boundary conditions and iterating across the entire medium. The fluence of electrons can then be used to find the dose at any point within the medium. Results: Comparisons with Monte Carlo simulations indicate that even simplistic techniques for solving the linear Boltzmann transport equation yield expected interface effects, which many popular dose calculation algorithms are not capable of predicting. Implementation of a forward scattering approximation does not appear to drastically reduce the accuracy of this algorithm. Conclusion: Optimized implementations of this algorithm have been shown to be very accurate when compared with Monte Carlo simulations, even in build up regions where many models fail. Use of a forward scattering approximation could potentially give a reasonably accurate dose distribution in a shorter amount of time for situations where a completely accurate dose distribution is not required, such as in certain optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

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↗

NASA NTRS1986

Numerical simulation of unsteady, viscous, high-angle-of-attack flows using a partially flux-split algorithm

Viscous separated flow surrounding a hemisphere-cylinder body at angles of attack ranging up to 19 deg in transonic flow has been computed using an implicit, approximately-factored, partially flux-split algorithm. The resulting flowfield structures, including the vortical flow on the leeward side of the body and the three-dimensional separation patterns, have been investigated. The computed results show good qualitative and quantitative agreement with experimental data. Furthermore, visualization of the flowfield patterns has yielded insight into the behavior of the three-dimensional separated flow.

Ying, S. X.↗

NASA NTRS1944

Determination of the Stresses Produced by the Landing Impact in the Bulkheads of a Seaplane Bottom

The present report deals with the determination of the impact stresses in the bulkhead floors of a seaplane bottom. The dynamic problem is solved on the assumption of a certain elastic system, the floor being assumed as a weightless elastic beam with concentrated masses at the ends (due to the mass of the float) and with a spring which replaces the elastic action of the keel in the center. The distributed load on the floor is that due to the hydrodynamic force acting over a certain portion of the bottom. The pressure distribution over the width of the float is assumed to follow the Wagner law. The formulas given for the maximum bending moment are derived on the assumption that the keel is relatively elastic, in which case it can be shown that at each instant of time the maximum bending moment is at the point of juncture of the floor with the keel. The bending moment at this point is a function of the half width of the wetted surface c and reaches its maximum value when c is approximately equal to b/2 where b is the half width of the float. In general, however, for computing the bending moment the values of the bending moment at the keel for certain values of c are determined and a curve is drawn. The illustrative sample computation gave for the stresses a result approximately equal to that obtained by the conventional factory computation.

Darevsky, V. M.↗

DOE OSTI2019

Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm

Algebraic multigrid (AMG) coarse spaces are commonly constructed so that they exhibit the so-called weak approximation property (WAP) which is a necessary and sufficient condition for uniform two-grid convergence. Here, this paper studies a modification of such coarse spaces so that the modified ones provide approximation in energy norm. Our modification is based on the projection in energy norm onto an orthogonal complement of original coarse space. This generally leads to dense modified coarse space matrices, which is hence computationally infeasible. To remedy this, based on the fact that the projection involves inverse of a well-conditioned matrix, we use polynomials to approximate the projection and, therefore, obtain a practical, sparse modified coarse matrix and prove that the modified coarse space maintains computationally feasible approximation in energy norm. We present some numerical results for both PDE discretization matrices as well as graph Laplacian ones, which are in accordance with our theoretical results.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

A near-stationary subspace for ridge approximation

Response surfaces are common surrogates for expensive computer simulations in engineering analysis. However, the cost of fitting an accurate response surface increases exponentially as the number of model inputs increases, which leaves response surface construction intractable for high-dimensional, nonlinear models. Here we describe ridge approximation for fitting response surfaces in several variables. A ridge function is constant along several directions in its domain, so fitting occurs on the coordinates of a low-dimensional subspace of the input space. We review essential theory for ridge approximation – e.g., the best mean-squared approximation and an optimal low-dimensional subspace – and we prove that the gradient-based active subspace is near-stationary for the least-squares problem that defines an optimal subspace. Motivated by the theory, we propose a computational heuristic that uses an estimated active subspace as an initial guess for a ridge approximation fitting problem. We show a simple example where the heuristic fails, which reveals a type of function for which the proposed approach is inappropriate. We then propose a simple alternating heuristic for fitting a ridge function, and we demonstrate the effectiveness of the active subspace initial guess applied to an airfoil model of drag as a function of its 18 shape parameters.

42 ENGINEERING↗

DOE OSTI2021

Numerical solution of singular Lyapunov equations

We consider the numerical solution of large scale singular (continuous-time) Lyapunov equations of the form AX + XA T + BB T = 0, where A is semistable, that is, its spectrum is contained in the left half plane, with the exception of a few semisimple eigenvalues at zero. We also consider the case of a few semisimple eigenvalues on the imaginary axis. We assume that we know these few eigenvalues (zero or imaginary), and that we have or can compute the corresponding invariant subspaces. We use this information to build an appropriate newly proposed subspace on which to project the Lyapunov equations, and then compute a low-rank approximation to the least squares solution. Selected illustrative numerical examples are provided.

97 MATHEMATICS AND COMPUTING↗