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

High-Fidelity and High-Performance Computational Simulations for Rapid Design Optimization of Sulfur Thermal Energy Storage

Industrial process heating (IPH) accounts for approximately 70% of US manufacturing energy use and is primarily produced by fossil fuel combustion. Approximately 1500 TWht (approximately 60%) of IPH demand is in the temperature range of 100-300. Industrial applications in this temperature range include drying, hydrothermal processing, thermal enhanced oil recovery, food and beverage, bioethanol production, etc. Cost-effective thermal energy storage (TES) that increases the utilization of waste and renewable heat (solar, geothermal, etc.) could provide significant energy savings and reliable heat sources, decrease emissions, and increase US manufacturing competitiveness through reductions in fuel consumption. TES development has historically been dominated by technologies suitable for deployment with concentrating solar power (CSP). State-of-the-art thermal storage deployed commercially with power tower CSP plants uses a 60%/40% NaNO3/KNO3 molten salt and operates between temperatures of approximately 280 degrees Celsius and 570 degrees Celsius using a two-tank configuration. However, these nitrate salts are unsuitable for operation outside of this temperature range due to a high freezing point of approximately 220 degrees Celsius, and limits on high-temperature salt stability and corrosion resistance of containment alloys. Other materials being investigated for TES include those based on: (1) sensible energy storage (various molten salt compositions, inert solid particles, rocks or pebble beds, sulfur, water, concrete, graphite, etc.), (2) latent energy storage in materials that undergo solid-liquid phase change at relevant temperatures (organic materials for low-temperature applications, inorganic salts and/or metals for high-temperature applications), or (3) thermochemical energy storage (hydrides, hydroxides, carbonates, metal oxides, etc.). The application temperature and challenges pertaining to storage material and/or containment cost, energy density, long-term thermal and cyclic stability, and charge/discharge heat transfer effectiveness drive material selection for a given IPH or electricity generation application. Sulfur is a cheap commodity at $80/ton compared to $1100 - 1300/ton for conventional salts. When using a metric of storage cost per kWh, sulfur costs around 2-3 $/kWh. Previous sulfur TES development focused on high temperature (>600 degrees) concentrated solar power applications with sulfur encapsulated in pipes and flow of gaseous HTF (air) in the shell side. However, for lower-temperature IPH applications in the range of approximately 100-300 degrees Celsius Element 16 adopted a compact and scalable TES design with molten sulfur in the shell and HTF pipes submerged in the molten sulfur bath. The low-cost molten sulfur TES for dispatchable IPH has deployment potential for broad applications. The spatial and temporal evolution of the HTF and sulfur temperature is critical to the TES system performance, and thus detailed modeling can improve understanding of the performance and facilitate design improvements. Using high performance computing and computational fluid dynamics (CFD) a low-cost molten sulfur thermal energy storage (TES) system for industrial process heating (IPH) applications was developed. The unique challenges in CFD modeling of sulfur TES are the sharp property changes of sulfur relevant to the working temperatures. Above 159, liquid sulfur undergoes polymerization, and the viscosity of sulfur rapidly increases by several orders of magnitude between 159 degrees Celsius and 188 degrees Celsius, followed by a decrease in viscosity beyond 188 degrees Celsius due to thermal bound dissociation. In addition, various concentrations of H2S impurities can also modify sulfur viscosity. This numerical challenge is especially relevant to transient simulation of the sulfur TES charging and discharging processes as the extreme property variations limit the applicability of traditional heat transfer correlations. Transient CFD simulations including the temperature-dependent sulfur properties and geometric complexity of the TES design were used to predict the effect of natural convection during charging and discharging on the heat transfer process, sulfur temperature uniformity, charge/discharge rates, and performance of the storage devices. The CFD model was validated with experimental results for a full charge and discharge cycle. The work will show 3D and 2D simulation comparisons aimed to facilitate rapid design iterations and a machine learning based design optimization approach.

CFD↗
DOE OSTI2022

Deep learning to estimate permeability using geophysical data

