Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical computation”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Efficient high-dimensional variational data assimilation with machine-learned reduced-order models

Abstract. Data assimilation (DA) in geophysical sciences remains the cornerstone of robust forecasts from numerical models. Indeed, DA plays a crucial role in the quality of numerical weather prediction and is a crucial building block that has allowed dramatic improvements in weather forecasting over the past few decades. DA is commonly framed in a variational setting, where one solves an optimization problem within a Bayesian formulation using raw model forecasts as a prior and observations as likelihood. This leads to a DA objective function that needs to be minimized, where the decision variables are the initial conditions specified to the model. In traditional DA, the forward model is numerically and computationally expensive. Here we replace the forward model with a low-dimensional, data-driven, and differentiable emulator. Consequently, gradients of our DA objective function with respect to the decision variables are obtained rapidly via automatic differentiation. We demonstrate our approach by performing an emulator-assisted DA forecast of geopotential height. Our results indicate that emulator-assisted DA is faster than traditional equation-based DA forecasts by 4 orders of magnitude, allowing computations to be performed on a workstation rather than a dedicated high-performance computer. In addition, we describe accuracy benefits of emulator-assisted DA when compared to simply using the emulator for forecasting (i.e., without DA). Our overall formulation is denoted AIEADA (Artificial Intelligence Emulator-Assisted Data Assimilation).

58 GEOSCIENCES↗
DOE OSTI2022

High-Fidelity Simulations of Supercritical CO2 Based Oxy-Combustion with Non-Ideal Equation of State

The supercritical carbon dioxide (sCO2) Allam-Fetvedt cycle employs high-temperature oxy-combustion using sCO2 as the working fluid, leading to a unique and challenging environment for materials. In this cycle, pressurized gaseous fuel is combusted in the presence of a hot oxidant flow containing a mixture of CO2 and oxygen and a hot CO2 diluent recycle stream at approximately 300 bar under lean combustion conditions. We present high-fidelity reacting simulations of this oxy-combustor environment and compare the results when performing simulations with ideal and non-ideal equations of state. By doing so, we identify if the combustor behavior at the regime of interest is sensitive enough to the equation of state to justify the added computational cost incurred with a non-ideal equation of state.

equation of state↗
DOE OSTI2023

Symmetric Random Butterfly Transform (SRBT) Based Preconditioner

Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.

interior point optimization↗
DOE OSTI2023

Dyson maps and unitary evolution for Maxwell equations in tensor dielectric media

The propagation and scattering of electromagnetic waves in dielectric media is of theoretical and experimental interest in a wide variety of fields. An understanding of observational results generally requires a numerical solution of Maxwell equations—usually implemented on conventional computers using sophisticated numerical algorithms. In recent years, advances in quantum information science and in the development of quantum computers have piqued curiosity about taking advantage of these resources for an alternate numerical approach to Maxwell equations. This requires a reformulation of the classical Maxwell equations into a form suitable for quantum computers which, unlike conventional computers, are limited to unitary operations. In this paper, a unitary framework is developed for the propagation of electromagnetic waves in a spatially inhomogeneous, passive, nondispersive, and anisotropic dielectric medium. For such a medium, generally, the evolution operator in the combined Faraday-Ampere equations is not unitary. There are two steps needed to convert this equation into a unitary evolution equation. In the first step, a weighted Hilbert space is formulated in which the generator of dynamics is a pseudo-Hermitian operator. In the second step, a Dyson map is constructed which maps the weighted-physical-Hilbert space to the original Hilbert space. Furthermore, the resulting evolution equation for the electromagnetic wave fields is unitary. Utilizing the framework developed in these steps, a unitary evolution equation is derived for electromagnetic wave propagation in a uniaxial dielectric medium. The resulting form is suitable for quantum computing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Should We Conserve Entropy or Energy when Computing CAPE with Mixed-Phase Precipitation Physics?

