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,351 records · Page 75
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Modeling cross-beam energy transfer with sector ray tracing

Ray-based cross-beam energy transfer (CBET) models are an essential feature of the radiation-hydrodynamic codes used to simulate inertial confinement fusion implosions, but full 3D ray-based CBET calculations can have a prohibitively high computational cost. Sector ray tracing can be used to reduce the cost by orders of magnitude in cases where the coronal plasma and laser drive can be approximated as spherically symmetric. An extension of sector ray tracing (section ray tracing) can be used to relax the assumption of a spherically symmetric drive while still retaining most of the computational savings of a sector ray trace. We discuss the foundations of sector and section ray tracing and compare them to full ray tracing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

How to estimate the 3D power spectrum of the Lyman-α forest

Here, we derive and numerically implement an algorithm for estimating the 3D power spectrum of the Lyman-α (Lyα) forest flux fluctuations. The algorithm exploits the unique geometry of Lyα forest data to efficiently measure the cross-spectrum between lines of sight as a function of parallel wavenumber, transverse separation and redshift. We start by approximating the global covariance matrix as block-diagonal, where only pixels from the same spectrum are correlated. We then compute the eigenvectors of the derivative of the signal covariance with respect to cross-spectrum parameters, and project the inverse-covariance-weighted spectra onto them. This acts much like a radial Fourier transform over redshift windows. The resulting cross-spectrum inference is then converted into our final product, an approximation of the likelihood for the 3D power spectrum expressed as second order Taylor expansion around a fiducial model. We demonstrate the accuracy and scalability of the algorithm and comment on possible extensions. Our algorithm will allow efficient analysis of the upcoming Dark Energy Spectroscopic Instrument dataset.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

A reproducing kernel enhanced approach for peridynamic solutions

The most common discretization method for peridynamic models used in engineering problems is the node-based meshfree approach. This method discretizes peridynamic domains by a set of nodes, each associated with a nodal cell with a characteristic volume, leading to a particle-based description of continuum systems. The behavior of each particle is then considered representative of its cell. This limits the convergence rate to the first order. In this paper, we introduce a reproducing kernel (RK) approximation to the field variables in the peridynamic equations to increase the order of convergence of peridynamic numerical solutions. Furthermore, the numerical results demonstrate improved convergence rates in static peridynamic problems using the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A new numerically stable sequential algorithm for coupled finite-strain elastoplastic geomechanics and flow

In this work, we propose a new numerically stable sequential implicit method for coupled flow and finite-strain multiplicative elastoplastic geomechanics. We find from stability analysis that the sequential method that solves the flow problem first by fixing the first Piola-Kirchhoff total stress, solving the geomechanics (solid deformation) problem at the next step, is unconditionally stable (contractive and B-stable). In this sense, this method named the fixed first Piola-Kirchhoff stress method is an extension of the fixed stress method in coupled flow and infinitesimal geomechanics. We also study the fixed second Piola-Kirchhoff stress method, comparing it with the fixed first Piola-Kirchhoff stress method, because the constitutive relations are formulated by the second Piola-Kirchhoff total stress, although fixing the second Piola-Kirchhoff total stress field does not provide theoretical unconditional stability. In space discretization, we use the finite element method for the geomechanics problem with the total Lagrangian approach, while employing the finite volume method for the flow problem. Geometrical nonlinearity from the total Lagrangian approach results in full-tensor permeability even if the initial permeability is isotropic. To consider the full-tensor permeability accurately, we employ the multipoint flux approximation in solving the flow problem. In time discretization, the backward Euler method is used. Then, we perform numerical experiments of the two fixed-stress sequential methods with various scenarios, and find superiority of their numerical stability. Specifically, the two fixed-stress sequential methods provide almost identical results for elasticity. For J2 plasticity, the two sequential methods yield slightly different numerical results although the trends of the results are similar. For the Drucker-Prager plasticity, we find that the results from the two methods are almost identical. For all the test cases, the two sequential methods are numerically stable.

58 GEOSCIENCES↗
DOE OSTI2023

Robust second-order approximation of the compressible Euler equations with an arbitrary equation of state

Here, this paper is concerned with the approximation of the compressible Euler equations supplemented with an arbitrary or tabulated equation of state. The proposed approximation technique is robust, formally second-order accurate in space, invariant-domain preserving, and works for every equation of state, tabulated or analytic, provided the pressure is nonnegative. An entropy surrogate functional that grows across shocks is proposed. The numerical method is verified with novel analytical solutions and then validated with several computational benchmarks seen in the literature including problems with composite waves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Approximating the particle distribution in rotating and tandem mirror traps

