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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Development of Novel Ferritic-Martensitic Steels with Superior Creep Properties for Power Plant Applications

A creep resistant martensitic steel, CPJ-7, was developed with an operating temperature approaching 650°C. Subsequently, another creep resistant martensitic steel, JMP, was designed with the potential to operate at, or slightly above, 650°C. This report describes the development of these alloys from early iterations of CPJ steels to the final CPJ-7 formulation as well as the more heat resistant JMP steel formulation. The design originated from computational modeling for phase stability and precipitate strengthening using fifteen constituent elements. Approximately forty heats of CPJ and ten of JMP, each weighing ~7 kg, were vacuum induction melted. A computationally optimized heat treatment schedule was developed to homogenize the ingots prior to hot forging and rolling prior to final normalization and tempering. Overall, wrought and cast versions of CPJ-7 present superior creep properties when compared to wrought and cast versions of COST alloys for steam turbine and wrought and cast versions of P91/92 for boiler applications. For instance, the Larson Miller Parameter curve for CPJ-7 at 650°C almost coincides with that of COST E at 620°C. The prolonged creep life was attributed to slowing down the process of the destabilization of the MX and M 23 C 6 precipitates at 650°C. On the other hand, the cast version of CPJ-7 also revealed superior mechanical performance, well above commercially available cast 9% Cr martensitic steel or derivatives, especially for creep life at 650°C. The casting process employed slow cooling to simulate the conditions of a thick wall full-size steam turbine casing but utilized a separate homogenization step prior to final normalization and tempering. To advance the development of CPJ-7 for commercial applications, a process was used to scale up the production of the alloy using vacuum induction melting (VIM) and electroslag remelting (ESR), which underlined the importance of melt processing control of intentionally designed minor and trace elements in these advanced alloys. Following the work on CPJ-7, the JMP steels were designed with higher Co for increased solid solution strengthening, Si for oxidation resistance and increased W (with low Mo content) for matrix strength and stability as well as solid solution strengthening. The JMP steels showed increases in creep life compared to CPJ-7 between 118 to 150% at 650°C for testing at various stresses between 138 MPa and 207 MPa. On a Larson-Miller plot, the performance of the JMP steels surpasses that of state-of-the-art MARBN and other MARBN-type steels. The influence of various elements within the composition of the alloys on the microstructure and mechanical properties are discussed. This report presents approximately 420,000 h of in-house creep testing, the equivalent of almost 50 years of cumulative creep tests.

36 MATERIALS SCIENCE↗
DOE OSTI2020

A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet

We consider the scientifically challenging and policy-relevant task of understanding the past and projecting the future dynamics of the Antarctic ice sheet. The Antarctic ice sheet has shown a highly nonlinear threshold response to past climate forcings. Triggering such a threshold response through anthropogenic greenhouse gas emissions would drive drastic and potentially fast sea level rise with important implications for coastal flood risks. Previous studies have combined information from ice sheet models and observations to calibrate model parameters. These studies have broken important new ground but have either adopted simple ice sheet models or have limited the number of parameters to allow for the use of more complex models. These limitations are largely due to the computational challenges posed by calibration as models become more computationally intensive or when the number of parameters increases. Here, we propose a method to alleviate this problem: a fast sequential Monte Carlo method that takes advantage of the massive parallelization afforded by modern high-performance computing systems. We use simulated examples to demonstrate how our sample-based approach provides accurate approximations to the posterior distributions of the calibrated parameters. The drastic reduction in computational times enables us to provide new insights into important scientific questions, for example, the impact of Pliocene era data and prior parameter information on sea level projections. These studies would be computationally prohibitive with other computational approaches for calibration such as Markov chain Monte Carlo or emulation-based methods. We also find considerable differences in the distributions of sea level projections when we account for a larger number of uncertain parameters. For example, based on the same ice sheet model and data set, the 99th percentile of the Antarctic ice sheet contribution to sea level rise in 2300 increases from 6.5 m to 13.1 m when we increase the number of calibrated parameters from three to 11. With previous calibration methods, it would be challenging to go beyond five parameters. Here, this work provides an important next step toward improving the uncertainty quantification of complex, computationally intensive and decision-relevant models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Evaluating Grid Strength under Uncertain Renewable Generation

