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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Fast Reactor Methods Development Plan

Fast reactor design and safety analysis methods (computer codes) have been under development for approximately sixty years. During the first forty years, code development was driven by the immediate needs of operational facilities such as Experimental Breeder Reactors I and II and the Fast Flux Test Facility. Development was further driven by programmatic needs to support advanced reactor programs such as the Clinch River Breeder Reactor Project and the Advanced Liquid Metal Reactor Program. By the early 1990s, design and safety analysis codes had been well established to addressed the unique characteristics of fast reactors. During the subsequent twenty years, however, development was nearly stagnant as a result of U.S. Government policy changes that abruptly canceled nearly all of the fast reactor research in the United States. As a result, the state of fast reactor design and safety analysis methods has deteriorated.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Mechanical properties of zeolite-templated carbons from approximate density functional theory calculations

Zeolite-templated carbon (ZTC) is a unique porous carbonaceous material whose structure is ordered at the nanometre scale, enabling a representative periodic description at the atomistic level. Utilizing an existing, well-defined reference model for ZTCs, a structural library of varying compositions was developed by refinement using density-functional tight-binding (DFTB) potentials parameterized for materials science applications. We first determined the quantum chemical-refined structures of models with CH, CHO, CHON, CHOB, and CHOBN compositions with various degrees of heteroatom substitution. These structural models comprise the characteristic morphological features of highly porous carbon materials, such as open-blade surfaces, edges, saddles, and closed-strut formations, spanning a range of curvatures and characteristic sizes. Second, we carried out alternating compression and expansion of the CHO model unit cell to determine the lowest energy structure as well as to obtain its bulk modulus in order to demonstrate a close connection between macroscopic observations and atomic-scale structures. Further, the agreement between experimental measurements and the computational model is remarkable and demonstrates the power of approximate density functional theory as a cost-effective computational tool with chemical accuracy for the investigation of structure/property relationships in real-world carbon-based solids.

03 NATURAL GAS↗
DOE OSTI2020

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Fast increased fidelity samplers for approximate Bayesian Gaussian process regression

Gaussian processes (GPs) are common components in Bayesian non-parametric models having a rich methodological literature and strong theoretical grounding. The use of exact GPs in Bayesian models is limited to problems containing several thousand observations due to their prohibitive computational demands. We develop a posterior sampling algorithm using H-matrix approximations that scales at O(n log 2 n). We show that this approximation’s Kullback-Leibler divergence to the true posterior can be made arbitrarily small. Though multidimensional GPs could be used with our algorithm, d-dimensional surfaces are modeled as tensor products of univariate GPs to minimize the cost of matrix construction and maximize computational efficiency. We illustrate the performance of this fast increased fidelity approximate GP, FIFA-GP, using both simulated and non-synthetic data sets

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Simulating a pulsed-power-driven plasma with ideal MHD

We describe a simple practical numerical method for simulating plasma driven within a vacuum chamber by a pulsed power generator. Typically, in this type of simulation, the vacuum region adjacent to the plasma is approximated as a highly resistive, light fluid; this involves computationally expensive solvers describing the diffusion of the magnetic field through this fluid. Instead, we provide a recipe for coupling pulsed power generators to the magnetohydrodynamics (MHD) domain by approximating the perfectly insulating vacuum as a light, perfectly conducting, inviscid MHD fluid and discuss the applicability of this counter-intuitive technique. This much more affordable ideal MHD representation is particularly useful in situations where a plasma exhibits interesting three-dimensional phenomena, either due to the design of the experiment or due to developing instabilities. We verified that this coupling recipe works by modeling an exactly solvable flux compression generator as well as a self-similar Noh-like solution and demonstrated convergence to the theoretical solution. We also showed examples of simulating complex three-dimensional pulsed power devices with this technique. We release our code implementation to the public.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to facilitate solutions to practical problems. In contrast, we believe that future users of quantum computers are interested in actual applications and that noisy quantum devices may still provide value by approximately solving hard combinatorial problems via hybrid classical-quantum algorithms. To lower bound the size of quantum computers with practical utility, we perform realistic simulations of the Quantum Approximate Optimization Algorithm and conclude that quantum speedup will not be attainable, at least for a representative combinatorial problem, until several hundreds of qubits are available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

HFBTHO-AD: Differentiation of a nuclear energy density functional code

The HFBTHO code implements a nuclear energy density functional solver to model the structure of atomic nuclei. HFBTHO has previously been used to calibrate energy functionals and perform sensitivity analysis by using derivative-free methods. To enable derivative-based optimization and uncertainty quantification approaches, we must compute the derivatives of HFBTHO outputs with respect to the parameters of the energy functional, which are a subset of all input parameters of the code. Here, we use the algorithmic/automatic differentiation (AD) tool Tapenade to differentiate HFBTHO. We compare the derivatives obtained using AD against finite-difference approximation and examine the performance of the derivative computation.

