Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Sound propagation in realistic interactive 3D scenes with parameterized sources using deep neural operators

We address the challenge of acoustic simulations in three-dimensional (3D) virtual rooms with parametric source positions, which have applications in virtual/augmented reality, game audio, and spatial computing. The wave equation can fully describe wave phenomena such as diffraction and interference. However, conventional numerical discretization methods are computationally expensive when simulating hundreds of source and receiver positions, making simulations with parametric source positions impractical. To overcome this limitation, we propose using deep operator networks to approximate linear wave-equation operators. This enables the rapid prediction of sound propagation in realistic 3D acoustic scenes with parametric source positions, achieving millisecond-scale computations. By learning a compact surrogate model, we avoid the offline calculation and storage of impulse responses for all relevant source/listener pairs. Our experiments, including various complex scene geometries, show good agreement with reference solutions, with root mean squared errors ranging from 0.02 to 0.10 Pa. Notably, our method signifies a paradigm shift as—to our knowledge—no prior machine learning approach has achieved precise predictions of complete wave fields within realistic domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗
DOE OSTI2020

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multirate linearly-implicit GARK schemes

Many complex applications require the solution of initial-value problems where some components change fast, while others vary slowly. Multirate schemes apply different step sizes to resolve different components of the system, according to their dynamics, in order to achieve increased computational efficiency. The stiff components of the system, fast or slow, are best discretized with implicit base methods in order to ensure numerical stability. To this end, linearly implicit methods are particularly attractive as they solve only linear systems of equations at each step. This paper develops the Multirate GARK-ROS/ROW (MR-GARK-ROS/ROW) framework for linearly-implicit multirate time integration. The order conditions theory considers both exact and approximative Jacobians. The effectiveness of implicit multirate methods depends on the coupling between the slow and fast computations; an array of efficient coupling strategies and the resulting numerical schemes are analyzed. Multirate infinitesimal step linearly-implicit methods, that allow arbitrarily small micro-steps and offer extreme computational flexibility, are constructed. The new unifying framework includes existing multirate Rosenbrock(-W) methods as particular cases, and opens the possibility to develop new classes of highly effective linearly implicit multirate integrators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Computational Information Criterion for Particle-Tracking with Sparse or Noisy Data

Traditional probabilistic methods for the simulation of advection-diffusion equations (ADEs) often overlook the entropic contribution of the discretization, e.g., the number of particles, within associated numerical methods. Many times, the gain in accuracy of a highly discretized numerical model is outweighed by its associated computational costs or the noise within the data. Herein, we address the question of how many particles are needed in a simulation to best approximate and estimate parameters in one-dimensional advective-diffusive transport. To do so, we use the well-known Akaike Information Criterion (AIC) and a recently-developed correction called the Computational Information Criterion (COMIC) to guide the model selection process. Random-walk and mass-transfer particle tracking methods are employed to solve the model equations at various levels of discretization. Numerical results demonstrate that the COMIC provides an optimal number of particles that can describe a more efficient model in terms of parameter estimation and model prediction compared to the model selected by the AIC even when the data is sparse or noisy, the sampling volume is not uniform throughout the physical domain, or the error distribution of the data is non-IID Gaussian.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Marginal unbiased score expansion and application to CMB lensing

Here, we present the marginal unbiased score expansion (MUSE) method, an algorithm for generic high-dimensional hierarchical Bayesian inference. MUSE performs approximate marginalization over arbitrary non-Gaussian latent parameter spaces, yielding Gaussianized asymptotically unbiased and near-optimal constraints on global parameters of interest. It is computationally much cheaper than exact alternatives like Hamiltonian Monte Carlo (HMC), excelling on funnel problems which challenge HMC, and does not require any problem-specific user supervision like other approximate methods such as variational inference or many simulation-based inference methods. MUSE makes possible the first joint Bayesian estimation of the delensed Cosmic Microwave Background (CMB) power spectrum and gravitational lensing potential power spectrum, demonstrated here on a simulated data set as large as the upcoming South Pole Telescope 3G 1500 deg 2 survey, corresponding to a latent dimensionality of ~6 million and of order 100 global bandpower parameters. On a subset of the problem where an exact but more expensive HMC solution is feasible, we verify that MUSE yields nearly optimal results. We also demonstrate that existing spectrum-based forecasting tools which ignore pixel-masking underestimate predicted error bars by only ~10%. This method is a promising path forward for fast lensing and delensing analyses which will be necessary for future CMB experiments such as SPT-3G, Simons Observatory, or CMB-S4, and can complement or supersede existing HMC approaches. The success of MUSE on this challenging problem strengthens its case as a generic procedure for a broad class of high-dimensional inference problems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Machine learning simulation of finite element analysis in augmented reality

Media, method and system for approximating a finite element analysis texture map for an object. To accomplish this, the object is converted to a computer generated model and finite element analysis is performed for a plurality of different simulated inputs to generate a plurality of simulated mappings. Each simulated mapping is converted into a simulated texture map. A machine learning model is trained on the simulated inputs and simulated texture maps to generate a texture map which approximates a finite element analysis. The machine learning model receives a user input and generates the texture map therefrom. The texture map is then wrapped to the object and displayed.

