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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Intermediate scattering functions of a rigid body monoclonal antibody protein in solution studied by dissipative particle dynamic simulation

In the past decade, there was increased research interest in studying internal motions of flexible proteins in solution using Neutron Spin Echo (NSE) as NSE can simultaneously probe the dynamics at the length and time scales comparable to protein domain motions. However, the collective intermediate scattering function (ISF) measured by NSE has the contributions from translational, rotational, and internal motions, which are rather complicated to be separated. Widely used NSE theories to interpret experimental data usually assume that the translational and rotational motions of a rigid particle are decoupled and independent to each other. To evaluate the accuracy of this approximation for monoclonal antibody (mAb) proteins in solution, dissipative particle dynamic computer simulation is used here to simulate a rigid-body mAb for up to about 200 ns. The total ISF together with the ISFs due to only the translational and rotational motions as well as their corresponding effective diffusion coefficients is calculated. The aforementioned approximation introduces appreciable errors to the calculated effective diffusion coefficients and the ISFs. For the effective diffusion coefficient, the error introduced by this approximation can be as large as about 10% even though the overall agreement is considered reasonable. Thus, we need to be cautious when interpreting the data with a small signal change. In addition, the accuracy of the calculated ISFs due to the finite computer simulation time is also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗
DOE OSTI2019

Foreground-Immune Cosmic Microwave Background Lensing with Shear-Only Reconstruction

Cosmic microwave background (CMB) lensing from current and upcoming wide-field CMB experiments such as AdvACT, SPT-3G and Simons Observatory relies heavily on temperature (versus polarization). In this regime, foreground contamination to the temperature map produces significant lensing biases, which cannot be fully controlled by multifrequency component separation, masking, or bias hardening. Here in this Letter, we split the standard CMB lensing quadratic estimator into a new set of optimal “multipole” estimators. On large scales, these multipole estimators reduce to the known magnification and shear estimators, and a new shear B-mode estimator. We leverage the different symmetries of the lensed CMB and extragalactic foregrounds to argue that the shear-only estimator should be approximately immune to extragalactic foregrounds. We build a new method to compute, separately and without noise, the primary, secondary, and trispectrum biases to CMB lensing from foreground simulations. Using this method, we demonstrate that the shear estimator is, indeed, insensitive to extragalactic foregrounds, even when applied to a single-frequency temperature map contaminated with cosmic infrared background, thermal Sunyaev-Zel’dovich, kinematic Sunyaev-Zel’dovich, and radio point sources. This dramatic reduction in foreground biases allows us to include higher temperature multipoles than with the standard quadratic estimator, thus, increasing the total lensing signal-to-noise ratio beyond the quadratic estimator. In addition, magnification-only and shear B-mode estimators provide useful diagnostics for potential residuals.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions

Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of aD-dimensional function specified by aD-dimensional Fourier series. A free parameter,m, which must be less thann, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( m + 1 ) , which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function’s discretization is over exponentially many (2 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10 −6 and 10 −3 , respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-2 trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95 % , as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.

Physics↗
DOE OSTI2023

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

CFD-trained ANN Model for Approximating Near-occupant Condition in Real-time Simulations

The main drawback of Computational Fluid Dynamics (CFD) simulations has been the time and resource consuming nature which is not suitable for real-time applications. In this work, we first generated numerous CFD models of a given indoor space to obtain airspeed, temperature, and mean radiant temperature near an occupant as training data. Several artificial neural networks (ANN) models were trained using this CFD simulated data to approximate near real-time environmental conditions for a given occupant. This trained ANN model approach is a part of a real-time simulation of building operations using a combination of software and real hardware (HVAC equipment) approaches. The preliminary results suggest that the CFD- generated training data and the trained ANN model can accurately approximate such conditions in a real-time application, a method that has great potential in building simulation and building digital twin areas of research.

Zhang, Yun↗
DOE OSTI2023

Data assimilation in operator algebras

We develop an algebraic framework for sequential data assimilation of partially observed dynamical systems. In this framework, Bayesian data assimilation is embedded in a nonabelian operator algebra, which provides a representation of observables by multiplication operators and probability densities by density operators (quantum states). In the algebraic approach, the forecast step of data assimilation is represented by a quantum operation induced by the Koopman operator of the dynamical system. Moreover, the analysis step is described by a quantum effect, which generalizes the Bayesian observational update rule. Projecting this formulation to finite-dimensional matrix algebras leads to computational schemes that are i) automatically positivity-preserving and ii) amenable to consistent data-driven approximation using kernel methods for machine learning. Moreover, these methods are natural candidates for implementation on quantum computers. Applications to the Lorenz 96 multiscale system and the El Niño Southern Oscillation in a climate model show promising results in terms of forecast skill and uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Surrogate Model Selection for Design Space Approximation And Surrogatebased Optimization