The increasing displacement of synchronous generators with renewable resources such as wind and solar via power electronic interfaces causes a reduction in short-circuit strength and weak grid issues. The variation and uncertainty of renewable energy increase challenges for identifying weak grid conditions. This paper proposes an efficient method to analyze the impact of uncertain renewable energy on grid strength. The proposed method uses the probabilistic collocation method (PCM) to approximate the results of grid strength assessment under uncertain renewable generation, in order to reduce computational burden without compromising result accuracy when compared with traditional Monte Carlo simulation (MCS). To improve the accuracy of the approximation results, the proposed method integrates the K-means clustering technique with PCM to select the approximation samples of input variables. The efficacy of the proposed method is demonstrated by comparison with MCS on the modified IEEE 9-bus system and modified IEEE 39-bus system with multiple renewable generators.

grid strength↗
DOE OSTI2019

Investigation of assumptions and approximations in the virtual fields method for a viscoplastic material model

The Virtual Fields Method (VFM) is an inverse technique used for parameter estimation and calibration of constitutive models. Many assumptions and approximations—such as plane stress, incompressible plasticity, and spatial and temporal derivative calculations—are required to use VFM with full-field deformation data, for example, from Digital Image Correlation (DIC). Here, this work presents a comprehensive discussion of the effects of these assumptions and approximations on parameters identified by VFM for a viscoplastic material model for 304L stainless steel. We generated synthetic data from a Finite-Element Analysis (FEA) in order to have a reference solution with a known material model and known model parameters, and we investigated four cases in which successively more assumptions and approximations were included in the data. We found that VFM is tolerant to small deviations from the plane stress condition in a small region of the sample, and that the incompressible plasticity assumption can be used to estimate thickness changes with little error. A local polynomial fit to the displacement data was successfully employed to compute the spatial displacement gradients. The choice of temporal derivative approximation (i.e., backwards difference versus central difference) was found to have a significant influence on the computed rate of deformation and on the VFM results for the rate-dependent model used in this work. Finally, the noise introduced into the displacement data from a stereo-DIC simulator was found to have negligible influence on the VFM results. Evaluating the effects of assumptions and approximations using synthetic data is a critical first step for verifying and validating VFM for specific applications. Finally, the results of this work provide the foundation for confidently using VFM for experimental data.

304L stainless steel↗
DOE OSTI2023

Decay Dose Shielding Analysis with Hybrid Unstructured Mesh/Constructive Solid Geometry Monte Carlo Calculation and ADVANTG Acceleration

Here, the target segments of the Oak Ridge National Laboratory Second Target Station (STS) neutron production facility become highly activated due to spallation reactions or nuclei transmutation by primary protons and emitted neutrons. Once the target segments are removed from their location within the core vessel, decay dose rates must be accurately quantified to determine the shielding configurations of remote-handling tools and transport casks and to aid in planning maintenance activities. For this analysis, we utilized a hybrid unstructured mesh (UM)/constructive solid geometry approach for calculating spallation products and neutron fluxes, activation calculations using the AARE package that includes the CINDER2008 activation code to calculate the decay photon source at different cooling times, and the ADVANTG code to accelerate the final decay photon transport calculation. Both Type 316 stainless steel (SS-316) and lead were investigated as candidates for shielding materials. The decay photon transport calculation through the thick SS-316 or lead shields exhibited between 25 and 30 orders-of-magnitude attenuations in the radial direction, depending on the shield. Such a difficult shielding calculation required advanced variance reduction. ADVANTG has some missing features, which limits its usability in spallation neutron source applications. It does not support volumetric sources created for MCNP6.2 UM capability. An approximate source was created for this problem. Not only was this approximate source needed for running the ADVANTG calculation to generate the weight windows, but also it was essential to develop source biasing (SB) parameters that were crucial for dramatically accelerating the decay photon transport in this problem. With this approximate source, the analysis was completed in a very reasonable computational time, and the design of the STS remote-handling equipment was finalized. This paper compares the efficiency of Monte Carlo simulations with different weight window and SB parameters calculated using different approximate ADVANTG calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗
DOE OSTI2024

Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