Scherer, Derek Carl↗
DOE OSTI2021

Implementation of ACTS into sPHENIX Track Reconstruction

Abstract sPHENIX is a high energy nuclear physics experiment under construction at the Relativistic Heavy Ion Collider at Brookhaven National Laboratory (BNL). The primary physics goals of sPHENIX are to study the quark-gluon-plasma, as well as the partonic structure of protons and nuclei, by measuring jets, their substructure, and heavy flavor hadrons in $$p$$ p $$+$$ + $$p$$ p , p + Au, and Au + Au collisions. sPHENIX will collect approximately 300 PB of data over three run periods, to be analyzed using available computing resources at BNL; thus, performing track reconstruction in a timely manner is a challenge due to the high occupancy of heavy ion collision events. The sPHENIX experiment has recently implemented the A Common Tracking Software (ACTS) track reconstruction toolkit with the goal of reconstructing tracks with high efficiency and within a computational budget of 5 s per minimum bias event. This paper reports the performance status of ACTS as the default track fitting tool within sPHENIX, including discussion of the first implementation of a time projection chamber geometry within ACTS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Water reactive polyurethane grouting for deep vadose zone contaminant immobilization

Contaminants in the deep vadose zone (DVZ) pose a long-term threat to groundwater, human health, and the environment. Polyurethane grouting is a type of chemical grouting that is potentially advantageous in immobilizing contaminants in DVZs. Polyurethane resin has low viscosity that makes it feasible to penetrate and fill the pore space between fine particles. Here, in this study a series of laboratory pressure grouting and leaching tests were conducted to simulate and assess the effectiveness of polyurethane grouting for immobilizing contaminants in DVZs. Soil with fine particles was prepared with 127 I (as iodide) that served as a non-radioactive surrogate for radioactive 129 I. After grouting and curing, leaching tests were used to measure and compare contaminant diffusivity and leachability index values. Additionally, changes in porosity and saturated hydraulic conductivity of grouted soil were measured. X-Ray Computer Tomography (XCT) results showed that the cured polyurethane was distributed nearly homogeneously and approximately half of the voids were filled with cured polyurethane. Grouting reduced the saturated hydraulic conductivity of soil by 37 %. The effective diffusivity decreased by more than 80 % as compared with the ungrouted soil. The leachability index of the grouted soil was 6.5; meeting the criteria established by the U.S. Nuclear Regulatory Commission (NRC) standard. The results obtained in this study provide a valuable assessment of polyurethane grouting for iodide immobilization in the DVZ and indicate this approach may be a viable method for contaminant remediation in DVZ soils.

Contaminant Diffusion↗
DOE OSTI2020

A generalized approximate control variate framework for multifidelity uncertainty quantification

We describe and analyze a variance reduction approach for Monte Carlo (MC) sampling that accelerates the estimation of statistics of computationally expensive simulation models using an ensemble of models with lower cost. These lower cost models — which are typically lower fidelity with unknown statistics — are used to reduce the variance in statistical estimators relative to a MC estimator with equivalent cost. We derive the conditions under which our proposed approximate control variate framework recovers existing multifidelity variance reduction schemes as special cases. We demonstrate that existing recursive/nested strategies are suboptimal because they use the additional low-fidelity models only to efficiently estimate the unknown mean of the first low-fidelity model. As a result, they cannot achieve variance reduction beyond that of a control variate estimator that uses a single low-fidelity model with known mean. However, there often exists about an order-of-magnitude gap between the maximum achievable variance reduction using all low-fidelity models and that achieved by a single low-fidelity model with known mean. We show that our proposed approach can exploit this gap to achieve greater variance reduction by using non-recursive sampling schemes. The proposed strategy reduces the total cost of accurately estimating statistics, especially in cases where only low-fidelity simulation models are accessible for additional evaluations. Several analytic examples and an example with a hyperbolic PDE describing elastic wave propagation in heterogeneous media are used to illustrate the main features of the methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Jordan–Wigner Transformation for the Description of Strong Correlation in Fermionic Systems

Seniority is a useful way of organizing Hilbert space for strongly correlated systems. The exact zero-seniority wave function, doubly occupied configuration interaction (DOCI), provides accurate results (given the right orbitals) for many strongly correlated electronic systems but has a combinatorial computational cost. In many cases, pair coupled cluster doubles provide a polynomial-cost approximation that closely reproduces the energies of DOCI, but it breaks down in some cases and, as shown herein, it does not provide particularly good density matrices. In this article, we demonstrate that by using the Jordan–Wigner transformation to turn the seniority zero problem back into a Fermionic one, we can provide mean-field variational results of DOCI quality for the Hubbard model and a few small molecular dissociation examples, with polynomial cost, both for the energies and for density matrices, all while being protected from collapse. This success is rooted in the proof we provide, showing that the Hartree–Fock wave function on the Jordan–Wigner-transformed Hamiltonian transforms back to variational coupled cluster doubles in the seniority zero representation, but restricted to have determinant rather than permanent amplitude coefficients, without compromising its overall accuracy.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Fully consistent Eulerian Monte Carlo fields method for solving probability density function transport equations in turbulence modeling

