SEARCH · Engineering Papers

Results for “computational costs”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Stochastic evaluation of four-component relativistic second-order many-body perturbation energies: A potentially quadratic-scaling correlation method

A second-order many-body perturbation correction to the relativistic Dirac-Hartree-Fock energy is evaluated stochastically by integrating 13-dimensional products of four-component spinors and Coulomb potentials. The integration in the real space of electron coordinates is carried out by the Monte Carlo (MC) method with the Metropolis sampling, whereas the MC integration in the imaginary-time domain is performed by the inverse-CDF (cumulative distribution function) method. The computational cost to reach a given relative statistical error for spatially compact but heavy molecules is observed to be no worse than cubic and possibly quadratic with the number of electrons or basis functions. This is a vast improvement over the quintic scaling of the conventional, deterministic second-order many-body perturbation method. The algorithm is also easily and efficiently parallelized with demonstrated 92% strong scalability going from 64 to 4096 processors for a fixed job size.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2023

Simulating molecular polaritons in the collective regime using few-molecule models

The study of molecular polaritons beyond simple quantum emitter ensemble models (e.g., Tavis–Cummings) is challenging due to the large dimensionality of these systems and the complex interplay of molecular electronic and nuclear degrees of freedom. This complexity constrains existing models to either coarse-grain the rich physics and chemistry of the molecular degrees of freedom or artificially limit the description to a small number of molecules. In this work, we exploit permutational symmetries to drastically reduce the computational cost of ab initio quantum dynamics simulations for large N . Furthermore, we discover an emergent hierarchy of timescales present in these systems, that justifies the use of an effective single molecule to approximately capture the dynamics of the entire ensemble, an approximation that becomes exact as N → ∞. We also systematically derive finite N corrections to the dynamics and show that addition of k extra effective molecules is enough to account for phenomena whose rates scale as 𝒪( N − k ). Based on this result, we discuss how to seamlessly modify existing single-molecule strong coupling models to describe the dynamics of the corresponding ensemble. We call this approach collective dynamics using truncated equations (CUT-E), benchmark it against well-known results of polariton relaxation rates, and apply it to describe a universal cavity-assisted energy funneling mechanism between different molecular species. Beyond being a computationally efficient tool, this formalism provides an intuitive picture for understanding the role of bright and dark states in chemical reactivity, necessary to generate robust strategies for polariton chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

DEM simulation of the compression of crushable sand: does the initial particle shape matter?

Advances in DEM modeling, combined with high-resolution X-ray tomography, opened the way for computer models based on virtual replicas of the particles which preserve nearly all facets of their geometry. This leads to simulation advantages, but also high computational costs. Here we tackle a question stemming from this trend: how accurate should particle models be to ensure accuracy? We address this question for the case of the compression of crushable sand. LS-DEM was used to generate three models of Ottawa sand (exact replicas, ellipsoids, and spheres) from digital images of its grains. Compression-induced crushing was simulated for all sets by tracking evolving size and shape distribution. The results confirm that exact replicas provide the closest match of the measurements. However, intermediate degrees of rendering (e.g. ellipsoids preserving volume and aspect ratio of the real grains) led to satisfactory results only marginally different from those of exact replicas. In conclusion, these findings provide an example of the protocols that may be followed to identify the optimal degree of particle approximation which should be regarded as mandatory to achieve a conscious, sustainable use of computational resources.

58 GEOSCIENCES↗

DOE OSTI2023

Computational fluid dynamics investigations of flow, heat transfer, and oxidation in heat recovery steam generator

