Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical approximations”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2021

Pairing correlations in the cuprates: A numerical study of the three-band Hubbard model

We study the three-band Hubbard model for the copper oxide plane of the high-temperature superconducting cuprates using determinant quantum Monte Carlo and the dynamical cluster approximation (DCA) and provide a comprehensive view of the pairing correlations in this model using these methods. Specifically, we compute the pair-field susceptibility and study its dependence on temperature, doping, interaction strength, and charge-transfer energy. Using the DCA, we also solve the Bethe-Salpeter equation for the two-particle Green's function in the particle-particle channel to determine the transition temperature to the superconducting phase on smaller clusters. Our calculations reproduce many aspects of the cuprate phase diagram and indicate that there is an “optimal” value of the charge-transfer energy for the model where T c is largest. Finally, these results have implications for our understanding of superconductivity in both the cuprates and other doped charge-transfer insulators.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Massively parallel axisymmetric fluid model for streamer discharges

A highly parallelizable fluid plasma simulation tool based upon the first-order drift-diffusion equations is discussed. Atmospheric pressure plasmas have densities and gradients that require small element sizes in order to accurately simulate the plasm resulting in computational meshes on the order of millions to tens of millions of elements for realistic size plasma reactors. To enable simulations of this nature, parallel computing is required and must be optimized for the particular problem. Here, a finite-volume, electrostatic drift-diffusion implementation for low-temperature plasma is discussed. The implementation is built upon the Message Passing Interface (MPI) library in C++ using Object Oriented Programming. The underlying numerical method is outlined in detail and benchmarked against simple streamer formation from other streamer codes. Electron densities, electric field, and propagation speeds are compared with the reference case and show good agreement. Convergence studies are also performed showing a minimal space step of approximately 4 μm required to reduce relative error to below 1% during early streamer simulation times and even finer space steps are required for longer times. Additionally, strong and weak scaling of the implementation are studied and demonstrate the excellent performance behavior of the implementation up to 100 million elements on 1024 processors. Lastly, different advection schemes are compared for the simple streamer problem to analyze the influence of numerical diffusion on the resulting quantities of interest.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Data-driven reduced-order models for port-Hamiltonian systems with operator inference

Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Magnus method for electronic structure calculations at extreme conditions

We present the application of Magnus based methods to the solution of first order coupled ordinary differential equations in High Energy Density (HED) physics applications. Our focus is on the application to quantum mechanical methods, specifically on the solution of the radial Dirac equation for real and complex energies. HED applications require accurate solutions across a wide range of spatial and energy domains, including regimes where the solutions exhibit pronounced oscillatory behavior. Such cases pose significant computational challenges. We demonstrate that Magnus-based integrators can efficiently and accurately address these challenges. We discuss the implementation of the Magnus method for the solution of the radial Dirac equation, including practical considerations such as the evaluation of matrix exponentials, numerical integration, error estimation, and adaptive step size control. We also discuss the application of these methods to complex energy Green’s function techniques and the efficient approximation of integrals of the solutions relevant to HED electronic structure calculations. Here, we demonstrate the accuracy and robustness of the resulting method in applications to the free-particle case, for which analytic solutions are available for comparison, as well as the challenging case of gold at HED conditions.

general physics↗
DOE OSTI2022

Efficient hybrid explicit-implicit learning for multiscale problems

Splitting method is a powerful method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. Here, in this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. We propose a machine learning assisted splitting scheme which improves the efficiency of the scheme meanwhile preserves the accuracy. We consider a recently introduced multiscale splitting algorithms, where the multiscale problem is solved on a coarse grid. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. This splitting concept allows identifying degrees of freedom that need implicit treatment. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation of the splitting scheme successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection between them. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem which approximates the target. Our machine learning model can incorporate and encode the given information from two different problems and then solve the target problems. We conduct four numerical examples and the results show that our method is stable and accurate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An investigation of Newton-Sketch and subsampled Newton methods

Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large. In this work, we study two forms of sketching that perform dimensionality reduction in data space: Hessian subsampling and randomized Hadamard transformations. Each has its own advantages, and their relative tradeoffs have not been investigated in the optimization literature. Additionally, our study focuses on practical versions of the two methods in which the resulting linear systems of equations are solved approximately, at every iteration, using an iterative solver. The advantages of using the conjugate gradient method vs. a stochastic gradient iteration are revealed through a set of numerical experiments, and a complexity analysis of the Hessian subsampling method is presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Fast calculation of diffraction patterns from an ensemble of aligned molecules

We report an algorithm to calculate electron diffraction patterns for molecules with anisotropic angular distribution, which is significantly faster than existing methods. The algorithm uses a transform to convert the molecular orientation distribution, which is a function of three Euler angles, to the atom-pair distribution functions which depend on the polar and azimuthal angles. The diffraction signal can then be calculated from the atom-pair distributions. We demonstrate the computation method numerically by calculating electron diffraction patterns for a symmetric top molecule (trifluoroiodomethane) and an asymmetric top molecule (formaldehyde) and show that it reduces the calculation time by approximately two orders of magnitude compared to the standard brute-force method. Here, the method can also be applied to the calculation of x-ray diffraction patterns.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Primordial black holes from bubble collisions during a first-order phase transition