Abstract The rapidly increasing resolution of global atmospheric reanalysis and climate model datasets necessitates finding methods for computing convective available potential energy (CAPE) both efficiently and accurately. To this end, this article compares two common methods for computing CAPE which conserve either energy or entropy. Inaccuracies in these computations arise from both physical and numerical errors. For instance, computing CAPE with entropy conserved results in physical errors from nonequilibrium phase transitions but minimizes numerical errors because solutions are analytic at each height. In contrast, computing CAPE with energy conserved avoids these physical errors, but accumulates numerical errors that are grid-resolution-dependent because the numerical integration of a differential equation is required. Analysis of CAPE computed with large databases of soundings from the tropical Amazon and midlatitude storm environments shows that physical errors from the entropy method are typically 1%–3% as large as CAPE, which is comparable to the numerical errors from conserving energy with grid spacing of 25 and 250 m using explicit first-order and second-order integration schemes, respectively. Errors in entropy-based CAPE calculations are also insensitive to vertical grid spacing, in contrast to energy-based calculations whose error strongly scales with the grid spacing. It is shown that entropy-based methods are advantageous when intercomparing datasets with differing vertical resolution because they produce accurate and reasonably fast results that are insensitive to grid resolution, whereas a second-order energy-based method is advantageous when analyzing data with a consistent vertical resolution because of its superior computational efficiency. Significance Statement Convective available potential energy (CAPE) is a measure of instability in the atmosphere that helps forecasters and researchers understand when and where thunderstorms will form. The purpose of this article is to identify the most efficient and accurate methods for computing CAPE. Two methods are considered here, one that relates to the entropy (a measure of thermodynamic disorder) of an air parcel and one that relates to the energy of an air parcel. Results indicate that the entropy method is most accurate and insensitive to the resolution of the data used for the calculation (which can vary considerably), whereas the energy method uses the least computation time.

Peters, John M.↗
DOE OSTI2024

Learning a general model of single phase flow in complex 3D porous media

Modeling effective transport properties of 3D porous media, such as permeability, at multiple scales is challenging as a result of the combined complexity of the pore structures and fluid physics—in particular, confinement effects which vary across the nanoscale to the microscale. While numerical simulation is possible, the computational cost is prohibitive for realistic domains, which are large and complex. Although machine learning (ML) models have been proposed to circumvent simulation, none so far has simultaneously accounted for heterogeneous 3D structures, fluid confinement effects, and multiple simulation resolutions. By utilizing numerous computer science techniques to improve the scalability of training, we have for the first time developed a general flow model that accounts for the pore-structure and corresponding physical phenomena at scales from Angstrom to the micrometer. Using synthetic computational domains for training, our ML model exhibits strong performance (R 2 = 0.9) when tested on extremely diverse real domains at multiple scales.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Learning a General Model of Single Phase Flow in Complex 3D Porous Media

Modeling effective transport properties of 3D porous media, such as permeability, at multiple scales is challenging as a result of the combined complexity of the pore structures and fluid physics—in particular, confinement effects which vary across the nanoscale to the microscale. While numerical simulation is possible, the computational cost is prohibitive for realistic domains, which are large and complex. Although machine learning (ML) models have been proposed to circumvent simulation, none so far has simultaneously accounted for heterogeneous 3D structures, fluid confinement effects, and multiple simulation resolutions. By utilizing numerous computer science techniques to improve the scalability of training, we have for the first time developed a general flow model that accounts for the pore-structure and corresponding physical phenomena at scales from Angstrom to the micrometer. Using synthetic computational domains for training, our ML model exhibits strong performance (R 2 = 0.9) when tested on extremely diverse real domains at multiple scales.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2023

Insights from high-fidelity modeling of industrial rotary bell atomization

