Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational cost”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2022

Vision-based Velocimetry over Unknown Terrain with a Low-Noise IMU

This paper presents a novel approach to terrain-relative navigation with a visual camera and Inertial Measurement Unit (IMU). The proposed algorithm uses an Extended Kalman Filter (EKF) to combine an IMU propagated state estimate with batch correction estimates computed over a sliding window of measurements. The batch correction algorithm follows the Maximum Likelihood Estimation (MLE) approach used in other Bundle Adjustment systems. Unlike other systems, the proposed system parameterizes the state over the entire window in terms of the state at a single epoch. By ignoring IMU error over the window duration, we obtain a state epoch MLE that jointly estimates the epoch state and terrain parameters with drastically reduced computationally cost. This paper presents the general architecture which can be adapted for various state parameterizations and measurement inputs. For space applications with high-accuracy IMUs, the reduction in computational cost comes with only a modest increase in estimation errors. The increase in error is quantified via a linear covariance analysis presented in this paper. Furthermore, we present simulation results which show the applicability of this algorithm to planetary landing problems.

San Martin, A. Miguel↗
NASA NTRS2019

Using Graph Coloring to Compute Total Derivatives More Efficiently in OpenMDAO

When they are applicable, gradient based optimization algorithms are the most efficient way to solve design optimization problems. Although gradient based methods are generally efficient, they can be made significantly more so through the usage of analytic techniques to compute the necessary total derivatives. The traditional forward (direct) and reverse (adjoint) analytic techniques have computational costs that scale linearly with the number of design variables and the number of constraints, respectively. In this work, we present an application of a graph coloring algorithm to the analytic techniques for computing total derivative Jacobians in order to achieve much better computational scaling than the pure analytic methods can provide alone. A detailed theoretical explanation of how coloring algorithms interact with analytic derivative methods is presented that illustrates specific types of sparsity patterns that must be present in total derivative Jacobians in order for this coloring technique to be effective. The new technique has been implemented as a feature in the OpenMDAO framework and the implementation is demonstrated on two example problems. The performance on the example problems up to 50% reduction in compute cost for optimizations with bi-directional coloring compared to traditional constraint aggregation. Additionally, the results show how coloring technique alleviates some of the numerical difficulties that constraint aggregation can cause, leading to the ability to solve larger problems. It is expected that the new method will have wide applicability to multidisciplinary optimization problems, and that its availability in OpenMDAO will offer significant computational savings for users without the need for them to implement the coloring algorithm themselves.

Trajectory↗
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 OSTI2024

A meshless stochastic method for Poisson–Nernst–Planck equations

A plethora of biological, physical, and chemical phenomena involve transport of charged particles (ions). Its continuum-scale description relies on the Poisson–Nernst–Planck (PNP) system, which encapsulates the conservation of mass and charge. The numerical solution of these coupled partial differential equations is challenging and suffers from both the curse of dimensionality and difficulty in efficiently parallelizing. We present a novel particle-based framework to solve the full PNP system by simulating a drift–diffusion process with time- and space-varying drift. We leverage Green’s functions, kernel-independent fast multipole methods, and kernel density estimation to solve the PNP system in a meshless manner, capable of handling discontinuous initial states. The method is embarrassingly parallel, and the computational cost scales linearly with the number of particles and dimension. We use a series of numerical experiments to demonstrate both the method’s convergence with respect to the number of particles and computational cost vis-à-vis a traditional partial differential equation solver.

Chemistry↗
NASA NTRS1993

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗
DOE OSTI2024

Inverse design for waveguide dispersion with a differentiable mode solver