We study the possibility of production of primordial black holes (PBHs) from bubble collisions during a first-order phase transition. While typical colliding bubbles are small and irrelevant for PBH production, we find that those that can produce PBHs must have a macroscopically thick fluid shell and have been born much before the typical nucleation time. Particularly large uncertainties arise from an exponential sensitivity of the nucleation rate on the required duration of bubble growth which depends on the details of the collisions and the evolution of the spacetime metric toward the end of the phase transition. We introduce a few parameters to be obtained from future numerical simulation to represent those unknowns, and estimate the PBH abundance in an Abelian Higgs benchmark model and show that it can be significant. We predict an approximately monochromatic PBH mass spectrum, and find regions in the parameter space where the PBHs can constitute entire dark matter or even overclose the Universe. Our result thus shows that models with a first-order phase transition can be constrained by overabundant PBHs or null results of other PBH searches. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Sensitivity Analysis and Effective Parametrization of PEM Fuel Cell Models

The cost of proton-exchange-membrane fuel cells (PEMFCs) remains a major hurdle in large-scale commercialization of this technology. To improve their performance and reduce cost, novel materials and electrode designs are continuously envisioned, e.g., non-PGM catalyst layers, ultra-thin Pt/Pt-Ni based catalyst layers, structured ionomer arrays or NSTF catalyst layers.1 Understanding the impact of these improvement strategies can be extremely time and cost intensive due to complex physical phenomena and large design space. We have previously developed a PEMFC modeling framework2 which has been a time and cost effective tool for understanding and optimizing the complex multi-physics phenomena within PEMFCs; however, several of the cell parameters used in the modeling have large spread in measured data.3 Furthermore, several transport parameters such as water adsorption kinetics have not been accurately measured and the approximations are spread over several orders of magnitude. These uncertainties cause problems in ascertaining accuracy of the modeling approach and they reduce the predictive power of the numerical models. The aim of this work is to identify the sensitivity of PEFC numerical model outputs to various input parameters. The previously in-house developed MEA modeling framework2 is used for PEMFC modeling. The sensitivity of the model outputs with respect to inputs parameters is obtained by analyzing the condition numbers for different output-input pairs at varying operating conditions. An example of the sensitivity analysis is shown in Figure 1. The condition numbers are obtained for the entire possible range of input parameters at varying operating conditions to identify the most crucial parameters of the PEMFC model. Based on our preliminary analysis, parameters related to kinetics (exchange current density and ECSA) and heat/water management in electrodes and ionomer (ionomer fraction, thermal conductivity) are most crucial. One of the major goals of this work is to identify the most crucial set of parameters towards which the model shows maximum sensitivity. This will guide future experimentalists to measure these properties with higher accuracy. Furthermore, the sensitivity analysis will also enable us to optimize the PEMFC performance by selectively targeting the most sensitive parameters and thereby making the largest impact. Acknowledgements The work is funded under the Fuel Cell Performance and Durability Consortium (FC-PAD), by the Fuel Cell Technologies Office (FCTO), Office of Energy Efficiency and Renewable Energy (EERE), of the U.S. Department of Energy under contract number DE-AC02-05CH11231. The authors would like to thank Nathan Craig at Robert Bosch LLC for his valuable input in designing the sensitivity analysis. The authors would also like to thank Giovanna Bucci and Matthias Hanauer at Robert Bosch for their valuable inputs and discussion. References P. K. Sinha, W. Gu, A. Kongkanand and E. Thompson, J. Electrochem. Soc., 158, B831 (2011). L. M. Pant, M. R. Gerhardt, N. Macauley, R. Mukundan, R. L. Borup and A. Z. Weber, Electrochim. Acta, 326, 134963 (2019). R. Vetter and J. O. Schumacher, ArXiv181110091 Phys. (2018). Figure 1

Pant, Lalit↗
DOE OSTI2020

Extreme Scale Infrasound Inversion and Prediction for Weather Characterization and Acute Event Detection

Accurate and timely weather predictions are critical to many aspects of society with a profound impact on our economy, general well-being, and national security. In particular, our ability to forecast severe weather systems is necessary to avoid injuries and fatalities, but also important to minimize infrastructure damage and maximize mitigation strategies. The weather community has developed a range of sophisticated numerical models that are executed at various spatial and temporal scales in an attempt to issue global, regional, and local forecasts in pseudo real time. The accuracy however depends on the time period of the forecast, the nonlinearities of the dynamics, and the target spatial resolution. Significant uncertainties plague these predictions including errors in initial conditions, material properties, data, and model approximations. To address these shortcomings, a continuous data collection occurs at an effort level that is even larger than the modeling process. It has been demonstrated that the accuracy of the predictions depends on the quality of the data and is independent to a certain extent on the sophistication of the numerical models. Data assimilation has become one of the more critical steps in the overall weather prediction business and consequently substantial improvements in the quality of the data would have transformational benefits. This paper describes the use of infrasound inversion technology, enabled through exascale computing, that could potentially achieve orders of magnitude improvement in data quality and therefore transform weather predictions with significant impact on many aspects of our society.