Surrogate models are used to map input data to output data when the actual relationship between the two is unknown or computationally expensive to evaluate for sensitivity analysis, uncertainty propagation and surrogate based optimization. This work evaluates the performance of eight surrogate modeling techniques for design space approximation and surrogate based optimization applications over a set of generated datasets with known characteristics. With this work, we aim to provide general rules for selecting an appropriate surrogate model form solely based on the characteristics of the data being modeled. Furthermore, the computational experiments revealed that, in general, multivariate adaptive regression spline models (MARS) and single hidden layer feed forward neural networks (ANN) yielded the most accurate predictions over the design space while Random Forest (RF) models most reliably identified the locations of the optimums when used for surrogate-based optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multi-fidelity Uncertainty Quantification for Homogenization Problems in Structure-Property Relationships from Crystal Plasticity Finite Elements

Crystal plasticity finite element method (CPFEM) has been an integrated computational materials engineering (ICME) workhorse to study materials behaviors and structure-property relationships for the last few decades. These relations are mappings from the microstructure space to the materials properties space. Due to the stochastic and random nature of microstructures, there is always some uncertainty associated with materials properties, for example, in homogenized stress-strain curves. For critical applications with strong reliability needs, it is often desirable to quantify the microstructure-induced uncertainty in the context of structure-property relationships. However, this uncertainty quantification (UQ) problem often incurs a large computational cost because many statistically equivalent representative volume elements (SERVEs) are needed. In this article, we apply a multi-level Monte Carlo (MLMC) method to CPFEM to study the uncertainty in stress-strain curves, given an ensemble of SERVEs at multiple mesh resolutions. By using the information at coarse meshes, we show that it is possible to approximate the response at fine meshes with a much reduced computational cost. We focus on problems where the model output is multi-dimensional, which requires us to track multiple quantities of interest (QoIs) at the same time. In conclusion, our numerical results show that MLMC can accelerate UQ tasks around 2.23x, compared to the classical Monte Carlo (MC) method, which is widely known as ensemble average in the CPFEM literature.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Offline Maximizing Minimally Invasive Proper Orthogonal Decomposition for Reduced-Order Modeling of S n Radiation Transport

Deterministic solutions to the Sn radiation transport equation can be computationally expensive to calculate. Reduced-order modeling enables efficient approximation of the full-order model (FOM) solution. We propose a novel method for constructing reduced-order models (ROMs) of the S n radiation transport equation, offline maximizing minimally invasive (OMMI) proper orthogonal decomposition (POD). POD uses the method of snapshots to create a reduced-order basis for constructing an ROM. Minimally invasive POD leverages the sweep infrastructure existing in deterministic transport codes to create a POD-based ROM, even when infeasible by traditional methods. Offline maximizing minimally invasive proper orthogonal decomposition (OMMI-POD) extends minimally invasive POD by performing sweeps offline, therefore maximizing the potential speedup. OMMI-POD does so by creating a library of reduced systems from a training set. This library of reduced systems is then interpolated to provide a rapid approximate solution of the S n radiation transport equation. The model is evaluated on a set of test problems, achieving a low error with a 466 times speedup over the FOM. Also presented is a study of the effect of sampling method on the performance of OMMI-POD, specifically comparing naive uniform sampling to the more accurate and computationally expensive greedy sampling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Many-Body Basis Set Amelioration Method for Incremental Full Configuration Interaction

Incremental full configuration interaction (iFCI) is a polynomial-cost electronic structure method that systematically approaches the FCI limit by employing the method of increments to solve the Schrödinger equation through a many-body expansion. This article introduces the many-body basis set amelioration (MBBSA) method, which is designed to allow iFCI to be applicable to larger atomic orbital basis sets. MBBSA uses a series of inexpensive iFCI calculations to approximate the correlation energy that would be found using a more expensive, highly accurate iFCI calculation. Here, when compared to standard iFCI computations on smaller molecules in triple-zeta and larger basis sets, MBBSA provides approximations to the total and relative energies within chemical accuracy. MBBSA exhibits a reduced cost of between 60-92% when compared to standard iFCI calculations, with larger systems experiencing the largest benefit. Tests of MBBSA on two reactions that involve highly correlated systems, the automerization of cyclobutadiene and a Criegee intermediate reaction, show that MBBSA has practical utility for studying realistic chemistries.

Basis sets↗
DOE OSTI2026

Deep Neural Networks are Adaptive to Function Regularity and Data Distribution in Approximation and Estimation