Inverse design of optical components based on adjoint sensitivity analysis has the potential to address the most challenging photonic engineering problems. However, existing inverse design tools based on finite-difference-time-domain (FDTD) models are poorly suited for optimizing waveguide modes for adiabatic transformation or perturbative coupling, which lies at the heart of many important photonic devices. Among these, dispersion engineering of optical waveguides is especially challenging in ultrafast and nonlinear optical applications involving broad optical bandwidths and frequency-dependent anisotropic dielectric material response. In this work, we develop gradient back-propagation through a general-purpose electromagnetic eigenmode solver and use it to demonstrate waveguide dispersion optimization for second harmonic generation with maximized phase-matching bandwidth. This optimization of three design parameters converges in eight steps, reducing the computational cost of optimization by ∼100x compared to exhaustive search and identifying new designs for broadband optical frequency doubling of laser sources in the 1.3–1.4 µm wavelength range. Furthermore, we demonstrate that the computational cost of gradient back-propagation is independent of the number of parameters, as required for optimization of complex geometries. This technique enables practical inverse design for a broad range of previously intractable photonic devices.

Gray, Dodd (ORCID:000000030469599X)↗
NASA NTRS1995

Scalability of Parallel Spatial Direct Numerical Simulations on Intel Hypercube and IBM SP1 and SP2

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube and IBM SP1 and SP2 parallel computers is documented. Spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows are computed with the PSDNS code. The feasibility of using the PSDNS to perform transition studies on these computers is examined. The results indicate that PSDNS approach can effectively be parallelized on a distributed-memory parallel machine by remapping the distributed data structure during the course of the calculation. Scalability information is provided to estimate computational costs to match the actual costs relative to changes in the number of grid points. By increasing the number of processors, slower than linear speedups are achieved with optimized (machine-dependent library) routines. This slower than linear speedup results because the computational cost is dominated by FFT routine, which yields less than ideal speedups. By using appropriate compile options and optimized library routines on the SP1, the serial code achieves 52-56 M ops on a single node of the SP1 (45 percent of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a "real world" simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP supercomputer. For the same simulation, 32-nodes of the SP1 and SP2 are required to reach the performance of a Cray C-90. A 32 node SP1 (SP2) configuration is 2.9 (4.6) times faster than a Cray Y/MP for this simulation, while the hypercube is roughly 2 times slower than the Y/MP for this application. KEY WORDS: Spatial direct numerical simulations; incompressible viscous flows; spectral methods; finite differences; parallel computing.

Joslin, Ronald D.↗
DOE OSTI2026

Predicting Atomistic Transitions with Transformers

Accurate knowledge of the atomistic transition pathways in materials and material surfaces is crucial for many material science problems. However, conventional simulation techniques used to find these transitions are extremely computationally intensive. Even with large-scale, accelerated material simulations, the computational cost constrains the applicable domain in practice. Machine learning models, with the potential to learn the complex emergent behaviors governing atomistic transitions as a fast surrogate model, have great promise to predict transitions with a vastly reduced computational cost. Here, we demonstrate how transformers can be trained to predict atomistic transitions in nano-clusters. We show how we evaluate physical validity of the predictions and how a multitude of additional, different microstates can be generated by slightly varying the data provided to the model.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Embedded random phase approximation for magnetic systems: H 2 dissociative adsorption on Fe(110)

The random phase approximation (RPA), a method for treating electron correlation, has been shown to be superior to standard density functional theory (DFT) approximations in numerous cases. However, the RPA’s computational cost is substantially higher than that of DFT, particularly restricting its application to extended surfaces. The recently introduced embedded RPA (emb-RPA) approach [Wei et al., J. Chem. Phys. 159(19), 194108 (2023)] reduces this computational cost by approximately two orders of magnitude. While previous applications of emb-RPA focused on non-spin-polarized systems, here we extend the approach to ferromagnetic ones. Unlike other embedded correlated wavefunction methods, such as embedded complete active space self-consistent field theory, emb-RPA is advantageous for spin-polarized systems because the RPA is compatible with unrestricted DFT solutions, which are eigenfunctions of the spin angular momentum operator S z but not the total spin-squared operator S 2 . By applying emb-RPA with specific magnetization constraints, we achieved a speedup of two to three orders of magnitude (one order when accounting for the one-time embedding potential optimization cost) with only small errors (∼50 meV) compared to full periodic RPA. Moreover, emb-RPA significantly reduces the over-binding errors of DFT approximations. In conclusion, we anticipate that the acceleration enabled by the spin-polarized emb-RPA approach will broaden the applicability of RPA to magnetic materials.

Density functional theory↗
NASA NTRS1997

Simplifying silicon burning: Application of quasi-equilibrium to (alpha) network nucleosynthesis

While the need for accurate calculation of nucleosynthesis and the resulting rate of thermonuclear energy release within hydrodynamic models of stars and supernovae is clear, the computational expense of these nucleosynthesis calculations often force a compromise in accuracy to reduce the computational cost. To redress this trade-off of accuracy for speed, the authors present an improved nuclear network which takes advantage of quasi- equilibrium in order to reduce the number of independent nuclei, and hence the computational cost of nucleosynthesis, without significant reduction in accuracy. In this paper they will discuss the first application of this method, the further reduction in size of the minimal alpha network. The resultant QSE- reduced alpha network is twice as fast as the conventional alpha network it replaces and requires the tracking of half as many abundance variables, while accurately estimating the rate of energy generation. Such reduction in cost is particularly necessary for future generation of multi-dimensional models for supernovae.

Hix, W. R.↗
DOE OSTI2024

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗
DOE OSTI2024

Physics-assisted Latent Space Dynamics Learning for Stiff Collisional-radiative Models

Collisional-radiative (CR) models describe the atomic processes in a plasma by tracking the population density in the ground and excited states for each charge state of the atom/ion. These models predict important plasma properties such as charge state distributions and radiative emissivity and opacity. Accurate descriptions of the CR balance of the plasma are essential in fusion whole device modeling, especially when significant impurities are introduced into the plasmas. In an integrated fusion plasma and CR simulation, a CR model, which is a high-dimensional stiff ODE, needs to be solved on each grid point in the configuration space, and can overwhelm the overall computational cost. In this work, we propose a machine-learning-based method that discovers a latent space and learns its corresponding latent dynamics, which can capture the essential physics to make accurate predictions at much lower online computational cost. The proposed approach is physics-assisted, due to its combination of a physical latent space and a data-driven latent space. It has been demonstrated that the proposed architecture can predict both the full-order CR dynamics and a physical quantity of interest accurately.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2001

A Rapid Aerodynamic Design Procedure Based on Artificial Neural Networks

An aerodynamic design procedure that uses neural networks to model the functional behavior of the objective function in design space has been developed. This method incorporates several improvements to an earlier method that employed a strategy called parameter-based partitioning of the design space in order to reduce the computational costs associated with design optimization. As with the earlier method, the current method uses a sequence of response surfaces to traverse the design space in search of the optimal solution. The new method yields significant reductions in computational costs by using composite response surfaces with better generalization capabilities and by exploiting synergies between the optimization method and the simulation codes used to generate the training data. These reductions in design optimization costs are demonstrated for a turbine airfoil design study where a generic shape is evolved into an optimal airfoil.

Rai, Man Mohan↗
NASA NTRS2018

Hybrid Reduced Order Model for N2-N2 Interactions for Application to Dissociation and Energy Transfer Processes

Recent work in the aerothermodynamics community has focused on the development of reduced-order models for thermo-chemical non-equilibrium which avoid the restrictive assumptions of multi-temperature models and the prohibitive cost associated with State-to-State (StS) models. In the present work, this is accomplished by lumping energy states together and assuming groups of states are roughly in equilibrium. As a result, the non-equilibrium behavior of a gas can be captured at a reduced computational cost from a full StS simulation. In this work, we present a hybrid grouping model for studying energy transfer and dissociation in a mixture of nitrogen molecules due to N2-N2 reactions. This is accomplished by making use of a grouping strategy informed by data from the N2-N StS kinetic data. However, due to the massive computational cost associated with constructing StS data for the N2-N2 system, the kinetic data for the hybrid grouping model are calculated using the quasi-classical trajectory (QCT) method by sampling states for trajectory within the groups. This general framework is called the Maximum-Entropy Quasi-Classical Trajectory (ME-QCT) method. The primary challenge associated with this method is that rates for reverse grouped reactions cannot be obtained through detailed balance at a group level, due to the variation of group internal temperatures. To construct the full model for N2-N2 grouped kinetics using the ME-QCT method, detailed balance is invoked at the microscopic level, allowing for the calculation of the full kinetic data from QCT. Results will be presented using the full ME-QCT model for the N2-N2 system in an isothermal and isochoric reactor simulation. In addition, simple CFD test cases for a one-dimensional standing shock and for a quasi-one-dimensional nozzle will be used for demonstration of the ME-QCT method. This method allows for the calculation of non-equilibrium behavior for the N2-N2 system without the prohibitive cost of a full StS simulation. Moreover, it enables the construction of a unified model for the dissociating and recombining non-equilibrium flows.

nonequilibrium modeling↗
DOE OSTI2024

Predicting Partial Atomic Charges in Metal–Organic Frameworks: An Extension to Ionic MOFs

Molecular simulation is an invaluable tool to predict and understand the usage of metal–organic frameworks (MOFs) for gas storage and separation applications. Accurate partial atomic charges, commonly obtained from density functional theory (DFT) calculations, are often required to model the electrostatic interactions between the MOF and adsorbates, especially when the adsorbates have dipole or quadrupole moments, such as water and CO 2 . Machine learning (ML) models have been previously employed to predict partial charges and avoid the computational cost associated with DFT calculations. However, previous ML models suffer from small training data sets, which limit their scope of application. In this work, we introduce two novel machine learning models, PACMOF2-neutral and PACMOF2-ionic, aimed at predicting the density-derived electrostatic and chemical (DDEC6) partial atomic charges for both neutral and ionic MOFs. These models not only yield DFT-level accuracy at a fraction of the computational cost but also demonstrate a remarkable improvement in prediction of adsorption, as validated with grand canonical Monte Carlo simulations. Furthermore, the robustness and fast computational time of the PACMOF2 models, along with their transferability to other porous materials such as covalent organic frameworks and zeolites, underscores their potential in high-throughput screening of MOFs for diverse applications.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A Comparative Study of Physics‐Informed and Data‐Driven Neural Networks for Compound Flood Simulation at River‐Ocean Interfaces: A Case Study of Hurricane Irene

Simulating compound flooding (CF) at the river-ocean interface within large-scale Earth System Models (ESMs) presents significant challenges due to complex interactions between river discharge, storm surge, and tides. This study assesses the comparative advantages of physics-informed and data-driven machine learning (ML) approaches for enhancing local ESM performance. We systematically compare data-driven neural network models (i.e., CNNs, U-Net, Long Short-Term Memory (LSTM), Gated Recurrent Unit), and physics-informed neural network (PINN) models, including vanilla PINN and a finite-difference-based PINN (FD-PINN). Specifically, FD-PINN is introduced to enhance computational efficiency, accelerating vanilla PINNs by ∼6.5 times while improving accuracy. To enhance data-driven model training, a new data-generation approach is developed to sample historical fluvial and coastal flood events, which ensures a robust data set for extreme event prediction. The models are evaluated using a realistic one-dimensional river domain extracted from an ESM's river mesh and the Hurricane Irene event as an independent test case. Results show that FD-PINN achieves accurate predictions with significantly reduced computational costs relative to vanilla PINNs. Among data-driven models, the best overall performance is achieved by a CNN-LSTM hybrid, which balances accuracy and efficiency. While a fully connected CNN (CNN-FC) provides the best accuracy, it incurs high computational cost. Architectures lacking strong temporal modeling tend to underperform on unseen events. These findings highlight the importance of sequence-aware designs for robust generalization. This study reveals the trade-offs between physics-informed and data-driven models and proposes an adaptive hybrid framework for integrating ML into ESMs to enhance local flood simulations.

Earth Systems Modeling↗
DOE OSTI2025

Multidimensional Modeling of Mixture Formation in a Hydrogen-Fueled Heavy-Duty Optical Engine With Direct Injection

Hydrogen (H 2 ), as a carbon-free fuel, is considered as one of the most promising solutions to reduce the carbon footprint of hard-to-decarbonize energy and transportation sectors. As such, hydrogen-fueled internal combustion engines (H 2 ICEs) have recently been receiving increasing attention, particularly in applications such as on-road/off-road heavy-duty transport and combined heat and power. The direct injection (DI) of gaseous hydrogen into the combustion chamber offers great potential for achieving high power density and high engine efficiency, while mitigating the risk of backfire and reducing pre-ignition. However, the numerical simulation of H 2 DI system remains a formidable challenge associated with the high computational cost of reproducing compressible supersonic flow and shocks in narrow injector passages and in near-nozzle regions. In general, there is a lack of well-established and validated practices for the modeling of high-pressure H 2 DI in large-bore engines. Here, to this end, this study focuses on computational fluid dynamics (CFD) modeling of the mixture formation process in a heavy-duty optical engine employing a medium-pressure H 2 DI system. Both large eddy simulations (LES) and Reynolds Averaged Navier–Stokes (RANS) simulations are performed and evaluated against optical data. Gaseous hydrogen is injected into the combustion chamber via a centrally located outward opening hollow-cone injector at a pressure of 40 bar. Simulations are carried out for two injection timings, namely, −120 and −60 °CA. The numerical predictions for H 2 distribution in different horizontal and vertical planes during the compression stroke are systematically compared against optical data obtained through planar laser-induced fluorescence (PLIF) measurements. Overall, the LES approach using the Dynamic Structure model is found to have good predictive capabilities for the early jet penetration in terms of length and shape, as well as the later H 2 distributions. However, the unsteady RANS approach with the renormalization group $k - ϵ$ model, which is widely used by industry to model heavy-duty ICEs, significantly underpredicts the H 2 mixing, even at similar mesh resolution to that used in LES. These results indicate that there is a need for the improvement of mixing submodels within the RANS approach when applied to H 2 DI simulations.

LES↗
NASA NTRSDate not supplied

Improving Multi-Model Trajectory Simulation Estimators using Model Selection and Tuning

Multi-model Monte Carlo methods have been demonstrated to be an efficient and accurate alternative to standard Monte Carlo (MC) in the model-based propagation of uncertainty in entry, descent, and landing (EDL) applications. These multi-model MC methods fuse predictions from low-fidelity models with the high-fidelity EDL model of interest to produce unbiased statistics with a fraction of the computational cost. The accuracy and efficiency of the multi-model MC methods are dependent upon the magnitude of correlations of the low-fidelity models with the high-fidelity model, but also upon the correlation amongst the low-fidelity models, and their relative computational cost. Because of this layer of complexity, the question of how to optimally select the set of low-fidelity models has remained open. In this work, methods for optimal model construction and tuning are investigated as a means to increase the speed and precision of trajectory simulation for EDL. Specifically, the focus is on the inclusion of low-fidelity model tuning within the sample allocation optimization that accompanies multi-model MC methods. Preliminary results indicate that low-fidelity model tuning can significantly improve efficiency and precision of trajectory simulations and provide an increased edge to multi-model MC methods when compared to standard MC. The challenges and potential benefits to exploring a fully iterative and comprehensive optimization strategy in future work are highlighted.

uncertainty quantification↗