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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

EXTENSION OF THE MURAM RADIATIVE MHD CODE FOR CORONAL SIMULATIONS

We present a new version of the MURaM radiative magnetohydrodynamics (MHD) code that allows for simulations spanning from the upper convection zone into the solar corona. We implement the relevant coronal physics in terms of optically thin radiative loss, field aligned heat conduction, and an equilibrium ionization equation of state. We artificially limit the coronal Alfvén and heat conduction speeds to computationally manageable values using an approximation to semi-relativistic MHD with an artificially reduced speed of light (Boris correction). We present example solutions ranging from quiet to active Sun in order to verify the validity of our approach. We quantify the role of numerical diffusivity for the effective coronal heating. We find that the (numerical) magnetic Prandtl number determines the ratio of resistive to viscous heating and that owing to the very large magnetic Prandtl number of the solar corona, heating is expected to happen predominantly through viscous dissipation. We find that reasonable solutions can be obtained with values of the reduced speed of light just marginally larger than the maximum sound speed. Overall this leads to a fully explicit code that can compute the time evolution of the solar corona in response to photospheric driving using numerical time steps not much smaller than 0.1 s. Numerical simulations of the coronal response to flux emergence covering a time span of a few days are well within reach using this approach.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1948

The Problem of Torsion in Prismatic Members of Circular Segmental Cross Section

The problem is solved by approximation, by setting up a function complying with the differential equation of the stress function, and determining the coefficients appearing in it in such a way that the boundary condition is fulfilled as nearly as possible. For the semicircle, for which the solution is known, the method yields very accurate values; the approximated stress distribution is in good agreement with the accurately computed distribution. Stress and strain measurements indicate that the approximate solution is in sufficiently exact agreement with reality for segmental cross sections.

Weigand, A.↗
DOE OSTI2025

Accelerating Embedding Potential Optimization by Reconstructing the Pseudo-Valence Electron Density

Density functional embedding theory (DFET) enables use of electronic structure methods with higher accuracy than density functional theory in a local region, with applications thus far ranging from (photo/electro)catalysis to reactions in solution. DFET partitions a large collection of atoms into smaller groups that interact via a shared embedding (interaction) potential V emb , determined via functional optimization. The optimized effective potential (OEP) process used to optimize V emb is time-consuming and becomes a computational bottleneck due to sharp, oscillating features of V emb near nuclei. Here, similar to pseudopotential theory, by reconstructing electron densities used in the OEP process from smoother pseudo-valence-only (PVO) electron densities as proxies for total densities of the full system and subsystems, we can retain accuracy in the embedded electronic structure calculations while potentially reducing the overhead of V emb construction, within the projector augmented-wave (PAW) formalism. We explore three different chemical reactions as exemplars to test PVO–DFET, namely, H 2 dissociative adsorption on a Cu(111) surface, H 2 O adsorption on a Pt(111) surface, and aqueous [Ca 2+ –SO 4 2– ] ion-pair formation. The PVO approximation works well for all three systems with minimal loss of accuracy (∼10–70 meV error relative to the original exact-derivative (ED) approach) while accelerating V emb generation for the Cu and Pt systems respectively by 20× and 5×. Given proper numerical convergence parameters, the spatial distributions of differences between PVO- and ED-based V emb outside the core regions are small, explaining the exceptional agreement between the two approaches. Finally, we anticipate that this more efficient PVO–DFET approximation will be useful whenever computation of V emb is much more expensive than subsequent embedded high-level electron correlation calculations.

approximation↗
DOE OSTI2026

Connection between classical and quantum descriptions of spin waves using quantum circuits

A quantum computing circuit is presented that approximates a single spin wave quantum on a linear chain of spin 1/2 particles described by a Heisenberg Hamiltonian. The circuit is a product state where each qubit represents a spin. The spin wave motion is represented by opening the cone angle using Y rotations and then adding progressive Z rotations along the chain to represent wave propagation. We show analytically that this product state yields the correct dispersion relation in the limit of an unbounded chain. This observation is confirmed using both a simulator and various quantum processors. The use of the quantum computing paradigm in this case does not lead to a computational advantage, but rather leads to a novel conceptual connection between classical and quantum descriptions of spin waves, and may also be useful for characterizing the error in quantum processors.

magnons↗
DOE OSTI2026

Comparison between explicit and implicit discretization strategies for a dissipative thermal environment

We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗
DOE OSTI2023

A localized ensemble of approximate Gaussian processes for fast sequential emulation

More attention has been given to the computational cost associated with the fitting of an emulator. Substantially less attention is given to the computational cost of using that emulator for prediction. This is primarily because the cost of fitting an emulator is usually far greater than that of obtaining a single prediction, and predictions can often be obtained in parallel. In many settings, especially those requiring Markov Chain Monte Carlo, predictions may arrive sequentially and parallelization is not possible. In this case, using an emulator procedure which can produce accurate predictions efficiently can lead to substantial time savings in practice. In this paper, we propose a global model approximate Gaussian process framework via extension of a popular local approximate Gaussian process (laGP) framework. Our proposed emulator can be viewed as a treed Gaussian process where the leaf nodes are laGP models, and the tree structure is learned greedily as a function of the prediction stream. The suggested method (called leapGP) has interpretable tuning parameters which control the time‐memory trade‐off. One reasonable choice of settings leads to an emulator with a training cost and makes predictions rapidly with an asymptotic amortized cost of .

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Monte Carlo turbulence simulation using rational approximations to von Karman spectra

