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 55 records · Page 3

From Bethe–Salpeter Wave functions to Generalised Parton Distributions

We review recent works on the modelling of Generalised Parton Distributions within the Dyson-Schwinger formalism. We highlight how covariant computations, using the impulse approximation, allows one to fulfil most of the theoretical constraints of the GPDs. A specific attention is brought to chiral properties and especially the so-called soft pion theorem, and its link with the Axial-Vector Ward-Takahashi identity. The limitation of the impulse approximation are also explained. Beyond impulse approximation computations are reviewed in the forward case. Finally, we stress the advantages of the overlap of lightcone wave functions, and possible ways to construct covariant GPD models within this framework, in a two-body approximation

97 MATHEMATICS AND COMPUTING↗

Analysis, approximation, and computation of a coupled solid/fluid temperature control problem

An optimization problem is formulated motivated by the desire to remove temperature peaks, i.e., 'hot spots', along the bounding surfaces of containers of fluid flows. The heat equation of the solid container is coupled to the energy equations for the fluid. Heat sources can be located in the solid body, the fluid, or both. Control is effected by adjustments to the temperature of the fluid at the inflow boundary. Both mathematical analyses and computational experiments are given.

Gunzburger, Max D.↗

Using Lagrangian perturbation theory for precision cosmology

We explore the Lagrangian perturbation theory (LPT) at one-loop order with Gaussian initial conditions. We present an expansion method to approximately compute the power spectrum LPT. Our approximate solution has good convergence in the series expansion and enables us to compute the power spectrum in LPT accurately and quickly. Non-linear corrections in this theory naturally satisfy the law of conservation of mass because the relation between matter density and the displacement vector of dark matter corresponds to the conservation of mass. By matching the one-loop solution in LPT to the two-loop solution in standard perturbation theory, we present an approximate solution of the power spectrum which has higher order corrections than the two-loop order in standard perturbation theory with the conservation of mass satisfied. With this approximation, we can use LPT to compute a non-linear power spectrum without any free parameters, and this solution agrees with numerical simulations at k = 0.2 h Mpc{sup –1} and z = 0.35 to better than 2%.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite number of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dynamic Inversion for Hydrological Process Monitoring with Electrical Resistance Tomography Under Model Uncertainty

We propose an approach for imaging the dynamics of complex hydrological processes. The evolution of electrically conductive fluids in porous media is imaged using time-lapse electrical resistance tomography. The related dynamic inversion problem is solved using Bayesian filtering techniques, that is, it is formulated as a sequential state estimation problem in which the target is an evolving posterior probability density of the system state. The dynamical inversion framework is based on the state space representation of the system, which involves the construction of a stochastic evolution model and an observation model. The observation model used in this paper consists of the complete electrode model for ERT, with Archie's law relating saturations to electrical conductivity. The evolution model is an approximate model for simulating flow through partially saturated porous media. Unavoidable modeling and approximation errors in both the observation and evolution models are considered by computing approximate statistics for these errors. These models are then included in the construction of the posterior probability density of the estimated system state. This approximation error method allows the use of approximate - and therefore computationally efficient - observation and evolution models in the Bayesian filtering. We consider a synthetic example and show that the incorporation of an explicit model for the model uncertainties in the state space representation can yield better estimates than a frame-by-frame imaging approach.

54 ENVIRONMENTAL SCIENCES↗

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗

SFU-Driven Transparent Approximation Acceleration on GPUs

Approximate computing, the technique that sacrifices certain amount of accuracy in exchange for substantial performance boost or power reduction, is one of the most promising solutions to enable power control and performance scaling towards exascale. Although most existing approximation designs target the emerging data-intensive applications that are comparatively more error-tolerable, there is still high demand for the acceleration of traditional scientific applications (e.g., weather and nuclear simulation), which often comprise intensive transcendental function calls and are very sensitive to accuracy loss. To address this challenge, we focus on a very important but often ignored approximation unit on GPUs.

Approximate computing↗

An approximate solution to improve computational efficiency of impedance-type payload load prediction

The computational efficiency of the impedance type loads prediction method was studied. Three goals were addressed: devise a method to make the impedance method operate more efficiently in the computer; assess the accuracy and convenience of the method for determining the effect of design changes; and investigate the use of the method to identify design changes for reduction of payload loads. The method is suitable for calculation of dynamic response in either the frequency or time domain. It is concluded that: the choice of an orthogonal coordinate system will allow the impedance method to operate more efficiently in the computer; the approximate mode impedance technique is adequate for determining the effect of design changes, and is applicable for both statically determinate and statically indeterminate payload attachments; and beneficial design changes to reduce payload loads can be identified by the combined application of impedance techniques and energy distribution review techniques.

White, C. W.↗

A computational procedure to analyze metal matrix laminates with nonlinear lamination residual strains

An approximate computational procedure is described for the analysis of angleplied laminates with residual nonlinear strains. The procedure consists of a combination of linear composite mechanics and incremental linear laminate theory. The procedure accounts for initial nonlinear strains, unloading, and in-situ matrix orthotropic nonlinear behavior. The results obtained in applying the procedure to boron/aluminum angleplied laminates show that this is a convenient means to accurately predict the initial tangent properties of angleplied laminates in which the matrix has been strained nonlinearly by the lamination residual stresses. The procedure predicted initial tangent properties results which were in good agreement with measured data obtained from boron/aluminum angleplied laminates.

Chamis, C. C.↗

A computational procedure to analyze metal matrix laminates with nonlinear lamination residual strains

An approximate computational procedure is described for the analysis of angleplied laminates with residual nonlinear strains. The procedure consists of a combination of linear composite mechanics and incremental linear laminate theory. The procedure accounts for initial nonlinear strains, unloading, and in-situ matrix orthrotropic nonlinear behavior. The results obtained in applying the procedure to boron/aluminum angleplied laminates show that this is a convenient means to accurately predict the initial tangent properties of angleplied laminates in which the matrix has been strained nonlinearly by the lamination residual stresses. The procedure predicted initial tangent properties results which were in good agreement with measured data obtained from boron/aluminum angleplied laminates.

Chamis, C. C.↗

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗

APPRENTICE

SF-19-096 In this software, there are multiple approaches to compute approximations to multivariate functions. This includes: (a) an approach that builds on Stieltjes process to efficiently compute the coefficients of the rational approximation, (b) an approach that is based on an optimization formulation to get pole-free coefficients of the rational approximation and (c) approaches that finds the coefficients of rational and polynomial approximations by finding the linear least-squares solution using singular value decomposition.

KRISNAMOORTHY, MOHAN↗

Approximate Cartesian state transition matrix

Based on a Taylor series expansion, an easily-computed approximation to the Cartesian state transition matrix is presented for a general velocity-independent force field. Suitable for the short time intervals encountered in onboard navigation applications of the extended Kalman filter, it provides approximately five decimal digits of accuracy for earth orbiting spacecraft with update intervals of one minute, and better accuracy for shorter intervals.

Markley, F. L.↗