Time-lapse electrical resistivity tomography (ERT) is a popular geophysical method to estimate three-dimensional (3D) permeability fields from electrical potential difference measurements. Traditional inversion and data assimilation methods are used to ingest this ERT data into hydrogeophysical models to estimate permeability. Due to ill-posedness and the curse of dimensionality, existing inversion strategies provide poor estimates and low resolution of the 3D permeability field. Recent advances in deep learning provide us with powerful algorithms to overcome this challenge. This paper presents a deep learning (DL) framework to estimate the 3D subsurface permeability from time-lapse ERT data. To test the feasibility of the proposed framework, we train DL-enabled inverse models on simulation data. Each measurement in both synthetic and field data is standardized by removing the mean and scaling the time-series to unit variance. This pre-processing step is necessary to bring simulation data closer to field observations. Subsurface process models based on hydrogeophysics are used to generate this synthetic data. Training performed on limited simulation data resulted in the DL model over-fitting. An advanced data augmentation based on mixup is implemented to generate additional training samples to overcome this issue. This mixup technique creates weakly labeled (low-fidelity) samples from strongly labeled (high-fidelity) data. The weakly labeled training data is then used to develop DL-enabled inverse models and reduce over-fitting. As both time-lapse ERT (1133048 features/realization) and 3D permeability (585453 features/realization) data samples are from a high-dimensional space, principal component analysis (PCA) is employed to reduce dimensionality. Encoded ERT and encoded permeability are generated using the trained PCA estimators. A deep neural network is then trained to map the encoded ERT to encoded permeability. This mixup training and unsupervised learning allowed us to build a fast and reasonably accurate DL-based inverse model under limited simulation data. Results show that proposed weak supervised learning can capture salient spatial features in the 3D permeability field. Quantitatively, the average mean squared error (in terms of the natural log) on the strongly labeled training, validation, and test datasets is less than 0.5. The R 2 -score (global metric) is greater than 0.75, and the percent error in each cell (local metric) is less than 10%. Finally, an added benefit in terms of computational cost is that the proposed DL-based inverse model is at least O(10 4 ) times faster than running a forward model once it is trained. Data generation, DL model training, and hyperparameter tuning to identify optimal neural network architectures utilized high-performance computing resources while the DL inference is performed on a standard laptop. Approximately, O(10 5 ) processor hours are used for generating data and DL tuning and training. We acknowledge that the data generation and DL model development are expensive. But once a DL model is trained, it can be re-used for inversion rapidly for the given system, with set physics and domain. Note that traditional inversion may require multiple forward model simulations (e.g., in the order of 10 to 1000), which are very expensive. This computational savings ≈ O(10 5 ) – O(10 7 )) makes the proposed DL-based inverse model attractive for subsurface imaging and real-time ERT monitoring applications due to fast and yet reasonably accurate estimations of permeability field.

58 GEOSCIENCES↗
DOE OSTI2020

Multigrid deflation for Lattice QCD

Computing the trace of the inverse of large matrices is typically addressed through statistical methods. Deflating out the lowest eigenvectors or singular vectors of the matrix reduces the variance of the trace estimator. This work summarizes our efforts to reduce the computational cost of computing the deflation space while achieving the desired variance reduction for Lattice QCD applications. Previous efforts computed the lower part of the singular spectrum of the Dirac operator by using an eigensolver preconditioned with a multigrid linear system solver. Despite the improvement in performance in those applications, as the problem size grows the runtime and storage demands of this approach will eventually dominate the stochastic estimation part of the computation. In this work, we propose to compute the deflation space in one of the following two ways. First, by using an inexact eigensolver on the Hermitian, but maximally indefinite, operator. Second, by exploiting the fact that the multigrid prolongator for this operator is rich in components toward the lower part of the singular spectrum. We show experimentally that the inexact eigensolver can approximate the lower part of the spectrum even for ill-conditioned operators. Also, the deflation based on the multigrid prolongator is more efficient to compute and apply, and, despite its limited ability to approximate the fine level spectrum, it obtains similar variance reduction on the trace estimator as deflating with approximate eigenvectors from the fine level operator.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗
DOE OSTI2021

Modeling of particle transport, neutrals and radiation in magnetically-confined plasmas with Aurora