Turbulence simulation is computationally much simpler using rational spectra, but turbulence falls off as f exp -5/3 in frequency ranges of interest to aircraft response and as predicted by von Karman's model. Rational approximations to von Karman spectra should satisfy three requirements: (1) the rational spectra should provide a good approximation to the von Karman spectra in the frequency range of interest; (2) for stability, the resulting rational transfer function should have all its poles in the left half-plane; and (3) at high frequencies, the rational spectra must fall off as an integer power of frequency, and since the -2 power is closest to the -5/3 power, the rational approximation should roll off as the -2 power at high frequencies. Rational approximations to von Karman spectra that satisfy these three criteria are presented, along with spectra from simulated turbulence. Agreement between the spectra of the simulated turbulence and von Karman spectra is excellent.

Campbell, C. W.↗
NASA NTRS1993

Structural design utilizing updated, approximate sensitivity derivatives

A method to improve the computational efficiency of structural optimization algorithms is investigated. In this method, the calculations of 'exact' sensitivity derivatives of constraint functions are performed only at selected iterations during the optimization process. The sensitivity derivatives utilized within other iterations are approximate derivatives which are calculated using an inexpensive derivative update formula. Optimization results are presented for an analytic optimization problem (i.e., one having simple polynomial expressions for the objective and constraint functions) and for two structural optimization problems. The structural optimization results indicate that up to a factor of three improvement in computation time is possible when using the updated sensitivity derivatives.

Scotti, Stephen J.↗
NASA NTRS1976

Solar heating in the Mars dusty atmosphere

The complex refractive index in the solar spectral region is estimated. With this index and the size distribution estimated from the UVS data Mie theory is used to compute the radiative parameters required for including radiative scattering in simplified radiative transfer approximations. These approximations then enable the wavelength-integrated solar heating to be computed for various dust-laden Martian atmospheres. The calculations presented in the main body of the paper were computer using the delta-Eddington approximation.

Zurek, R. W.↗
NASA NTRS1967

Matrix Analysis of Longitudinal and Torsional Vibrations in Nonuniform Multibranch Beams

Since longitudinal modes and frequencies provide basic data for dynamic analyses of arbitrary beam-like structures and since closed-form solutions for the modes are generally not feasible to obtain, an approximate method is developed for computing the natural frequencies and the corresponding mode shapes for a variable-section, unconstrained multibranch beam. A lumped mass analogy employing influence coefficients is used to represent the beam. The simultaneous equations of motion for the lumped mass system are derived in matrix form and algebraically manipulated to yield a classical eigenvalue equation solvable by standard procedures. The orthogonality relationship of the natural modes is derived and used to form the basis of an orthogonal sweeping process for determination of modes above the fundamental. Numerical examples including an application to a solid-fuel launch system are presented. Also, a detailed discussion is devoted to the theoretical verifications of the approximate modes and frequencies.

Wingate, Robert T.↗
DOE OSTI2018

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Learning nonlinear operators in latent spaces for real-time predictions of complex dynamics in physical systems

Abstract Predicting complex dynamics in physical applications governed by partial differential equations in real-time is nearly impossible with traditional numerical simulations due to high computational cost. Neural operators offer a solution by approximating mappings between infinite-dimensional Banach spaces, yet their performance degrades with system size and complexity. We propose an approach for learning neural operators in latent spaces, facilitating real-time predictions for highly nonlinear and multiscale systems on high-dimensional domains. Our method utilizes the deep operator network architecture on a low-dimensional latent space to efficiently approximate underlying operators. Demonstrations on material fracture, fluid flow prediction, and climate modeling highlight superior prediction accuracy and computational efficiency compared to existing methods. Notably, our approach enables approximating large-scale atmospheric flows with millions of degrees, enhancing weather and climate forecasts. Here we show that the proposed approach enables real-time predictions that can facilitate decision-making for a wide range of applications in science and engineering.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer

There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We introduce a new circuit optimizer called AQCEL, which aims to remove redundant controlled operations from controlled gates, depending on initial states of the circuit. Especially, the AQCEL can remove unnecessary qubit controls from multi-controlled gates in polynomial computational resources, even when all the relevant qubits are entangled, by identifying zero-amplitude computational basis states using a quantum computer. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. For this benchmark, we have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates. Moreover, when deploying AQCEL with a noisy intermediate scale quantum computer, it efficiently produces a quantum circuit that approximates the original circuit with high fidelity by truncating low-amplitude computational basis states below certain thresholds. Our technique is useful for a wide variety of quantum algorithms, opening up new possibilities to further simplify quantum circuits to be more effective for real devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Goal-oriented real-time Bayesian inference for linear autonomous dynamical systems with application to digital twins for tsunami early warning