Modern heat recovery steam generators (HRSGs) operate at elevated temperatures, leading to the formation of oxides inside the tubes of heat exchangers (HXs). This oxide growth reduces the heat recovery efficiency. Moreover, after reaching a certain critical thickness, some oxide scales detach from the tube surface (exfoliation), causing erosion damage to the components downstream. Predicting the metal temperature distribution and associated oxide thickness in the HXs of an HRSG can aid in mitigating these problems. Here, a computational fluid dynamics (CFD) model was developed within the commercial code STAR-CCM+ for the prediction of fluid flow, conjugate heat transfer, and associated oxidation in HRSGs. Moreover, a new Porous Media Model (PMM) method was developed to model the fin effect on the heat transfer in HX, which can substantially reduce the prohibitive computational costs of fin meshes. The developed CFD model was used to conduct a high-fidelity simulation of a real-scale HRSG to investigate flow, heat transfer, and oxide growth. The calculated oxide thickness on different tubes can be used to identify HX regions that require oxide-resistant coatings to prevent exfoliation and ensuing damages. Furthermore, this CFD framework can serve as a reference for future studies that intend to model and investigate high-temperature oxidation in HXs used for any applications.

42 ENGINEERING↗

DOE OSTI2022

Finite Element Modeling of Diffusion in Fractured Porous Media by Using Hierarchical Material Properties

Abstract Fractured porous media challenge modeling approaches due to high computational costs and excessive mesh refinement imposed by the extreme scale variability of fractures and the heterogeneity of the surrounding porous rock. To overcome such difficulties, we utilize the hierarchical finite element method ( Hi ‐FEM) that has been developed previously to simulate the electrical potential distribution in complex geologic environments. The method employs the hierarchical basis functions in classical finite element analysis to enable representation of material properties on each dimensional component of a given 3D unstructured finite element, thereby inherently allowing for interactions at the boundary between fracture and a host rock. In this study, we extend its application to transient fluid flow and heat conduction in the Laplace domain. Time‐domain flow solutions are obtained by numerical inverse Laplace transform. We evaluate the accuracy of the method using different flow models and demonstrate its robustness for large‐scale, rock mass models featuring complex fracture networks. Moreover, for the computation of nodal Darcian velocity fields in fractured porous media where the fractures are represented as 2D features, a new approach that employs the Yeh's Galerkin model for both volume and facet elements is proposed. Results show that Hi ‐FEM can produce accurate flow solutions for fractured porous media without any need of coupling or transfer mechanism while still being computationally economical and numerically robust, even for large‐scale simulations.

Beskardes, G. D.↗

DOE OSTI2024

Evidential Deep Learning: Enhancing Predictive Uncertainty Estimation for Earth System Science Applications