This paper analyzes a popular computational framework to solve infinite-dimensional Bayesian inverse problems, discretizing the prior and the forward model in a finite-dimensional weighted inner product space. We demonstrate the benefit of working on a weighted space by establishing operator-norm bounds for finite element and graph-based discretizations of Matérn-type priors and deconvolution forward models. For linear-Gaussian inverse problems, we develop a general theory to characterize the error in the approximation to the posterior. We also embed the computational framework into ensemble Kalman methods and MAP estimators for nonlinear inverse problems. Furthermore, our operator-norm bounds for prior discretizations guarantee the scalability and accuracy of these algorithms under mesh refinement.

Bayesian inverse problem↗
DOE OSTI2023

Thermofield Theory for Finite-Temperature Electronic Structure

Wave function methods have offered a robust, systematically improvable means to study ground-state properties in quantum many-body systems. Theories like coupled cluster and their derivatives provide highly accurate approximations to the energy landscape at a reasonable computational cost. Analogues of such methods to study thermal properties, though highly desirable, have been lacking because evaluating thermal properties involve a trace over the entire Hilbert space, which is a formidable task. Besides, excited-state theories are generally not as well studied as ground-state ones. In this mini-review, we present an overview of a finite-temperature wave function formalism based on thermofield dynamics to overcome these difficulties. Thermofield dynamics allows us to map the equilibrium thermal density matrix to a pure state, i.e., a single wave function, albeit in an expanded Hilbert space. Ensemble averages become expectation values over this so-called thermal state. Around this thermal state, we have developed a procedure to generalize ground-state wave function theories to finite temperatures. As explicit examples, we highlight formulations of mean-field, configuration interaction, and coupled cluster theories for thermal properties of Fermions in the grand-canonical ensemble. To assess the quality of these approximations, we also show benchmark studies for the one-dimensional Hubbard model, while comparing against exact results. We will see that the thermal methods perform similarly to their ground-state counterparts, while merely adding a prefactor to the asymptotic computational cost. Furthermore, they also inherit all the properties, good or bad, from the ground-state methods, signifying the robustness of our formalism and the scope for future development.

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

Electron-Affinity Time-Dependent Density Functional Theory: Formalism and Applications to Core-Excited States

The lack of particle-hole attraction and orbital relaxation within time-dependent density functional theory (TDDFT) lead to extreme errors in the prediction of K-edge X-ray absorption spectra (XAS). We derive a linear-response formalism that uses optimized orbitals of the n - 1-electron system as the reference, building orbital relaxation and a proper hole into the initial density. Here, our approach is an exact generalization of the static-exchange approximation that ameliorates the particle-hole interaction error associated with the adiabatic approximation and reduces errors in TDDFT XAS by orders of magnitude. With a statistical performance of just 0.5 eV root-mean-square error and the same computational scaling as TDDFT under the core-valence separation approximation, we anticipate that this approach will be of great utility in XAS calculations of large systems.

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

Programmatic Advantages of Linear Equivalent Seismic Models

Underground explosions nonlinearly deform the surrounding earth material and can interact with the free surface to produce spall. However, at typical seismological observation distances the seismic wavefield can be accurately modeled using linear approximations. Although nonlinear algorithms can accurately simulate very near field ground motions, they are computationally expensive and potentially unnecessary for far field wave simulations. Conversely, linearized seismic wave propagation codes are orders of magnitude faster computationally and can accurately simulate the wavefield out to typical observational distances. Thus, devising a means of approximating a nonlinear source in terms of a linear equivalent source would be advantageous both for scenario modeling and for interpretation of seismic source models that are based on linear, far-field approximations. This allows fast linear seismic modeling that still incorporates many features of the nonlinear source mechanics built into the simulation results so that one can have many of the advantages of both types of simulations without the computational cost of the nonlinear computation. In this report we first show the computational advantage of using linear equivalent models, and then discuss how the near-source (within the nonlinear wavefield regime) environment affects linear source equivalents and how well we can fit seismic wavefields derived from nonlinear sources.