Steady-state distribution functions can be used to calculate stability conditions for modes, radiation energy losses and particle loss rates. Heuristic analytic approximations to these distributions can capture key behaviors of the true distributions such as the relative speeds of different transport processes while possessing computational advantages over their numerical counterparts. In this paper, we motivate and present a closed-form analytic model for a distribution of particles in a centrifugal or tandem mirror. We find that our model outperforms other known models in approximating numerical steady-state simulations outside of a narrow range of low confining potentials. We demonstrate the model’s suitability in the high confining potential regime for applications such as loss-cone stability thresholds, fusion yields and available energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Machine learning for surrogate process models of bioproduction pathways

Technoeconomic analysis and life-cycle assessment are critical to guiding and prioritizing bench-scale experiments and to evaluating economic and environmental performance of biofuel or biochemical production processes at scale. Traditionally, commercial process simulation tools have been used to develop detailed models for these purposes. However, developing and running such models can be costly and computationally intensive, which limits the degree to which they can be shared and reproduced in the broader research community. This study evaluates the potential of an automated machine learning approach to develop surrogate models based on conventional process simulation models. The analysis focuses on several high-value biofuels and bioproducts for which pathways of production from biomass feedstocks have been well-established. The results demonstrate that surrogate models can be an accurate and effective tool for approximating the cost, mass and energy balance outputs of more complex process simulations at a fraction of the computational expense.

09 BIOMASS FUELS↗
DOE OSTI2025

Electron-Ion Dynamics with Time-Dependent Density Functional Theory: Towards Predictive Solar Cell Modeling

This project focussed on two aspects of computational modeling with a view toward application for photovoltaic design: (i) increased reliability of exchange-correlation functionals in time-dependent density functional theory (TDDFT) (a method of choice of the calculation of electronic spectra and dynamics), especially for time-resolved non-perturbative dynamics, and (ii) the development of a practical but rigorously-based method for coupling electronic and nuclear motion via the exact-factorization (EF) approach (a relatively new framework for developing approximations).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum-classical embedding via ghost Gutzwiller approximation for enhanced simulations of correlated electron systems

Simulating correlated materials on present-day quantum hardware remains challenging due to limited quantum resources. Quantum embedding methods offer a promising route by reducing computational complexity through the mapping of bulk systems onto effective impurity models, allowing more feasible simulations on pre- and early-fault-tolerant quantum devices. Here, this work develops a quantum-classical embedding framework based on the ghost Gutzwiller approximation to enable quantum-enhanced simulations of ground-state properties and spectral functions of correlated electron systems. Circuit complexity is analyzed using an adaptive variational quantum algorithm on a statevector simulator, applied to the infinite-dimensional Hubbard model with increasing ghost mode numbers from 3 to 5, resulting in circuit depths growing from 16 to 104. Noise effects are examined using a realistic error model, revealing significant impact on the spectral weight of the Hubbard bands. To mitigate these effects, the Iceberg quantum error detection code is employed, achieving up to 40% error reduction in simulations. Finally, the accuracy of the density matrix estimation and the derived spectral function is benchmarked on IBM and Quantinuum quantum hardware, featuring distinct qubit-connectivity and employing multiple levels of error mitigation techniques.