Deep learning has exhibited remarkable results across diverse areas. To understand its success, substantial research has been directed towards its theoretical foundations. Nev- ertheless, the majority of these studies examine how well deep neural networks can model functions with uniform regularities. In this paper, we explore a different angle: how deep neural networks can adapt to varying degrees of smoothness in functions and nonuni- form data distributions across different locations and scales. More precisely, we focus on a broad class of functions defined by nonlinear tree-based approximation methods. This class encompasses a range of function types, such as functions with uniform regularities and discontinuous functions. We develop nonparametric approximation and estimation theories for this class using deep ReLU networks. Our results show that deep neural networks are adaptive to the nonuniform smoothness of functions and nonuniform data distributions at different locations and scales. We apply our results to several function classes, and derive the corresponding approximation and generalization errors. The validity of our results is demonstrated through numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Butterfly-Accelerated Volume Integral Equation Solver for Broad Permittivity and Large-Scale Electromagnetic Analysis

In this work, a butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The proposed solver leverages the hierarchical off-diagonal butterfly (HOD-BF) scheme to construct the system matrix and obtain its approximate inverse, used as a preconditioner. Complexity analysis and numerical experiments validate the O(N log 2 N) construction cost of the HOD-BF-compressed system matrix and O(N log 1.5 N) inversion cost for the preconditioner, where N is the number of unknowns in the high-frequency EM scattering problem. For many practical scenarios, the proposed VIE solver requires less memory and computational time to construct the system matrix and obtain its approximate inverse compared to a H matrix-accelerated VIE solver. The accuracy and efficiency of the proposed solver have been demonstrated via its application to the EM analysis of large-scale canonical and real-world structures comprising of broad permittivity values and involving millions of unknowns.

42 ENGINEERING↗
DOE OSTI2023

Hi-COLA: fast, approximate simulations of structure formation in Horndeski gravity

We introduce Hi-COLA, a code designed to run fast, approximate N-body simulations of non-linear structure formation in reduced Horndeski gravity. Given an input Lagrangian, Hi-COLA dynamically constructs the appropriate field equations and consistently solves for the cosmological background, linear growth, and screened fifth force of that theory. Hence Hi-COLA is a general, adaptable, and useful tool that allows the mildly non-linear regime of many Horndeski theories to be investigated for the first time, at low computational cost. In this work, we first describe the screening approximations and simulation setup of Hi-COLA for theories with Vainshtein screening. We validate the code against traditional N-body simulations for cubic Galileon gravity, finding 2.5% agreement up to k max = 1.2 h/Mpc. To demonstrate the flexibility of Hi-COLA, we additionally run the first simulations of an extended shift-symmetric gravity theory. We use the consistency and modularity of Hi-COLA to dissect how the modified background, linear growth, and screened fifth force all contribute to departures from ΛCDM in the non-linear matter power spectrum. Hi-COLA can be found at https://github.com/Hi-COLACode/Hi-COLA.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Propagation of radio frequency waves through turbulent plasmas

The practical and economic viability of tokamak fusion reactors depends, in a significant way, on the efficiency of radio frequency (RF) waves to deliver energy and momentum to the plasma in the core of the reactor. The RF electromagnetic waves, excited by antenna structures placed near the wall of a tokamak, have to propagate through the turbulent edge plasma along their path to the core of the fusion device. In present day experiments, the radial width of the edge region and scrape-off layer is of the order of a few centimeters. In ITER, and in future fusion reactors, this width will be of the order of tens of centimeters. Any effects on RF waves due to plasma turbulence have to be properly understood in order to optimize the delivery of RF energy and momentum into the core. This paper is on a multi-pronged, theoretical and computational, approach that is being pursued to quantify the effect of edge plasma turbulence on the propagation of RF waves. The theoretical and analytical models are based on solutions of the Faraday-Ampere equation in a magnetized plasma and on the Kirchhoff tangent plane approximation. An effective medium approach has been developed so as to approximate the permittivity of a turbulent plasma by analytical expressions. The computations are being carried out with a newly developed code ScaRF that is based on the finite difference finite domain technique for solving Maxwell's equations. The plasma permittivity can be assigned as desired. The code is being used to validate the analytical and theoretical models and to evaluate their limitations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Perturbative readout-error mitigation for near-term quantum computers

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n . In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q , we discuss a method to recover the probability of the all-zeros bit string p 0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly [ 2 n / ( n w ) ] , which we motivate using a simplified error model for which the approximation incurs only O ( q w ) error for some integer w . We then provide a generalized technique to efficiently recover full output distributions with O ( q w ) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

97 MATHEMATICS AND COMPUTING↗