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 1,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Calibration of elastoplastic constitutive model parameters from full-field data with automatic differentiation-based sensitivities

Here, we present a framework for calibration of parameters in elastoplastic constitutive models that is based on the use of automatic differentiation (AD). The model calibration problem is posed as a partial differential equation-constrained optimization problem where a finite element (FE) model of the coupled equilibrium equation and constitutive model evolution equations serves as the constraint. The objective function quantifies the mismatch between the displacement predicted by the FE model and full-field digital image correlation data, and the optimization problem is solved using gradient-based optimization algorithms. Forward and adjoint sensitivities are used to compute the gradient at considerably less cost than its calculation from finite difference approximations. Through the use of AD, we need only to write the constraints in terms of AD objects, where all of the derivatives required for the forward and inverse problems are obtained by appropriately seeding and evaluating these quantities. We present three numerical examples that verify the correctness of the gradient, demonstrate the AD approach's parallel computation capabilities via application to a large-scale FE model, and highlight the formulation's ease of extensibility to other classes of constitutive models.

42 ENGINEERING↗
DOE OSTI2021

Toward quantum Monte Carlo forces on heavier ions: Scaling properties

Quantum Monte Carlo (QMC) forces have been studied extensively in recent decades because of their importance with spectroscopic observables and geometry optimization. Here, we benchmark the accuracy and computational cost of QMC forces. The zero-variance zero-bias (ZVZB) force estimator is used in standard variational and diffusion Monte Carlo simulations with mean-field based trial wavefunctions and atomic pseudopotentials. Statistical force uncertainties are obtained with a recently developed regression technique for heavy tailed QMC data [P. Lopez Rios and G. J. Conduit, Phys. Rev. E 99, 063312 (2019)]. By considering selected atoms and dimers with elements ranging from H to Zn (1 ≤ Z eff ≤ 20), we assess the accuracy and the computational cost of ZVZB forces as the effective pseudopotential valence charge, Z eff , increases. We find that the costs of QMC energies and forces approximately follow simple power laws in Zeff. The force uncertainty grows more rapidly, leading to a best case cost scaling relationship of approximately Z e ff 6.5 ( 3 ) for diffusion Monte Carlo. We find that the accessible system size at fixed computational cost scales as Z e ff − 2 , insensitive to model assumptions or the use of the “space warp” variance-reduction technique. Our results predict the practical cost of obtaining forces for a range of materials, such as transition metal oxides where QMC forces have yet to be applied, and underscore the importance of further developing force variance-reduction techniques, particularly for atoms with high Z eff .

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

Modeling State Transition and Head-Dependent Efficiency Curve for Pumped Storage Hydro in Look-Ahead Dispatch

As one of the most widely installed utility-scale storage facilities, pumped storage hydro (PSH) plays an essential role in providing flexibility for power systems worldwide. Thus, to accurately quantify the flexibility of PSH units in operational optimization problems is important. The conventional PSH models in the literature rarely consider detailed state transitions due to their hourly-based settings. However, it becomes imperative for operational optimization on short-term intervals, especially with increasing shares of renewable energy in power systems. To this end, this paper presents a novel deterministic PSH model that considers the transition time and trajectory between three states of PSH units in look-ahead dispatch. Moreover, to better characterize the varying efficiency of PSH units with water head and flow rate, this paper proposes to model detailed headdependent efficiency curves (hereafter called input-output curves) in look-ahead dispatch, which encounters heavy computational burdens when short time intervals are applied. In this work, a zig-zag piece-wise linear approximation method is used for input-output curve modeling. This can enable an accurate quantification for variable efficiency and head dependence in a computationally effective manner. Here, numerical results are presented to show performances of the proposed PSH model in both flexibility quantification and computation time.

13 HYDRO ENERGY↗
DOE OSTI2020

A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Characterizing magnetized plasmas with dynamic mode decomposition

Accurate and efficient plasma models are essential to understand and control experimental devices. Existing magnetohydrodynamic or kinetic models are nonlinear and computationally intensive and can be difficult to interpret, while often only approximating the true dynamics. In this work, data-driven techniques recently developed in the field of fluid dynamics are leveraged to develop interpretable reduced-order models of plasmas that strike a balance between accuracy and efficiency. In particular, dynamic mode decomposition (DMD) is used to extract spatio-temporal magnetic coherent structures from the experimental and simulation datasets of the helicity injected torus with steady inductive (HIT-SI) experiment. Three-dimensional magnetic surface probes from the HIT-SI experiment are analyzed, along with companion simulations with synthetic internal magnetic probes. A number of leading variants of the DMD algorithm are compared, including the sparsity-promoting and optimized DMD. Optimized DMD results in the highest overall prediction accuracy, while sparsity-promoting DMD yields physically interpretable models that avoid overfitting. These DMD algorithms uncover several coherent magnetic modes that provide new physical insights into the inner plasma structure. These modes were subsequently used to discover a previously unobserved three-dimensional structure in the simulation, rotating at the second injector harmonic. Finally, using data from probes at experimentally accessible locations, DMD identifies a resistive kink mode, a ubiquitous instability seen in magnetized plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2019