58 GEOSCIENCES↗
DOE OSTI2020

Fast and Accurate Core Analysis by the Full-Immersion Pressure-Pulse Decay: Part 1—Theory

Summary Core-scale measurements are considered the ground truth that oil and gas or electric utility companies use to predict the migration of fluids such as oil, natural gas, carbon dioxide, or brine deep underground during their extraction or injection operations. To provide a greater understanding of petrophysical properties of low-permeability geologic formations such as shales and tight gas sandstones, this study introduces a novel core-analysis procedure. The technique follows conventional pressure-pulse-decay permeametry, where the pressure in an inlet chamber adjacent to a cylindrical core plug undergoes a rapid pressurization, the system is shut in, and the pressure reaches a new equilibrium. However, unlike a standard unidirectional pressure-pulse decay, the full-immersion pressure-pulse decay (Hannon 2019) applies a pressure disturbance to the entire outer surface area of the sample. This article covers the numerical simulator designed to model flow through an anisotropic porous sample in this scenario. The model assumes distinct but uniform permeabilities along the radial and axial directions of the cylindrical plug sample. When extracting a plug vertically (or perpendicular to bedding), the permeability along the radial direction associates with the horizontal permeability (i.e., parallel to bedding), whereas in the axial direction, flow occurs perpendicular to bedding (a vertical permeability). Investigations of these model outputs demonstrate an approximately 20-fold decrease in time to complete a full-immersion experiment compared with conventional pressure-pulse decay. Furthermore, the pressure-decay curves resulting from the full-immersion method have slightly different shapes than those resulting from other unidimensional transient methods. These differences begin to demonstrate that, under achievable experimental conditions, the analysis of pressure data from one full-immersion test could enable the simultaneous estimation of the apparent permeabilities parallel and perpendicular to bedding of a cylindrical sample in addition to its porosity. A follow-up article finalizes the proof of this capability with a parameter-estimation procedure and presents experimental verification through a proof-of-concept study. Described in greater detail in that article, the parameter estimator requires multiple forward simulations to analyze the data, which behooves minimizing the compute time for each simulation. By using an alternating direction implicit time-marching scheme and a structured but variably spaced grid, the numerical simulator built for this purpose provides a forward model output with suitable accuracy in approximately 0.5 seconds.

Energy & Fuels↗
DOE OSTI2023

What Controls the Entrainment Rate of Dry Buoyant Thermals with Varying Initial Aspect Ratio?

Here, this study uses theory and numerical simulations to analyze the nondimensional spreading rate a (change in radius with height) of buoyant thermals as they rise and entrain surrounding environmental fluid. A focus is on how a varies with initial thermal aspect ratio A r , defined as height divided by width of the initial buoyancy perturbation. An analytic equation for thermal ascent rate w t that depends on a is derived from the thermal-volume-averaged momentum bud get equation. The thermal top height when w t is maximum, defining a critical height z c , is inversely proportional to a. The height z c also corresponds to the thermal top height when buoyant fluid along the thermal’s vertical axis is fully replaced by entrained nonbuoyant environmental fluid rising from below the thermal. The time scale for this process is controlled by the vertical velocity of parcels rising upward through the thermal’s core. This parcel vertical velocity is approximated from Hill’s analytic spherical vortex, yielding an analytic inverse relation between a and A r . Physically, this a–A r relation is connected to changes in circulation as A r is modified. Numerical simulations of thermals with A r varied from 0.5 to 2 give a values close to the analytic theoretical relation, with a factor of ~3 decrease in a as A r is increased from 0.5 to 2. The theory also explains why a of initially spherical thermals from past laboratory and modeling studies is about 0.15. Overall, this study provides a theoretical underpinning for understanding the entrainment behavior of thermals, relevant to buoyantly driven atmospheric flows.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Semiclassical theory of bipolaronic superconductivity in a bond-modulated electron-phonon model

We analyze the transition temperature T c of bipolaronic superconductivity in a bond Su-Schrieffer-Heeger (bond-SSH) model—also known as a bond Peierls model—where the electron hoppings are modulated by bond phonons. Using a semiclassical instanton approximation justifiable in the adiabatic limit of slow phonons, we find that the bipolaron mass is only weakly enhanced, in contrast to the typical large mass enhancement found in standard (Holstein) electron-phonon models. Specifically, in the strong coupling limit, the bipolarons can freely slide within a degenerate manifold rather than become self-trapped. A gas of these bipolarons can undergo a superfluid transition at a critical temperature for which we obtain an upper bound. We find that this bound is exponentially larger than that in the Holstein model. In conclusion, our study provides an analytical understanding of the mechanism behind the high-T c bipolaronic superconductivity numerically observed in [Phys. Rev. X 13, 011010 (2023)].

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