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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
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 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↗
DOE OSTI2023

Beyond Fisher forecasting for cosmology

The planning and design of future experiments rely heavily on forecasting to assess the potential scientific value provided by a hypothetical set of measurements. The Fisher information matrix, due to its convenient properties and low computational cost, provides an especially useful forecasting tool. However, the Fisher matrix only provides a reasonable approximation to the true likelihood when data are nearly Gaussian distributed and observables have nearly linear dependence on the parameters of interest. Also, Fisher forecasting techniques alone cannot be used to assess their own validity. Thorough sampling of the exact or mock likelihood can definitively determine whether a Fisher forecast is valid, though such sampling is often prohibitively expensive. Here we propose a simple test, based on the Derivative Approximation for likelihoods (DALI) technique, to determine whether the Fisher matrix provides a good approximation to the exact likelihood. We show that the Fisher matrix becomes a poor approximation to the true likelihood in regions where two-dimensional slices of level surfaces of the DALI approximation to the likelihood differ from two-dimensional slices of level surfaces of the Fisher approximation to the likelihood. We demonstrate that our method accurately predicts situations in which the Fisher approximation deviates from the true likelihood for various cosmological models and several data combinations, with only a modest increase in computational cost compared to standard Fisher forecasts.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Reassessing the Market—Computation Interface to Enhance Grid Security and Efficiency

The goal of this project is to reconsider core market and reliability processes that can potentially yield to transformative advances in power grid security, reliability, and efficiency. Current electric power market designs are strongly a function of computing capabilities and limitations that were available in the mid-to-late 1990s, circa deregulation. This includes constructs such as: (1) a 2-tiered day-ahead/real-time market construct; and (2) linearized (“DC”) real power flow approximations in dispatch and pricing. At that time, state-of-the-art computational capabilities could at the limit address deterministic mixed-integer programming formulations of unit commitment (UC) and linear programming formulations of economic dispatch (ED) at limited fidelity and scale. Such constraints forced limited look-ahead time-horizons, crude approximations of AC power flow physics and operations, and artificial partitioning between day-ahead markets, hour(s)-ahead reliability processes, and real-time markets. Consequently, these limitations have resulted in limited security and reliability with increasing out-of-market payments, particularly as uncertainty associated with renewables and distributed energy resources grows.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Computational schemes for the Magnus expansion of the in-medium similarity renormalization group

The in-medium similarity renormalization group (IMSRG) is a popular many-body method used for computations of nuclei. It solves the many-body Schrödinger equation through a continuous unitary transformation of the many-body Hamiltonian. The IMSRG transformation is typically truncated at the normal-ordered two-body level, the IMSRG(2), but recently several approaches have been developed to capture the effects of normal-ordered three-body operators, the IMSRG(3). In particular, a factorized approximation to the IMSRG(3) proposes to capture the leading effects of three-body operators at the same computational cost as the IMSRG(2) approximation. This approach often employs an approximate scheme for solving the IMSRG equations, the so-called hunter-gatherer scheme. In this work, I study the uncertainty associated with this scheme. I find that the hunter-gatherer scheme differs by up to 7MeV for ground-state energies and 0.5MeV for excitation energies from standard IMSRG(2) approaches. These differences are in some cases comparable to the expected size of IMSRG(3) corrections.

39 ≤ A ≤ 58↗
DOE OSTI2024

Validation of a Tapered Impact Damper for Traffic Signal Structure Vibrations Using the Method of Harmonic Balance

Significant vibration amplitudes and cycles can be produced when traffic signal structures with low inherent damping are excited near one of their natural frequencies. For the mitigation of wind-induced vibrations, dynamic vibration absorbers coupled to the structure are often used. Here, this research investigates the performance of a tapered impact damper, consisting of a hanging spring-mass oscillator inside a housing capable of reducing vibration amplitude over a broader frequency range than the conventional tuned mass damper. A nonlinear, two degree-of-freedom model is developed with coordinates representing the traffic structure and the tapered impact damper. This research focuses on the application of the harmonic balance method to approximate the periodic solutions of the nonlinear equations to compute the nonlinear dynamics of the damped traffic signal structure. After designing and manufacturing a tapered impact damper, the traffic signal structure is tested with and without the damper using free vibration snapback tests. The experimental frequency and damping backbone curves are used to validate the analytical model, and the effectiveness of the damper is discussed.

42 ENGINEERING↗
DOE OSTI2022

A BOUT++ extension for full annular tokamak edge MHD and turbulence simulations

For tokamak edge plasma simulation, a plasma simulation framework BOUT++ employs a dual coordinate system to simulate moderate-n and high-n plasma instability with reasonable computational cost, where n is the toroidal mode number. This coordinate system however limits the computational domain to the toroidal wedge (full torus divided into N parts in the toroidal direction) for computational efficiency and the use of flute-ordering approximation in the field solver calculating the flow potential from the vorticity which may not be valid for low-n modes. Improving numerical treatment of low-n modes is however indispensable to address simulations of low-n current-driven edge localized mode (ELM), ELM control by resonant magnetic perturbations (RMPs), edge turbulence with RMPs and so on. In this work, BOUT++ is extended to simulate the interplay between $n=0$, low-n and high-n plasma components in a full annular tokamak edge domain through hybrid modeling of the flow potential and the vorticity. Low-n modes of flow potential are calculated in an orthogonal flux surface coordinate and high-n modes in the dual coordinate system separately in Fourier space. Finally, the proposed scheme can capture an interplay between $n=1$ global modes and high-n turbulence during pedestal collapse in a full annular torus domain with a circular cross section.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Enhancing approximate modular Bayesian inference by emulating the conditional posterior

In modular Bayesian analyses, complex models are composed of distinct modules, each representing different aspects of the data or prior information. In this context, fully Bayesian approaches can sometimes lead to undesirable feedback between modules, compromising the integrity of the inference. The “cut-distribution” prevents unwanted influence between modules by “cutting” feedback. The direct sampling (DS) algorithm is standard practice for approximating the cut-distribution, but it can be computationally intensive, especially when the number of imputations required is large. An enhanced method is proposed, the Emulating the Conditional Posterior (ECP) algorithm, which leverages emulation to increase the number of imputations. Through numerical experiment it is demonstrated that the ECP algorithm outperforms the traditional DS approach in terms of accuracy and computational efficiency, particularly when resources are constrained. Here, it is also shown how the DS algorithm can be improved using ideas from design of experiments. Some practical recommendations are given for algorithm choice in modular Bayesian analyses.

97 MATHEMATICS AND COMPUTING↗