Semi-inclusive deep-inelastic scattering in Wandzura-Wilczek-type approximation

We present the complete cross-section for the production of unpolarized hadrons in semi-inclusive deep-inelastic scattering up to power-suppressed ${\cal O}(1/Q^2)$ terms in the Wandzura--Wilczek-type approximation which consists in systematically assuming that $\bar{q}gq$--terms are much smaller than $\bar{q}q$--correlators. We compute all twist-2 and twist-3 structure functions and the corresponding asymmetries, and discuss the applicability of the Wandzura--Wilczek-type approximations on the basis of available data. We make predictions which can be tested by data from Jefferson Lab, COMPASS, HERMES, and the future Electron-Ion Collider. The results of this paper can be readily used for phenomenology and for event generators, and will help to improve our understanding of the TMD theory beyond leading twist.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Enhancing ACPF Analysis: Integrating Newton-Raphson Method with Gradient Descent and Computational Graphs

This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Status of Multiple Channel Fuel Performance Capabilities Within the SAS4A/SASSYS-1 Safety Analysis Software

SAS4A/SASSYS-1 (SAS) is a fast-running simulation tool used to perform deterministic analysis of anticipated events as well as design basis and beyond design basis accidents for advanced liquid-metal-cooled nuclear reactors. It is a critical element of safety analysis capabilities for the U.S. Department of Energy and is utilized within industry to perform the transient safety analyses required to support the licensing of Liquid Metal-cooled Fast Reactors (LMFRs). Although SAS is exceptionally fast for most transient scenarios, fuel performance calculations, along with the associated pre-transient characterization of the fuel pin, may be required for transient scenarios where fuel pin failure is hypothesized. Both the pre-transient characterization and the transient fuel performance calculation are necessary to properly quantify margins to potential fuel failure and assess the time spent potentially exceeding such margins during events. While safety analysis calculations with fuel performance models provide a more detailed characterization of the reactor during a transient, the pre-transient characterization can be time-consuming and computationally expensive. Often, large numbers of fuel pins have been exposed to similar pre-transient irradiation conditions. Similarly, the same pre-transient fuel characterization may be applicable to numerous transient conditions. This provides an opportunity to optimize the SAS computational framework such that pre-transient fuel characterization can be shared across multiple channels (fuel pins) and across multiple simulations, thus dramatically reducing overall computational costs. This report summarizes progress toward enhancing the SAS computational framework to support shared, multiple channel fuel performance characterizations intended to significantly reduce computational costs. Preliminary testing has shown that the computational time saved by using the pre-transient sharing capability is approximately equal to the time it takes to perform the pre-transient characterization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

Abstract Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it is proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, the experimental implementation of this proposal in the Rigetti cloud quantum computer is carried out employing up to three qubits. The experimental fidelities are in good agreement with the theoretical prediction, thus proving the feasibility to realize quantum autoencoders via quantum adders in state‐of‐the‐art superconducting quantum technologies.

Ding, Yongcheng↗
DOE OSTI2019

Computational Investigation of Aqueous Phase Effects on the Dehydrogenation and Dehydroxylation of Polyols over Pt(111)

Prediction of solvation effects on the kinetics of elementary reactions occurring at metal–water interfaces is of high importance for the rational design of catalysts for the biomass and electrocatalysis communities. A lack of knowledge of the reliability of various computational solvation schemes for processes on metal surfaces is currently a limiting factor. Using a multilevel quantum mechanical/molecular mechanical (QM/MM) description of the potential energy surface, we determined characteristic time and length scales for typical free-energy perturbation (FEP) calculations of bond cleavages in ethylene glycol, a sugar surrogate molecule, over Pt(111). Our approach is based on our explicit solvation model for metal surfaces and the repetition of FEP calculations to estimate confidence intervals. Results indicate that aqueous phase effects on the free energies of elementary processes can be determined with 95% confidence intervals from limited configuration space sampling and the fixed charge approximation used in the QM/MM-FEP methodology of smaller 0.1 eV. Next, we computed the initial O–H, C–H, and C–OH bond cleavages in ethylene glycol over Pt(111) in liquid water utilizing two different metal–water interaction potentials. Our calculations predict that aqueous phase effects are small (<0.1 eV) for the C–H bond cleavage and the activation barrier of the C–OH bond cleavage. In contrast, solvation effects are large (>0.35 eV) for the O–H bond cleavage and the reaction free energy of the C–OH bond scission. While the choice of a different Pt–water force field can lead to differences in predicted solvation effects of up to 0.2 eV, the differences are usually smaller (<0.1 eV), and the trends are always the same. In contrast, implicit solvation methods appear to currently not be able to reliably describe solvation effects originating from hydrogen bonding for metal surfaces even qualitatively.

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