Algorithmic differentiation↗
DOE OSTI2021

Cholesky-based experimental design for Gaussian process and kernel-based emulation and calibration.

Gaussian processes and other kernel-based methods are used extensively to construct approximations of multivariate data sets. The accuracy of these approximations is dependent on the data used. This paper presents a computationally efficient algorithm to greedily select training samples that minimize the weighted L p error of kernel-based approximations for a given number of data. The method successively generates nested samples, with the goal of minimizing the error in high probability regions of densities specified by users. The algorithm presented is extremely simple and can be implemented using existing pivoted Cholesky factorization methods. Training samples are generated in batches which allows training data to be evaluated (labeled) in parallel. For smooth kernels, the algorithm performs comparably with the greedy integrated variance design but has significantly lower complexity. Numerical experiments demonstrate the efficacy of the approach for bounded, unbounded, multi-modal and non-tensor product densities. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data using Bayesian inference.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine learning and TDDFT software for stopping power computation

(SF-24-012) Stopping power describes the rate that a material slows radiation particles passing through it and is useful in designing many technologies. Few organizations can perform new measurements, which require significant resources and rare equipment, and all others rely on coarse approximations rendered from pre-existing data. Methods for computing stopping power in new materials, such as time-dependent density functional theory (TD-DFT), have only recently (circa-2015) become available but are too computationally costly to use frequently enough to have a pronounced impact. We have created a method that opens a pathway to computing stopping power without any need for experimental data by combining electronic structure computations and machine learning.

Ward, Logan↗
DOE OSTI2020

Protein Molecular Dynamics Simulations with Approximate QM: What Can We Learn?

Classical force fields are essential for computer simulations of proteins and are typically parameterized to reproduce secondary and tertiary structure of isolated proteins. However, while protein-protein interactions are ubiquitous in nature, they are not considered in parameterization efforts and are far less understood than isolated proteins. A better characterization of intermolecular interactions is widely recognized as a key to revolutionizing drug and therapeutic developments with high-throughput computational screening. Urgently needed is a critical assessment of the performance of modern protein force fields against first-principles electronic structure methods and experiments. In a daring step toward this goal, we here describe a comparison of peptide folding dynamics as predicted by a molecular mechanics force field on the one hand and by an approximate electronic structure quantum mechanical (QM) method based on density-functional tight-binding (DFTB) on the other. We further compare the dynamics from straightforward DFTB simulations with a near-linear scaling version of DFTB for massively parallel computation based on the fragment molecular orbital (FMO-DFTB) method. We illustrate differences between the phenomenology of the folding dynamics from these three methods for a small model peptide, as well as charge polarization and dynamic fluctuations, point out possible correlations and implications for force field developers, and discuss the lessons learned that might become applicable to future predictive high-throughput computer screening for personalized neoantigen cancer therapy.

Irle, Stephan↗
DOE OSTI2019

Simulating X-ray Absorption Spectra with Linear-Response Density Cumulant Theory

We present a new approach for simulating X-ray absorption spectra based on linear-response density cumulant theory (LR-DCT) [Copan, A. V.; Sokolov, A. Yu. J. Chem. Theory Comput. 2018, 14, 4097–4108]. Our new method combines the LR-ODC-12 formulation of LR-DCT with core- valence separation approximation (CVS) that allows us to efficiently access high-energy core-excited states. We describe our computer implementation of the CVS-approximated LRODC-12 method (CVS-ODC-12) and benchmark its performance by comparing simulated X-ray absorption spectra to those obtained from experiment for several small molecules. Our results demonstrate that the CVS-ODC-12 method shows good agreement with experiment for relative spacings between transitions and their intensities, but the excitation energies are systematically overestimated. When compared to results from excited-state coupled cluster methods with single and double excitations, the CVS-ODC-12 method shows a similar performance for intensities and peak separations, while coupled cluster spectra are less shifted, relative to experiment. An important advantage of CVS-ODC-12 is that its excitation energies are computed by diagonalizing a Hermitian matrix, which enables efficient computation of transition intensities.

Peng, Ruojing↗
DOE OSTI2025

The no boundary density matrix

We discuss a no-boundary proposal for a subregion of the universe. In the classical approximation, this density matrix involves finding a specific classical solution of the equations of motion with no boundary. Beyond the usual no boundary condition at early times, we also have another no boundary condition in the region we trace out. We can find the prescription by starting from the usual Hartle-Hawking proposal for the wavefunction on a full slice and tracing out the unobserved region in the classical approximation. We discuss some specific subregions and compute the corresponding solutions. These geometries lead to phenomenologically unacceptable probabilities, as expected.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Comments on the double cone wormhole

