Engineering PapersSearch

SEARCH · Engineering Papers

Results for “approximation”

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 73 records · Page 4

Karhunen–Loève deep learning method for surrogate modeling and approximate Bayesian parameter estimation

We evaluate the performance of the Karhunen-Loève Deep Neural Network (KL-DNN) framework for surrogate modeling and approximate Bayesian parameter estimation in partial differential equation models. In the surrogate model, the Karhunen-Loève (KL) expansions are used for the dimensionality reduction of the number of unknown parameters and variables, and a deep neural network is employed to relate the reduced space of parameters to that of the state variables. The KL-DNN surrogate model is used to formulate a maximum-a-posteriori-like least-squares problem, which is randomized to draw samples of the posterior distribution of the parameters. We test the proposed framework for a hypothetical unconfined aquifer via comparison with the forward MODFLOW and inverse PEST++ iterative ensemble smoother (IES) solutions as well as the state-of-the-art Fourier neural operator (FNO) and deep operator networks (DeepONets) operator learning surrogate models. Our results show that the KL-DNN surrogate model outperforms FNO and DeepONet for forward predictions. For solving inverse problems, the randomized algorithm provides the same or more accurate Bayesian predictions of the parameters than IES as evidenced by the higher log-predictive probability of both the estimated parameter field and the forecast hydraulic head. The posterior mean obtained from the randomized algorithm is closer to the reference parameter field than that obtained with FNO as the maximum a posteriori estimate.

Approximate Bayesian inference

Optimization of Random Phase Approximation Calculations for Improved Energies of Molecules, Solids, and Surfaces

We present an optimized random phase approximation method (optRPA26) that significantly improves upon conventional RPA through an optimized choice of reference orbitals and energy components, rather than a modification of the RPA correlation functional itself. The method employs an empirically constructed hybrid functional to generate DFT orbitals to evaluate the RPA correlation energy, which is then scaled by a constant. Comprehensive benchmarks across molecules, bulk solids, and surface systems demonstrate that optRPA26 consistently achieves high accuracy, with mean absolute errors of 0.05 eV for W4-11-RE reaction energies, 0.07 eV for cohesive energies, 0.09 eV for metal oxide formation energies, 0.11–0.12 eV for adsorption of small molecules on metals, and 0.06 eV for adsorption on oxides. In addition, optRPA26 correctly captures phase stability in metal oxides and magnetic metals. The optRPA26 approach can be run using standard RPA implementations, highlighting its potential as a general-purpose reference method that can accurately capture covalent, ionic, metallic, and van der Waals bonding in molecules, solids, and interfaces.

Adsorption

A simple fourth order propagator based on the Magnus expansion in the Liouville space: Application to a Λ-system and assessment of the rotating wave approximation

A simple fourth-order propagator [Ture and Jang, J. Phys. Chem. A 128, 2871 (2024)] based on the Magnus expansion is extended to the Liouville space for both closed-system and Lindbladian open-system quantum dynamics. For both dynamics, commutator free versions of fourth-order propagators are provided as well. These propagators are then applied to the dynamics of a driven Λ-system, where Lindblad terms represent the effect of a photonic bath. For both dynamics, the accuracy of the rotating wave approximation (RWA) for the matter–radiation interaction is assessed. We confirmed reasonable performance of RWA for weak and resonant fields. However, small errors appear for moderate fields and substantial errors can be found for strong fields where coherent population trapping can still be expected. We also found that the presence of bath for open-system quantum dynamics consistently reduces the errors of the RWA. These results provide quantitative information on how the RWA breaks down beyond weak field or for non-resonant cases. Major results are benchmarked against results of our sixth-order ME-based propagator. Finally, we also provide numerical comparison of our algorithms with other fourth-order algorithms for the Λ-system. These confirm reasonable performance of our simple propagators and the improvement gained through commutator-free expressions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

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

FIREFLY: heat load and particle exhaust approximations for rapid evaluation of divertor designs

The divertor in a magnetic confinement fusion reactor is an essential component for power dissipation and particle removal. The FIREFLY package for rapid evaluation of divertor designs is presented as an extension of the FLARE code for field line reconstruction from a flux tube mesh. First, divertor loads are approximated with a simplified heat transport model. Neutralized particles are then sampled from the resulting load distribution, and the EIRENE code is used to track molecules and atoms in a plasma background while accounting for dissociation, charge exchange and ionization. Particles are removed on pumping surfaces in order to estimate the exhaust efficiency for a given divertor geometry. Optimization of the divertor geometry for more efficient particle exhaust is explored by using W7-X as an example, and the sensitivity to model parameters for the plasma background in the proxy calculations is evaluated.

mesh generation, magnetic field lines, scrape-off

Boundary Corrections for Kernel Approximation to Differential Operators

The kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same computational cost as an explicit finite difference scheme but can exhibit order reduction at boundaries. In previous work on periodic domains, order reduction was addressed, yielding high-order accuracy. The issue addressed in this work is the elimination of order reduction of the kernel-based approach for a more general set of boundary conditions. Further, we consider the case of both first and second order operators. To demonstrate the theory, we provide not only the mathematical proofs but also experimental results by applying various boundary conditions to different types of equations. The results agree with the theory, demonstrating a systematic path to high order for kernel-based methods on bounded domains.

97 MATHEMATICS AND COMPUTING

A high-order explicit Runge-Kutta approximation technique for the shallow water equations

Here, we introduce a high-order space–time approximation of the Shallow Water Equations with sources that is invariant-domain preserving (IDP), well-balanced with respect to rest states, and employs a novel explicit Runge–Kutta (ERK) introduced in Ern and Guermond (SIAM J. Sci. Comput. 44(5), A3366–A3392, 2022) for systems of non-linear conservation equations. The resulting method is then numerically illustrated through verification and validation.

97 MATHEMATICS AND COMPUTING

Enhancing approximate modular Bayesian inference by emulating the conditional posterior

In modular Bayesian analyses, complex models are composed of distinct modules, each representing different aspects of the data or prior information. In this context, fully Bayesian approaches can sometimes lead to undesirable feedback between modules, compromising the integrity of the inference. The “cut-distribution” prevents unwanted influence between modules by “cutting” feedback. The direct sampling (DS) algorithm is standard practice for approximating the cut-distribution, but it can be computationally intensive, especially when the number of imputations required is large. An enhanced method is proposed, the Emulating the Conditional Posterior (ECP) algorithm, which leverages emulation to increase the number of imputations. Through numerical experiment it is demonstrated that the ECP algorithm outperforms the traditional DS approach in terms of accuracy and computational efficiency, particularly when resources are constrained. Here, it is also shown how the DS algorithm can be improved using ideas from design of experiments. Some practical recommendations are given for algorithm choice in modular Bayesian analyses.

97 MATHEMATICS AND COMPUTING

Approximation of refrigerant thermophysical properties using neural networks to speed up transient thermofluid simulations

Accurate and efficient evaluations of refrigerant thermophysical properties and their partial derivatives are essential for transient simulations of thermofluid systems, where several computations need to be executed at each integration time step. Since the utilization of an Equation of State for retrieving properties based on a pair of independent inputs typically involves numerical iterations in solution procedures, when the input variables differ from the refrigerant state variables employed in dynamic models, a variety of approaches including lookup table interpolation and curve fitting have been developed to explicitly approximate these properties based on the state variables, and consequently eliminate internal iterations. This paper presents an alternative method that exploits derivative-informed neural networks to model refrigerant properties explicitly from inputs of pressure and enthalpy, while ensuring consistent partial derivatives generated by differentiating the neural networks. Computational speed and accuracy of the proposed approach are demonstrated via transient simulations of a discretized heat exchanger model in Modelica, and comparisons against other property evaluation routines. Simulation results indicate that the proposed approach can realize a significant speedup with negligible discrepancies in predicted transients. The method is implemented in an open-source Modelica library.

Ma, Jiacheng

Random Phase Approximation Correlation Energy Using Real-Space Density Functional Perturbation Theory

We present a real-space method for computing the random phase approximation (RPA) correlation energy within Kohn–Sham density functional theory, leveraging the low-rank nature of the frequency-dependent density response operator. In particular, we employ a cubic-scaling formalism based on density functional perturbation theory that circumvents the calculation of the response function matrix, instead relying on the ability to compute its product with a vector through the solution of the associated Sternheimer linear systems. We develop a large-scale parallel implementation of this formalism using the subspace iteration method in conjunction with the spectral quadrature method while employing the Kronecker product-based method for the application of the Coulomb operator and the conjugate orthogonal conjugate gradient method for the solution of the linear systems. We demonstrate convergence with respect to key parameters and verify the method’s accuracy by comparing with plane-wave results. We show that the framework achieves good strong scaling to many thousands of processors, reducing the time to solution for a lithium hydride system with 128 electrons to around 150 s on 4608 processors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Ab Initio Polariton Transport Dynamics with the Classical Path Approximation

We present an ab initio framework for simulating polariton transport dynamics based on the classical path approximation (CPA). The quantum dynamics of polariton transport involves simulating many electronic degrees of freedom, making a fully ab initio dynamics simulation computationally expensive. We demonstrate that the CPA, which removes the need for excited-state nuclear gradients, is well-suited for polaritonic systems because collective light–matter coupling leads to vanishing excited-state forces. Benchmark comparisons between CPA and full evaluation of the excited-state forces show excellent agreement for polariton transport results in model light–matter systems such as polariton group velocities and mean-squared displacements. Ab initio simulations of polariton transport using CPA reproduce key physical trends that are observed in experiments with BODIPY molecules. Our work establishes the CPA as a highly efficient tool for ab initio investigations of transport and energy flow in hybrid light–matter systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Long-Range Interaction between Molecules with Electronic Degeneracy: Beyond the Born–Oppenheimer Approximation