An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team

Here we present an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots. The robots have to travel to a given set of targets and collaboratively work on the tasks at the targets with the human operators. The problem aims to find a sequence of targets for each robot to visit and schedule the tasks at the targets with the human operators such that each target is visited exactly once by some robot, the scheduling constraints are satisfied and the maximum mission time of any robot is minimum. This problem is a generalization of the single Traveling Salesman Problem and is NP-Hard. Given k robots and m human operators, an algorithm is developed for solving the TASSP with an approximation ratio equal to 5/2- 1/k when m ≥ k and equal to 7/2 -1/k otherwise. Computational results are also presented to corroborate the performance of the proposed algorithm.

42 ENGINEERING↗
DOE OSTI2017

Magnetic Helicities and Dynamo Action in Magneto-rotational Turbulence

We examine the relationship between magnetic flux generation, taken as an indicator of large-scale dynamo action, and magnetic helicity, computed as an integral over the dynamo volume, in a simple dynamo. We consider dynamo action driven by magneto-rotational turbulence (MRT) within the shearing-box approximation. We consider magnetically open boundary conditions that allow a flux of helicity in or out of the computational domain. We circumvent the problem of the lack of gauge invariance in open domains by choosing a particular gauge—the winding gauge—that provides a natural interpretation in terms of the average winding number of pairwise field lines. We use this gauge precisely to define and measure the helicity and the helicity flux for several realizations of dynamo action. We find in these cases that the system as a whole does not break reflectional symmetry and that the total helicity remains small even in cases when substantial magnetic flux is generated. We find no particular connection between the generation of magnetic flux and the helicity or the helicity flux through the boundaries. We suggest that this result may be due to the essentially nonlinear nature of the dynamo processes in MRT.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Uncertainty-aware molecular dynamics from Bayesian active learning for phase transformations and thermal transport in SiC

Abstract Machine learning interatomic force fields are promising for combining high computational efficiency and accuracy in modeling quantum interactions and simulating atomistic dynamics. Active learning methods have been recently developed to train force fields efficiently and automatically. Among them, Bayesian active learning utilizes principled uncertainty quantification to make data acquisition decisions. In this work, we present a general Bayesian active learning workflow, where the force field is constructed from a sparse Gaussian process regression model based on atomic cluster expansion descriptors. To circumvent the high computational cost of the sparse Gaussian process uncertainty calculation, we formulate a high-performance approximate mapping of the uncertainty and demonstrate a speedup of several orders of magnitude. We demonstrate the autonomous active learning workflow by training a Bayesian force field model for silicon carbide (SiC) polymorphs in only a few days of computer time and show that pressure-induced phase transformations are accurately captured. The resulting model exhibits close agreement with both ab initio calculations and experimental measurements, and outperforms existing empirical models on vibrational and thermal properties. The active learning workflow readily generalizes to a wide range of material systems and accelerates their computational understanding.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Efficient surrogate modeling methods for large-scale Earth system models based on machine-learning techniques

Abstract. Improving predictive understanding of Earth system variability and change requires data–model integration. Efficient data–model integration for complex models requires surrogate modeling to reduce model evaluation time. However, building a surrogate of a large-scale Earth system model (ESM) with many output variables is computationally intensive because it involves a large number of expensive ESM simulations. In this effort, we propose an efficient surrogate method capable of using a few ESM runs to build an accurate and fast-to-evaluate surrogate system of model outputs over large spatial and temporal domains. We first use singular value decomposition to reduce the output dimensions and then use Bayesian optimization techniques to generate an accurate neural network surrogate model based on limited ESM simulation samples. Our machine-learning-based surrogate methods can build and evaluate a large surrogate system of many variables quickly. Thus, whenever the quantities of interest change, such as a different objective function, a new site, and a longer simulation time, we can simply extract the information of interest from the surrogate system without rebuilding new surrogates, which significantly reduces computational efforts. We apply the proposed method to a regional ecosystem model to approximate the relationship between eight model parameters and 42 660 carbon flux outputs. Results indicate that using only 20 model simulations, we can build an accurate surrogate system of the 42 660 variables, wherein the consistency between the surrogate prediction and actual model simulation is 0.93 and the mean squared error is 0.02. This highly accurate and fast-to-evaluate surrogate system will greatly enhance the computational efficiency of data–model integration to improve predictions and advance our understanding of the Earth system.

58 GEOSCIENCES↗