In this work, we present Aurora, an open-source package for particle transport, neutrals and radiation modeling in magnetic confinement fusion plasmas. Aurora's modern multi-language interface enables simulations of 1.5D impurity transport within high-performance computing frameworks, particularly for the inference of particle transport coefficients. A user-friendly Python library allows simple interaction with atomic rates from the Atomic Data and Atomic Structure database as well as other sources. This enables a range of radiation predictions, both for power balance and spectroscopic analysis. We discuss here the superstaging approximation for complex ions, as a way to group charge states and reduce computational cost, demonstrating its wide applicability within the Aurora forward model and beyond. Aurora also facilitates neutral particle analysis, both from experimental spectroscopic data and other simulation codes. Leveraging Aurora's capabilities to interface SOLPS-ITER results, we demonstrate that charge exchange is unlikely to affect the total radiated power from the ITER core during high performance operation. Finally, we describe the ImpRad module in the one modeling framework for integrated task framework, developed to enable experimental analysis and transport inferences on multiple devices using Aurora.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Removing instabilities in the hierarchical equations of motion: Exact and approximate projection approaches

The hierarchical equations of motion (HEOM) provide a numerically exact approach for computing the reduced dynamics of a quantum system linearly coupled to a bath. We have found that HEOM contains temperature-dependent instabilities that grow exponentially in time. In the case of continuous-bath models, these instabilities may be delayed to later times by increasing the hierarchy dimension; however, for systems coupled to discrete, nondispersive modes, increasing the hierarchy dimension does little to alleviate the problem. We show that these instabilities can also be removed completely at a potentially much lower cost via projection onto the space of stable eigenmodes; furthermore, we find that for discrete-bath models at zero temperature, the remaining projected dynamics computed with few hierarchy levels are essentially identical to the exact dynamics that otherwise might require an intractably large number of hierarchy levels for convergence. Recognizing that computation of the eigenmodes might be prohibitive, e.g., for large or strongly coupled models, we present a Prony filtration algorithm that may be useful as an alternative for accomplishing this projection when diagonalization is too costly. We present results demonstrating the efficacy of HEOM projected via diagonalization and Prony filtration. Finally, we discuss issues associated with the non-normality of HEOM.

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

Computation of the Biot–Savart line integral with higher-order convergence using straight segments

One common approach to computing the magnetic field produced by a filamentary current-carrying coil is to approximate the coil as a series of straight segments. The Biot–Savart field from each straight segment is analytically known. However, if the endpoints of the straight segments are chosen to lie on the coil, then the accuracy of the Biot–Savart computation is generally only the second order in the number of endpoints. In this work, we propose a simple modification: shift each end point of the coil in the outward normal direction by an amount proportional to the local curvature. With this modification, the Biot–Savart accuracy increases to the fourth order and the numerical error is dramatically reduced for a given number of discretization points.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Checkpoint-Restart and Platform Design Criteria

Long computations often use checkpoint/restart to survive the inevitable failures. Optimal checkpoint/restart strategy can be derived in terms of special functions, and approximated within the regime of interest. As a further step under nominal assumptions, platforms can be optimized for maximum progress rate, computed in terms of non-dimensional parameter JMTTI/Delta, where JMTTI is the Job Mean Time To Interrupt and Delta is the time it takes to write (or read) a checkpoint. Scaling to a larger platform of the same technology requires scaling checkpoint bandwidth quadratically to maintain the same progress rate. This was observed during the design of LANL’s Roadrunner in 2007, led to burst buffers proposed in 2009 and introduced on Trinity in 2015. The need to compute reliably continues to impact the design of future exascale platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

In this report, we present a parallel 2-approximation Steiner minimal tree algorithm and its MPI-based distributed implementation. In place of expensive distance computations between all pairs of seed vertices, the solution we employ exploits a cheaper Voronoi cell computation. Our design leverages asynchronous processing and message prioritization to accelerate convergence of distance computations, and harnesses vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance using real-world graphs with up to 128 billion edges and 512 compute nodes, and show the ability to find Steiner trees with up to one million seed vertices. Using 12 data instances, we present comparison with the state-of-the-art exact solver, SCIP-Jack, and two sequential 2-approximate algorithms. We empirically show that, on average, the total distance of the Steiner tree identified by our solution is 1.1290 times greater than the Steiner minimal tree – well within the theoretical approximation bound of 2.

97 MATHEMATICS AND COMPUTING↗
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.↗