Abstract Robust quantification of predictive uncertainty is a critical addition needed for machine learning applied to weather and climate problems to improve the understanding of what is driving prediction sensitivity. Ensembles of machine learning models provide predictive uncertainty estimates in a conceptually simple way but require multiple models for training and prediction, increasing computational cost and latency. Parametric deep learning can estimate uncertainty with one model by predicting the parameters of a probability distribution but does not account for epistemic uncertainty. Evidential deep learning, a technique that extends parametric deep learning to higher-order distributions, can account for both aleatoric and epistemic uncertainties with one model. This study compares the uncertainty derived from evidential neural networks to that obtained from ensembles. Through applications of the classification of winter precipitation type and regression of surface-layer fluxes, we show evidential deep learning models attaining predictive accuracy rivaling standard methods while robustly quantifying both sources of uncertainty. We evaluate the uncertainty in terms of how well the predictions are calibrated and how well the uncertainty correlates with prediction error. Analyses of uncertainty in the context of the inputs reveal sensitivities to underlying meteorological processes, facilitating interpretation of the models. The conceptual simplicity, interpretability, and computational efficiency of evidential neural networks make them highly extensible, offering a promising approach for reliable and practical uncertainty quantification in Earth system science modeling. To encourage broader adoption of evidential deep learning, we have developed a new Python package, Machine Integration and Learning for Earth Systems (MILES) group Generalized Uncertainty for Earth System Science (GUESS) (MILES-GUESS) ( https://github.com/ai2es/miles-guess ), that enables users to train and evaluate both evidential and ensemble deep learning. Significance Statement This study demonstrates a new technique, evidential deep learning, for robust and computationally efficient uncertainty quantification in modeling the Earth system. The method integrates probabilistic principles into deep neural networks, enabling the estimation of both aleatoric uncertainty from noisy data and epistemic uncertainty from model limitations using a single model. Our analyses reveal how decomposing these uncertainties provides valuable insights into reliability, accuracy, and model shortcomings. We show that the approach can rival standard methods in classification and regression tasks within atmospheric science while offering practical advantages such as computational efficiency. With further advances, evidential networks have the potential to enhance risk assessment and decision-making across meteorology by improving uncertainty quantification, a longstanding challenge. This work establishes a strong foundation and motivation for the broader adoption of evidential learning, where properly quantifying uncertainties is critical yet lacking.

Schreck, John S.↗

DOE OSTI2025

Effect of Surface Roughness on Dynamic Stall in Pitching Motion

Dynamic stall plays a critical role in determining the performance and stability of a wide range of fluid-dynamics systems in various engineering applications. This unsteady aerodynamic phenomenon is particularly significant for maneuvering aircraft wings, jet aircraft subjected to gust encounters, helicopter rotor blades, and wind turbine blades [1–3]. The prediction of the dynamic stall vortex (DSV) is challenging due to factors such as unsteady aerodynamics, three-dimensional (3-D) effects, turbulence and flow separation, incoming gust, and surface impact effects [4–6]. Hence, advanced computational techniques and modeling approaches in computational fluid dynamics (CFD) would be required to enhance the accuracy and reliability of DSV predictions in dynamic stall scenarios. In the past, Batther and Lee [7] employed delayed detached eddy simulations (DDES) to understand the flow physics associated with the onset of dynamic stall. Their approach demonstrated that DDES achieves results comparable to those obtained from large-eddy simulations at a reduced computational cost. In another study, Khalifa et al. [8] examined the 3-D aspects of dynamic stall on a NACA 0012 airfoil using DES solvers. In conclusion, the findings underlined the superiority of 3-D simulations over two-dimensional approaches, particularly in predicting the lift coefficient values and capturing dynamic stall stages more precisely.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Programmable simulations of molecules and materials with reconfigurable quantum processors

Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2022

Stochastic Learning Approach for Binary Optimization: Application to Bayesian Optimal Design of Experiments

Here, we present a novel stochastic approach to binary optimization suited for optimal experimental design (OED) for Bayesian inverse problems governed by mathematical models such as partial differential equations. The OED utility function, namely, the regularized optimality criterion, is cast into a stochastic objective function in the form of an expectation over a multivariate Bernoulli distribution. The probabilistic objective is then solved by using a stochastic optimization routine to find an optimal observational policy. This formulation (a) is generally applicable to binary optimization problems with soft constraints and is ideal for OED and sensor placement problems; (b) does not require differentiability of the original objective function (e.g., a utility function in OED applications) with respect to the design variable, and thus it enables direct employment of sparsity-enforcing penalty functions such as $\ell_0$, without needing to utilize a continuation procedure or apply a rounding technique; (c) exhibits much lower computational cost than traditional gradient-based relaxation approaches; and (d) can be applied to both linear and nonlinear OED problems with proper choice of the utility function. The proposed approach is analyzed from an optimization perspective with detailed convergence analysis of the optimization approach and is also analyzed from a machine learning perspective with correspondence to policy gradient reinforcement learning. The approach is demonstrated numerically by using an idealized two-dimensional Bayesian linear inverse problem and validated by extensive numerical experiments carried out for sensor placement in a parameter identification setup.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Denoising of imaginary time response functions with Hankel projections

Imaginary-time response functions of finite-temperature quantum systems are often obtained with methods that exhibit stochastic or systematic errors. Reducing these errors comes at a large computational cost—in quantum Monte Carlo simulations, the reduction of noise by a factor of two incurs a simulation cost of a factor of four. In this paper, we relate certain imaginary-time response functions to an inner product on the space of linear operators on Fock space. We then show that data with noise typically does not respect the positive definiteness of its associated Gramian. The Gramian has the structure of a Hankel matrix. As a method for denoising noisy data, we introduce an alternating projection algorithm that finds the closest positive definite Hankel matrix consistent with noisy data. We test our methodology at the example of fermion Green's functions for continuous-time quantum Monte Carlo data and show remarkable improvements of the error, reducing noise by a factor of up to 20 in practical examples. We argue that Hankel projections should be used whenever finite-temperature imaginary-time data of response functions with errors is analyzed, be it in the context of quantum Monte Carlo, quantum computing, or in approximate semianalytic methodologies. Published by the American Physical Society 2024

Yu, Yang (ORCID:0000000186178878)↗

DOE OSTI2020

Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick

An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.

42 ENGINEERING↗

DOE OSTI2021

Dynamic Catalysis Fundamentals: I. Fast calculation of limit cycles in dynamic catalysis

Dynamic catalysis—the forced oscillation of catalytic reaction coordinate potential energy surfaces (PES)—has recently emerged as a promising method for the acceleration of heterogeneously-catalyzed reactions. Theoretical study of enhancement of rates and supra-equilibrium product yield via dynamic catalysis has, to-date, been severely limited by onerous computational demands of forward integration of stiff, coupled ordinary differential equations (ODEs) that are necessary to quantitatively describe periodic cycling between PESs. Here, we establish a new approach that reduces, by ≳108×, the computational cost of finding the time-averaged rate at dynamic steady state (i.e. the limit cycle for linear and nonlinear systems of kinetic equations). Our developments are motivated by and conceived from physical and mathematical insight drawn from examination of a simple, didactic case study for which closed-form solutions of rate enhancement are derived in explicit terms of periods of oscillation and elementary step rate constants. Generalization of such closed-form solutions to more complex catalytic systems is achieved by introducing a periodic boundary condition requiring the dynamic steady state solution to have the same periodicity as the kinetic oscillations and solving the corresponding differential equations by linear algebra or Newton-Raphson-based approaches. The methodology is well-suited to extension to non-linear systems for which we detail the potential for multiple solutions or solutions with different periodicities. For linear and non-linear systems alike, the acute decrement in computational expense enables rapid optimization of oscillation waveforms and, consequently, accelerates understanding of the key catalyst properties that enable maximization of reaction rates, conversions, and selectivities during dynamic catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

A discontinuous Galerkin spectral element method for compressible reacting flows

High-order methods have recently been shown to be an effective tool for high-fidelity flow computations like direct numerical simulations and large-eddy simulations because of their strong balance between accuracy and computational cost. In this work, a high-order discontinuous Galerkin spectral element method (DGSEM) is developed to solve the chemically reacting Navier-Stokes equations. To handle the disparate length and time scales associated with these equations, we develop a novel method which combines the spectral accuracy of the SEM with the flexibility of the DG approach. The framework, implemented in the spectral element code Nek5000, is well suited to capture turbulence in smooth regions of the flow, while maintaining numerical stability in the presence of shocks. An entropy-residual based artificial viscosity is added to smooth shocked regions of flow, and a positivity-preserving limiter is implemented to suppress non-physical oscillations. These enhancements support the numerical stability of the hydrodynamic sub-step, which is decoupled from the chemistry integration through a second-order operator splitting method. Here, a series of smooth and discontinuous validation cases are presented in increasing physical and computational complexity for both inviscid and viscous flows. In particular, simulations of canonical one-dimensional and two-dimensional detonations are performed, and the high-order numerical results are validated against available literature data. Additional validation studies are carried out for classical three-dimensional numerical simulations of incompressible and compressible turbulent flows.

Compressible reacting flows↗

DOE OSTI2024

Mathematical Modeling of Multi-Phenomena Anisotropic Systems: Ejection of Primary Aerosols during the Fast Pyrolysis of Biomass

This study introduces a novel particle model for biomass fast pyrolysis, incorporating an anisotropic cylindrical particle to address mass and energy transport coupled with aerosol ejection, which previous models have overlooked. The main contribution lies in developing a model that considers aerosol generation in anisotropic cylindrical particles for the first time, addressing bubbling dynamics and bursting within the liquid phase. The population balance equation describes bubble dynamics and aerosol formation, capturing phenomena like nucleation, growth, coalescence, and bursting. The model employs the method of moments with bubble volume as an internal variable, substantially reducing computational costs by eliminating dependence on this variable. Results highlight the significant impact of anisotropy and particle size on aerosol ejection: smaller, less elongated particles experience faster heating, quicker conversion, and the increased accumulation of the liquid intermediate phase. Specifically, 1 mm diameter particles yield higher concentrations of metaplast and bio-oil aerosols, exceeding 15%, compared to concentrations below 11% for 3 mm particles. This model provides insights into aerosol structure (volume, surface area), aiding in understanding aerosol reactivity at the reactor scale.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Mitigating spectral bias in neural operators via high-frequency scaling for physical systems

Neural operators have emerged as powerful surrogates for modeling complex physical problems. However, they suffer from spectral bias making them oblivious to high-frequency modes, which are present in multiscale physical systems. Therefore, they tend to produce over-smoothed solutions, which is particularly problematic in modeling turbulence and for systems with intricate patterns and sharp gradients such as multi-phase flow systems. In this work, we introduce a new approach named high-frequency scaling (HFS) to mitigate spectral bias in convolutional-based neural operators. By integrating HFS with proper variants of UNet, we demonstrate a higher prediction accuracy by mitigating spectral bias in single and two-phase flow problems. Unlike Fourierbased techniques, HFS is directly applied to the latent space, thus eliminating the computational cost associated with the Fourier transform. Additionally, we investigate alternative spectral bias mitigation through a diffusion model conditioned on neural operators. While the diffusion model integrated with the standard neural operator may still suffer from significant errors, these errors are substantially reduced when the diffusion model is integrated with a HFS-enhanced neural operator.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

PyApprox: Enabling efficient model analysis

PyApprox is a Python-based one-stop-shop for probabilistic analysis of scientific numerical models. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent the most popular methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. Simple interfaces are provided for the most commonly-used algorithms to limit a user’s need to tune the various hyper-parameters of each algorithm. However, more advanced work flows that require customization of hyper-parameters is also supported. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of different algorithms for a wide range of model analyses. This paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in ground water.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A Blockchain-Enabled Sustainable Safety Management Framework for Connected Vehicles

The notion of an intelligent transportation system (ITS) aims to boost the performance of transportation networks, which has gained more and more traction in both academic and commercial circles. ITS is a constantly evolving vision that combines cutting-edge transportation approaches with new information, communication, computers, and other technology. ITS should discover consequence routes to enhance the sustainability, safety, and trustworthiness of the entire transportation system utilizing emerging technologies. In this paper, a sustainable safety management framework for connected vehicles is proposed by integrating blockchain. It introduces smart transportation equipment called an AI-enabled vehicle smart device (AVSD) for vehicular communications. AVSD can reduce energy consumption by decreasing the computational costs in vehicular communications. Smart contracts are used to identify vehicles automatically and establish secure communication among vehicles and emergency service stations (ESSs) like hospitals, police stations, and fire stations. The experiment results show that the proposed framework provides a communication environment for sustainable safety and security using the introduced smart transportation device. In conclusion, the proposed blockchain-enabled sustainable safety management framework has the potential to improve safety and sustainability in the transportation industry by creating a secure, decentralized, and transparent platform for managing safety data and promoting safe and sustainable driving behaviors.

42 ENGINEERING↗

DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