Long-range intermolecular interaction plays an essential role in (ultra)cold collisions. For monomers with degenerate electronic states, an accurate description of the long-range interaction can be challenging due to the potential breakdown of the Born–Oppenheimer approximation. In this work, we developed a general method to construct long-range interaction potential energy surfaces (IPESs) between arbitrary molecules using the degenerate perturbation theory of Schrödinger. To further simplify the application of this method, a group-theoretical method is introduced to identify nonzero components of electrostatic properties of monomers, especially for the nonlinear molecules. To demonstrate this approach, we report the long-range IPESs of the O( 3 P)–OH( 2 Π) and OH( 2 Π)–OH( 2 Π) systems. The excellent agreement with ab initio calculations in large separations, even near electronic degeneracies, confirms the accuracy of our approach. The method is expected to lay the groundwork for the accurate investigation of (ultra)cold collisional dynamics involving open-shell species.

ab initio calculations

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

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

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

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)

The approximate second order coupled-cluster method based on a size-consistent Brillouin–Wigner partitioning

We present a variant of the approximate second order coupled-cluster method (CC2) with a two-parameter size-consistent Brillouin–Wigner (BW-s) partitioning instead of a Møller–Plesset (MP) partitioning for the unperturbed Hamiltonian, which we refer to as BWs-CC2. The computational complexity of this model scales identically to CC2 with molecular size. Conventional CC2 and its regularized BWs-CC2 variants, as well as conventional MP2 and two of its regularized BW-s2 variants, were assessed on a 535 element database spanning thermochemistry, non-covalent interactions, barrier heights, and isomerization energies. To ensure a well-defined model chemistry, the assessment was performed using internally stable spin-polarized Hartree–Fock (HF) orbitals in the finite aug-cc-pVQZ basis without counterpoise corrections. As a result of using stable orbitals, contrary to conventional wisdom, we find that CC2 substantially outperforms MP2 on molecules with significantly spin contaminated reference orbitals without a significant increase in error on systems with a spin-pure reference, showing the value of its single substitutions. While no single choice of regularization parameters can be optimal for all datasets, we find that BWs-CC2 generally outperforms both CC2 and BW-s2 with a single judicious parameter choice. Additional tests on dipole moments and bond lengths of diatomics provide further support for the utility of this choice. Furthermore, the main outliers and poorest performing cases are associated with large amounts of spin-contamination in the HF reference, which is indicative of systems with either strong correlation or extensive artificial symmetry breaking. Overall, these findings argue that the perception of the quality of the CC2 ground state should be reevaluated and that it can be further improved upon by the soundly based BWs-CC2 variant with the recommended parameter choice.

Correlation energy

Numerical assessment of the impact of the guiding-centre approximation on fast ion simulations in NSTX

Guiding-centre (GC) and full-orbit (FO) simulations of the beam-injected fast ion distribution and the corresponding neutron emissivity have been carried out for magnetohydrodynamics-quiescent National Spherical Torus eXperiment (NSTX) plasmas, using a combination of ASCOT5 and DRESS, to assess the suitability of the GC approximation for fast ions in NSTX. It was found that GC and FO simulations predicted substantially different steady-state distributions in both position and velocity space and different neutron emissivity profiles, leading to a 15% reduction in the predicted global neutron rate for FO relative to GC. These changes accompany a higher magnetic moment in FO, and correspond to a change in particle orbits from co-passing to trapped and stagnation orbits. ASCOT5 was also benchmarked against TRANSP/NUBEAM with input loaded entirely from TRANSP/NUBEAM output files, with agreement found between the GC simulations when finite Larmor radius (FLR) corrections were omitted. ASCOT5 FO and TRANSP/NUBEAM with FLR produced fast ion distributions which differed in localised regions, but predicted global neutron rates which agree within 3%.

ASCOT

Towards dynamical low-rank approximation for neutrino kinetic equations. Part I: Analysis of an idealized relaxation model

Dynamical low-rank approximation (DLRA) is an emerging tool for reducing computational costs and provides memory savings when solving high-dimensional problems. Here, in this work, we propose and analyze a semi-implicit dynamical low-rank discontinuous Galerkin (DLR-DG) method for the space homogeneous kinetic equation with a relaxation operator, modeling the emission and absorption of particles by a background medium. Both DLRA and the discontinuous Galerkin (DG) scheme can be formulated as Galerkin equations. To ensure their consistency, a weighted DLRA is introduced so that the resulting DLR-DG solution is a solution to the fully discrete DG scheme in a subspace of the standard DG solution space. Similar to the standard DG method, we show that the proposed DLR-DG method is well-posed. We also identify conditions such that the DLR-DG solution converges to the equilibrium. Numerical results are presented to demonstrate the theoretical findings.

97 MATHEMATICS AND COMPUTING