We present a goal-oriented framework for constructing digital twins with the following properties: (1) they employ discretizations of high-fidelity partial differential equation (PDE) models governed by autonomous dynamical systems, leading to large-scale forward problems; (2) they solve a linear inverse problem to assimilate observational data to infer uncertain model components followed by a forward prediction of the evolving dynamics; and (3) the entire end-to-end, data-to-inference-to-prediction computation is carried out without approximation and in real time through a Bayesian framework that rigorously accounts for uncertainties. Several challenges must be overcome to realize this framework, including the large scale of the forward problem, the high dimensionality of the parameter space, and for a class of problems including those we target, the slow decay of the singular values of the parameter-to-observable map. Here we introduce a methodology to overcome these challenges by exploiting the autonomous structure of the forward model to decompose the solution of the inverse problem into a one-time-only offline phase in which the PDE model is solved a limited number of times (equal to the number of sensors), and an online phase that maps well onto GPUs and computes the parameter inference and prediction of quantities of interest in real time, given observational data. Our ultimate goal is to apply this framework to construct digital twins for subduction zones, including Cascadia, to provide early warning for tsunamis generated by megathrust earthquakes. To this end, we demonstrate how our methodology can be used to employ seafloor pressure observations, along with the coupled acoustic–gravity wave equations, to infer the earthquake-induced spatiotemporal seafloor motion (discretized with $\mathscr{O}$ (10 9 ) parameters) and forward predict the tsunami propagation. We present results of an end-to-end inference, prediction, and uncertainty quantification for a representative test problem with $\mathscr{O}$ (10 8 ) inversion parameters for which goal-oriented Bayesian inference is accomplished exactly and in real time, that is, in a matter of seconds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Efficient electronic structure theory via hierarchical scale-adaptive coupled-cluster formalism: I. Theory and computational complexity analysis

In this work, a novel reduced-scaling, general-order coupled-cluster approach is formulated by exploiting hierarchical representations of many-body tensors, combined with the recently suggested formalism of scale-adaptive tensor algebra. Inspired by the hierarchical techniques from the renormalization group approach, H/H 2 -matrix algebra and fast multipole method, the computational scaling reduction in our formalism is achieved via coarsening of quantum many-body interactions at larger interaction scales, thus imposing a hierarchical structure on many-body tensors of coupled-cluster theory. In our approach, the interaction scale can be defined on any appropriate Euclidean domain (spatial domain, momentum-space domain, energy domain, etc.). Additionally, we show that the hierarchically resolved many-body tensors reduce the storage requirements to O(N), where N is the number of simulated quantum particles. Subsequently, we prove that any connected many-body diagram with arbitrary-order tensors, e.g., an arbitrary coupled-cluster diagram, can be evaluated in O(NlogN) floating-point operations. On top of that, we elaborate an additional approximation to further reduce the computational complexity of higher-order coupled-cluster equations, i.e., equations involving higher than double excitations, which otherwise would introduce a large prefactor into formal O(NlogN) scaling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Quantum transitions through cosmological singularities

In a quantum theory of cosmology spacetime behaves classically only in limited patches of the configuration space on which the wave function of the universe is defined. Quantum transitions can connect classical evolution in different patches. Working in the saddle point approximation and in minisuperspace we compute quantum transitions connecting inflationary histories across a de Sitter like throat or a singularity. This supplies probabilities for how an inflating universe, when evolved backwards, transitions and branches into an ensemble of histories on the opposite side of a quantum bounce. Generalising our analysis to scalar potentials with negative regions we identify saddle points describing a quantum transition between a classically contracting, crunching ekpyrotic phase and an inflationary universe.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Generative diffusion model surrogates for mechanistic agent-based biological models

Mechanistic, multicellular, agent-based models are commonly used to investigate tissue, organ, and organism-scale biology at single-cell resolution. The Cellular-Potts Model (CPM) is a powerful and popular framework for developing and interrogating these models. CPMs become computationally expensive at large space- and time- scales making application and investigation of developed models difficult. Surrogate models may allow for the accelerated evaluation of CPMs of complex biological systems. However, the stochastic nature of these models means each set of parameters may give rise to different model configurations, complicating surrogate model development. In this work, we leverage denoising diffusion probabilistic models (DDPMs) to train a generative AI surrogate of a CPM used to investigate in vitro vasculogenesis. We describe the use of an image classifier to learn the characteristics that define unique areas of a 2-dimensional parameter space. We then apply this classifier to aid in surrogate model selection and verification. Our CPM model surrogate generates model configurations 20,000 timesteps ahead of a reference configuration and demonstrates approximately a 22x reduction in computational time as compared to native code execution. Our work represents a step towards the implementation of DDPMs to develop digital twins of stochastic biological systems.

97 MATHEMATICS AND COMPUTING↗