The global automotive industry sprayed over 2.6 billion liters of paint in 2018, much of which through electrostatic rotary bell atomization, a highly complex process involving the fluid mechanics of rapidly rotating thin films tearing apart into micrometer-thin filaments and droplets. Coating operations account for 65% of the energy usage in a typical automotive assembly plant, representing 10,000s of gigawatt-hours each year in the United States alone. Optimization of these processes would allow for improved robustness, reduced material waste, increased throughput, and significantly reduced energy usage. Here, we introduce a high-fidelity mathematical and algorithmic framework to analyze rotary bell atomization dynamics at industrially relevant conditions. Our approach couples laboratory experiment with the development of robust non-Newtonian fluid models; devises high-order accurate numerical methods to compute the coupled bell, paint, and gas dynamics; and efficiently exploits high-performance supercomputing architectures. These advances have yielded insight into key dynamics, including i) parametric trends in film, sheeting, and filament characteristics as a function of fluid rheology, delivery rates, and bell speed; ii) the impact of nonuniform film thicknesses on atomization performance; and iii) an understanding of spray composition via primary and secondary atomization. These findings result in coating design principles that are poised to improve energy- and cost-efficiency in a wide array of industrial and manufacturing settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Reflection and transmission of electromagnetic pulses at a planar dielectric interface -- theory and quantum lattice simulations

There is considerable interest in the application of quantum information science to advance computations in plasma physics. A particular point of curiosity is whether it is possible to take advantage of quantum computers to speed up numerical simulations relative to conventional computers. Many of the topics in fusion plasma physics are classical in nature. In order to implement them on quantum computers it will require couching a classical problem in the language of quantum mechanics. Electromagnetic waves are routinely used in fusion experiments to heat a plasma or to generate currents in the plasma. The propagation of electromagnetic waves is described by Maxwell equations with an appropriate description of the plasma as a dielectric medium. Before advancing to the tensor dielectric of a magnetized plasma, this paper considers electromagnetic wave propagation in a one-dimensional inhomogeneous scalar dielectric. The classic theory of scattering of plane electromagnetic waves at a planar interface, separating two different dielectric media, leads to Fresnel equations for reflection and transmission coefficients. In contrast to plane waves, this paper is on the reflection and transmission of a spatially confined electromagnetic pulse. Following an analytical formulation for the scattering of a Gaussian pulse, it is deduced that the maximum transmission coefficient for a pulse is $\sqrt{n_2/n_1}$ times that for a plane wave; the incident and transmitted pulses propagating in dielectric media with refractive indices $n_1$ and $n_2$, respectively. The analytical theory is complemented by numerical simulations using a quantum lattice algorithm for Maxwell equations. The algorithm, based on the Riemann-Silberstein-Weber representation of the electromagnetic fields and expressed in term of qubits, is an interleaved sequence of entangling operators at each lattice site and unitary streaming operators which transmit information from one site to an adjacent lattice site. Besides substantiating results from the theory for Gaussian pulses, numerical simulations show their validity for non-Gaussian pulses. Apart from their time-asymptotic forms, the simulations display an interplay between the incident, reflected, and transmitted pulses in the vicinity of the transition region between two dielectric media.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Optimal design of chemoepitaxial guideposts for the directed self-assembly of block copolymer systems using an inexact Newton algorithm

Directed self-assembly (DSA) of block copolymers (BCPs) is one of the most promising developments in the cost-effective production of nanoscale devices. The process makes use of the natural tendency for BCP melts to form nanoscale structures upon phase separation. The phase separation can be directed through the use of chemically patterned substrates to promote the formation of morphologies that are essential to the production of semiconductor devices. Moreover, the design of substrate pattern can be formulated as an optimization problem for which we seek optimal substrate designs that effectively produce given target morphologies. In this paper, we adopt a phase field model given by a nonlocal Cahn–Hilliard partial differential equation (PDE) based on the minimization of the Ohta–Kawasaki free energy, and present an efficient PDE-constrained optimization framework for the optimal design problem. The design variables are the locations of circular- or strip-shaped guiding posts that are used to model the substrate chemical pattern. To solve the ensuing optimization problem, we propose a variant of an inexact Newton conjugate gradient algorithm tailored to this problem. Additionally, we demonstrate the effectiveness of our computational strategy on numerical examples that span a range of target morphologies. Owing to our second-order optimizer and fast state solver, the numerical results demonstrate five orders of magnitude reduction in computational cost over previous work. The efficiency of our framework and the fast convergence of our optimization algorithm enable us to rapidly solve the optimal design problem in not only two, but also three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗
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↗