The probability density function (PDF) transport equation method is a sophisticated model for the closure of turbulent mixing and turbulent reactive flows. An efficient solution approach for solving the PDF transport equation has been vital for the method to be widely used in applications. The Eulerian Monte Carlo fields (EMCF) method has been developed to solve the PDF transport equation efficiently for decades. A recent work by Wang et al. revealed a serious issue of the EMCF method for not being fully consistent with the PDF transport equation for which the method is designed to solve. This work advances the state of the art by introducing fully consistent EMCF methods for solving the PDF transport equation. The fully consistent EMCF formulations are derived for two different PDF equation forms. The consistency of the EMCF formulations is mathematically confirmed by examining the derived moment transport equations from the EMCF formulations and from the PDF transport equation. The method of manufactured solutions is employed to further verify the consistency and convergence of the different EMCF formulations numerically. The newly introduced EMCF formulations bring the EMCF method to full consistency with the PDF transport equations for the first time.

42 ENGINEERING↗
DOE OSTI2020

Spin response and neutrino mean free path in neutron matter

The longitudinal and transverse density- and spin-density response functions in pure neutron matter (PNM) are derived over a wide range of densities within the time dependent local spin density approximation. The underlying density functional was derived from an Auxiliary Field Diffusion Monte Carlo computation of the equation of state of unpolarized and fully spin polarized PNM. In order to assess the dependence of the results on the specific underlying nucleon–nucleon Hamiltonian, we used both the phenomenological Argonne AV8' + UIX force, and local chiral forces up to next-to-next-to-leading-order (N 2 LO). Finally, the resulting response function has then been applied to the study of the neutrino mean free path in PNM.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Perturbatively including inhomogeneities in axion inflation

Axion inflation, i.e. an axion-like inflaton coupled to an Abelian gauge field through a Chern-Simons interaction, comes with a rich and testable phenomenology. This is particularly true in the strong backreaction regime, where the gauge field production heavily impacts the axion dynamics. Lattice simulations have recently demonstrated the importance of accounting for inhomogeneities of the axion field in this regime. We propose a perturbative scheme to account for these inhomogeneities while maintaining high computational efficiency. Our goal is to accurately capture deviations from the homogeneous axion field approximation within the perturbative regime as well as self-consistently determine the onset of the nonperturbative regime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Strong-field nonsequential double photoionization using virtual-detector theory with path summation

We present an ab initio study of the nonsequential strong-field ionization dynamics of a model two-electron atom with helium character. Single- and double-ionization events are characterized and displayed using detector signals extracted at different points in the two-electron two-dimensional space. The double photoelectron momentum distribution is calculated via coherent path-summation over virtual-particle trajectories. A comparison is made between the momentum distributions obtained with the virtual-detector method, the Schrödinger wave function, and the time-dependent surface flux method developed by Tao and Scrinzi [New J. Phys. 14, 013021 (2012)]. Insights into different ionization and electron recollision pathways are gained from detailed virtual-particle tracking and energy-time readouts. Furthermore, this study demonstrates the extension of virtual-detector theory to strong-field multielectron quantum dynamics and highlights the importance of the evolving quantum phase in quasiclassical electron propagation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Primitive quantum gates for dihedral gauge theories

We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete gauge group $D_N$-- the dihedral group -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice gauge theory. In order to carry out such a lattice simulation, we detail the construction of efficient quantum circuits to realize basic primitives including the nonabelian Fourier transform over $D_N$, the trace operation, and the group multiplication and inversion operations. For each case the required quantum resources scale linearly or as low-degree polynomials in $n=\log N$. We experimentally benchmark our gates on the Rigetti Aspen-9 quantum processor for the case of $D_4$. The fidelity of all $D_4$ gates was found to exceed $80\%$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Symbolic pregression: Discovering physical laws from distorted video

In this work, we present a method for unsupervised learning of equations of motion for objects in raw and optionally distorted unlabeled synthetic video (or, more generally, for discovering and modeling predictable features in time-series data). We first train an autoencoder that maps each video frame into a low-dimensional latent space where the laws of motion are as simple as possible, by minimizing a combination of nonlinearity, acceleration, and prediction error. Differential equations describing the motion are then discovered using Pareto-optimal symbolic regression. We find that our pre-regression (“pregression”) step is able to rediscover Cartesian coordinates of unlabeled moving objects even when the video is distorted by a generalized lens. Using intuition from multidimensional knot theory, we find that the pregression step is facilitated by first adding extra latent space dimensions to avoid topological problems during training and then removing these extra dimensions via principal component analysis. An inertial frame is autodiscovered by minimizing the combined equation complexity for multiple experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