In this paper we revisit the double cone wormhole introduced by Saad, Shenker and Stanford (SSS), which was shown to reproduce the ramp in the spectral form factor. As a first approximation we can say that this solution computes Tr[e –iKT ], a trace of the “evolution” operator that generates Schwarzschild time translations on the two sided wormhole geometry. This point of view leads to a simple way to compute the normalization factor of the wormhole. When we have bulk matter fields, SSS suggested using a modified evolution K ~ which involves a slightly complex geometry, so that we are really computing Tr[e –iK ~ T ]. We argue that, for general black holes, the spectrum of K ~ is given by quasinormal mode frequencies. We explain that this reproduces various features that were previously predicted from the spectral form factor on hydrodynamics grounds. We also give a general algebraic construction of the modified boost in terms of operators constructed from half sided modular inclusions. For the special case of JT gravity, we work out the backreaction of matter on the geometry of the double cone and find that it deforms the geometry in an undesirable direction. We finally give some comments on the possible physical interpretation of K ~ .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Equivalence principle in Reissner–Nordström geometry

The Equivalence Principle is a key element in the development of General Relativity. In one of its formulations, the Equivalence Principle states that a reference frame at rest in a uniform gravitational field is equivalent to a reference frame in uniformly accelerated motion in the absence of any gravitation field. We analyze the spacetime surrounding a non-rotating spherically symmetric charged body, known as Reissner–Nordström geometry, and exhibit a coordinate transformation, which makes explicit its compatibility with the Equivalence Principle. We revisit the Schwarzschild case, previously analyzed in the literature. We also consider second order terms of the relevant expansion parameters in the approximate metric, which is needed for the computed curvature quantities to be correct at zeroth order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Optimal carbon storage reservoir management through deep reinforcement learning

Model-based optimization plays a central role in energy system design and management. The complexity and high-dimensionality of many process-level models, especially those used for geosystem energy exploration and utilization, often lead to formidable computational costs when the dimension of decision space is also large. This work adopts elements of recently advanced deep learning techniques to solve a sequential decision-making problem in applied geosystem management. Specifically, a deep reinforcement learning framework was formed for optimal multiperiod planning, in which a deep Q-learning network (DQN) agent was trained to maximize rewards by learning from high-dimensional inputs and from exploitation of its past experiences. To expedite computation, deep multitask learning was used to approximate high-dimensional, multistate transition functions. Both DQN and deep multitask learning are pattern based. As a demonstration, the framework was applied to optimal carbon sequestration reservoir planning using two different types of management strategies: monitoring only and brine extraction. Both strategies are designed to mitigate potential risks due to pressure buildup. Results show that the DQN agent can identify the optimal policies to maximize the reward for given risk and cost constraints. Finally, experiments also show that knowledge the agent gained from interacting with one environment is largely preserved when deploying the same agent in other similar environments.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

A two-equation soot-in-flamelet modeling approach applied under Spray A conditions

Soot production (including formation and oxidation) is studied in the transient, high-pressure and turbulent n-dodecane Spray A flames from the Engine Combustion Network (ECN) using computational fluid dynamics (CFD) simulations. A two-equation soot-in-flamelet modeling approach is applied within the framework of the Unsteady Flamelet Progress Variable (UFPV) model and results are validated against experimental data. Equations for soot mass fraction and soot number density derived in the mixture fraction space are solved in the context of detailed flamelet calculations. Source terms for the different steps in the soot chemistry are tabulated and incorporated in the flamelet manifold. For the reference condition, the modeling approach based on the tabulated flamelet manifold reduces the computational cost of a CFD calculation by approximately 40 times compared to a non-tabulated well-mixed (WM) modeling approach. The soot-in-flamelet approach is then extended to study the effect of ambient oxygen concentration, ambient mixture composition and ambient temperature on soot production. Results show that the modeling approach is able to capture the experimental trends for the soot volume fraction (SVF) with good quantitative agreement, especially in the soot ramp-up region.

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

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗
DOE OSTI2022

A second-order distributed memory parallel fast sweeping method for the Eikonal equation

The Eikonal equation is used to calculate wave propagation and distance fields, and due to its complexity requires numerical treatment for its solution. In this work, we present a second-order distributed memory parallel fast sweeping method. The second-order solution switches on a two-point stencil when two upwind points are available, and reverts to first-order otherwise. In all examples, the second-order method improves the solution over the first-order, allowing for significant savings in memory while achieving the same accuracy. Parallelization over distributed memory saw good weak scaling with optimal convergence. The computational time for second-order was approximately 2.5 times slower than first-order, where the largest amount of mesh points ran on 144 cores (512 GB) was ≈20 billion. The savings in memory from the second-order method combined with the distributed memory algorithm result in the ability to solve problems much larger than are possible with the serial first-order method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