Chen, I-Chi [Ames Laboratory (AMES), Ames, IA (Uni↗
DOE OSTI2021

Proof-of-concept of a reinforcement learning framework for wind farm energy capture maximization in time-varying wind

Here, we present a proof-of-concept distributed reinforcement learning framework for wind farm energy capture maximization. The algorithm we propose uses Q-Learning in a wake-delayed wind farm environment and considers time-varying, though not yet fully turbulent, wind inflow conditions. These algorithm modifications are used to create the Gradient Approximation with Reinforcement Learning and Incremental Comparison (GARLIC) framework for optimizing wind farm energy capture in time-varying conditions, which is then compared to the FLOw Redirection and Induction in Steady State (FLORIS) static lookup table wind farm controller baseline.

17 WIND ENERGY↗
DOE OSTI2021

Efficacy of the radial pair potential approximation for molecular dynamics simulations of dense plasmas

Macroscopic simulations of dense plasmas rely on detailed microscopic information that can be computationally expensive and is difficult to verify experimentally. In this work, we delineate the accuracy boundary between microscale simulation methods by comparing Kohn–Sham density functional theory molecular dynamics (KS-MD) and radial pair potential molecular dynamics (RPP-MD) for a range of elements, temperature, and density. By extracting the optimal RPP from KS-MD data using force matching, we constrain its functional form and dismiss classes of potentials that assume a constant power law for small interparticle distances. Our results show excellent agreement between RPP-MD and KS-MD for multiple metrics of accuracy at temperatures of only a few electron volts. The use of RPPs offers orders of magnitude decrease in computational cost and indicates that three-body potentials are not required beyond temperatures of a few eV. Due to its efficiency, the validated RPP-MD provides an avenue for reducing errors due to finite-size effects that can be on the order of ∼20%.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Securely Aggregated Coded Matrix Inversion

Coded computing is a method for mitigating straggling workers in a centralized computing network, by using erasure-coding techniques. Federated learning is a decentralized model for training data distributed across client devices. In this work we propose approximating the inverse of an aggregated data matrix, where the data is generated by clients; similar to the federated learning paradigm, while also being resilient to stragglers. To do so, we propose a coded computing method based on gradient coding. We modify this method so that the coordinator does not access the local data at any point; while the clients access the aggregated matrix in order to complete their tasks. Here, the network we consider is not centrally administrated, and the communications which take place are secure against potential eavesdroppers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Approximating the particle distribution in rotating and tandem mirror traps

Steady-state distribution functions can be used to calculate stability conditions for modes, radiation energy losses and particle loss rates. Heuristic analytic approximations to these distributions can capture key behaviors of the true distributions such as the relative speeds of different transport processes while possessing computational advantages over their numerical counterparts. In this paper, we motivate and present a closed-form ana- lytic model for a distribution of particles in a centrifugal or tandem mirror. We find that our model outperforms other known models in approximating numerical steady- state simulations outside of a narrow range of low confining potentials. We demonstrate the model’s suitability in the high confining potential regime for applications such as loss-cone stability thresholds, fusion yields and available energy.

Li, G.X.↗
DOE OSTI2020

HYDRODYNAMIC ANALYSIS OF MACROALGAE LOCAL MODEL USING COMPUTATIONAL FLUID DYNAMICS

In this article, a local scale, fully nonlinear coupled fluid-structural interaction (FSI) sugar kelp model has been developed using a computational fluid dynamics (CFD) method. In this model, to be consistent with available experimental data, the sugar kelp is approximated as elongated rectangles with smoothed isosceles triangles at the ends and a single kelp model with one end fixed in a channel with constant current model is developed. Several different current speeds are simulated, and the resulting drag forces and calculated drag coefficients are validated by comparison with experimental data from the literature. In a previous study, a global scale model was developed using a computational structural dynamics (CSD) method to simulate macroalgae farming system and guide the system configuration design. In the global scale model, the hydrodynamic forces are calculated using Morison’s equation and the kinematics and dynamics of the sugar kelp are simplified and the group of kelps attached to the long line is modeled as a slender structure with the same length and an effective diameter such that the volumes are consistent with the real physical system. This simplified model matches the weight and buoyancy but adjusting the hydrodynamic properties when the general hydrodynamic coefficients are employed. Therefore, optimal hydrodynamic coefficients used in global scale model were determined to obtain the hydrodynamic force more accurately. The validated local scale model is then be applied to determine the hydrodynamic coefficients of the simplified sugar kelp model for global dynamic analysis.

hydrodynamic modeling, macroalgae, CFD model↗
DOE OSTI2023

Auto-HPCnet: An Automatic Framework to Build Neural Network-based Surrogate for High-Performance Computing Applications

High-performance computing communities are increasingly adopt- ing Neural Networks (NN) as surrogate models in their applications to generate scientific insights. Replacing an execution phase in the application with NN models can bring significant performance im- provement. However, there is a lack of tools that can help domain scientists automatically apply NN-based surrogate models to HPC applications. We introduce a framework, named Auto-HPCnet, to democratize the usage of NN-based surrogates. Auto-HPCnet is the first end-to-end framework that makes past proposals for the NN-based surrogate model practical and disciplined. Auto-HPCnet introduces a workflow to address unique challenges when apply- ing the approximation, such as feature acquisition and meeting the application-specific constraint on the quality of final computation outcome. We show that Auto-HPCnet can leverage NN for a set of HPC applications and achieve 5.50× speedup on average (up to 16.8× speedup and with data preparation cost included) while meeting the application-specific constraint on the final computation quality.

Dong, Wenqian↗
DOE OSTI2026

Hierarchical transfer learning: an agile and equitable strategy for machine-learning interatomic models

Machine-learned interatomic models are growing in popularity due to their ability to afford near quantum-accurate predictions for complex phenomena with orders-of-magnitude greater computational efficiency. However, these models struggle when applied to systems of many element types due to the approximately exponential increase in number of parameters that must be determined. To mitigate this challenge, we present a new hierarchical transfer learning approach that allows the fitting problem to be decomposed into smaller independent and reusable parameter blocks that enable development of explicitly chemically extensible ML-IAM. Application of this strategy is demonstrated for C and N mixtures under conditions ranging from nominally ambient to ~10,000 K and 200 GPa for compositions from 0 to 100% N. Ultimately, this strategy makes model generation for chemically complex systems more tractable and efficient, facilitates comprehensive model validation, and makes ML-IAM development for problems of this nature more accessible to users with limited access to extreme computing infrastructure.

Lindsey, Rebecca K. [Univ. of Michigan, Ann Arbor,↗
DOE OSTI2017

Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms

Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