58 GEOSCIENCES↗
DOE OSTI2025

Modeling laser-wakefield accelerators using the time-averaged ponderomotive approximation in a Lorentz boosted frame

Future, high-fidelity simulations of multi-GeV-class laser Wakefield accelerators (LWFAs) will need to model the propagation of high-intensity laser drivers over meter-scale plasmas with high spatial and temporal resolutions, thus requiring high amounts of computational resources. Various techniques have been devised over the years to reduce the computational cost of such simulations, including the time-averaged ponderomotive approximation, and the use of the Lorentz boosted frame technique. In this paper we discuss the combination of these two computational techniques, highlighting the resulting significant reduction in the computational cost of LWFA simulations and the limitations of this approach. The combination of the two techniques can potentially become essential for the modeling of a multi-TeV, LWFA-based collider.

Laser Wakefield Acceleration↗
DOE OSTI2018

Neural Networks as Surrogates of Nonlinear High-Dimensional Parameter-to-Prediction Maps

We present a preliminary investigation of the use of Multi-Layer Perceptrons (MLP) and Recurrent Neural Networks (RNNs) as surrogates of parameter-to-prediction maps of computational expensive dynamical models. In particular, we target the approximation of Quantities of Interest (QoIs) derived from the solution of a Partial Differential Equations (PDEs) at different time instants. In order to limit the scope of our study while targeting a relevant application, we focus on the problem of computing variations in the ice sheets mass (our QoI), which is a proxy for global mean sea-level changes. We present a number of neural network formulations and compare their performance with that of Polynomial Chaos Expansions (PCE) constructed on the same data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Direct numerical simulations for hybrid rocket boundary layers: Performance modeling and scaling

This paper presents a comprehensive performance and scaling analysis of direct numerical simulations for reacting boundary layers, focusing on slab burner configurations. Using a PETSc-based finite volume CFD framework, the study evaluates the scalability and computational cost of flow, chemistry, and radiation evaluations across 2D and 3D simulations. Polymethyl methacrylate (PMMA) is the fuel with pure O 2 as the oxidizer, modeled using a detailed chemical kinetics mechanism with 113 species and 660 reactions. A ray-tracing-based radiation solver, designed for distributed memory applications, is implemented to model radiation heat transfer. Parallel scalability is analyzed for the coupled flow, chemistry, and radiation heat transfer processes. Weak and strong scaling studies are conducted on up to 15,000 computational ranks, revealing robust performance when flow cells exceed 200 per rank. Chemistry evaluations dominate the computational cost in large 3D simulations, accounting for approximately 40% of the total runtime, while flow processes contribute around 35%, and radiation solver contributions remain below 10% due to reduced evaluation frequencies. GPU accelerated chemistry evaluation, implemented with Zero-RK, demonstrates significant promise, achieving up to a 4x speedup for workloads exceeding 30,000 cells per GPU. However, diminishing returns are observed for smaller workloads due to CPU-GPU communication overhead. This study identifies key challenges, including memory bottlenecks and the effects of domain partitioning on flow scalability, while highlighting the potential of GPU-accelerated chemistry to reduce computational costs. In conclusion, these findings provide realizable run configurations for 2D, 3D, and GPU-accelerated cases, offering insights for optimizing reactive flow solvers.

CFD Scalability↗
DOE OSTI2023

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Metaplectic geometrical optics for modeling caustics in uniform and non-uniform media

As an approximate theory that is highly regarded for its computational efficiency, geometrical optics (GO) is widely used for modeling waves in various areas of physics. However, GO fails at caustics, which significantly limits its applicability. A new framework, called metaplectic geometrical optics (MGO), has recently been developed that allows caustics of certain types to be modeled accurately within the GO framework. Here, we extend MGO to the most general case. Further, to illustrate our new theory, we also apply it to several sample problems, including calculations of two-dimensional wavefields near fold and cusp caustics. In contrast with traditional GO solutions, the corresponding MGO solutions are finite everywhere and approximate the true wavefield well near these caustics.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems

We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.

3-SAT↗