Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Differential equations”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Stellarator equilibrium axis-expansion to all orders in distance from the axis for arbitrary plasma beta

A systematic theory of the asymptotic expansion of the magnetohydrostatics (MHS) equilibrium in the distance from the magnetic axis is developed to include arbitrary smooth currents near the magnetic axis. Compared with the vacuum and the force-free system, an additional magnetic differential equation must be solved to obtain the pressure-driven currents. It is shown that there exist variables in which the rest of the MHS system closely mimics the vacuum system. Thus, a unified treatment of MHS fields is possible. The mathematical structure of the near-axis expansions to arbitrary order is examined carefully to show that the double-periodicity of physical quantities in a toroidal domain can be satisfied order by order. The essential role played by the leading-order Birkhoff–Gustavson normal form in solving the magnetic differential equations is highlighted. Several explicit examples of vacuum, force-free and MHS equilibrium in different geometries are presented.

Physics↗
DOE OSTI2025

A review of low-rank methods for time-dependent kinetic simulations

Time-dependent kinetic models are ubiquitous in computational science and engineering. The underlying integro-differential equations in these models are high-dimensional, comprised of a six–dimensional phase space, making simulations of such phenomena extremely expensive. In this article we demonstrate that in many situations, the solution to kinetics problems lives on a low dimensional manifold that can be described by a low-rank matrix or tensor approximation. We then review the recent development of so-called low-rank methods that evolve the solution on this manifold. The two classes of methods we review are the dynamical low-rank (DLR) method, which derives differential equations for the low-rank factors, and a Step-and-Truncate (SAT) approach, which projects the solution onto the low-rank representation after each time step. Thorough discussions of time integrators, tensor decompositions, and method properties such as structure preservation and computational efficiency are included. We further show examples of low-rank methods as applied to particle transport and plasma dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗
DOE OSTI2022

Molecular dynamics on quantum annealers

Abstract In this work we demonstrate a practical prospect of using quantum annealers for simulation of molecular dynamics. A methodology developed for this goal, dubbed Quantum Differential Equations (QDE), is applied to propagate classical trajectories for the vibration of the hydrogen molecule in several regimes: nearly harmonic, highly anharmonic, and dissociative motion. The results obtained using the D-Wave 2000Q quantum annealer are all consistent and quickly converge to the analytical reference solution. Several alternative strategies for such calculations are explored and it was found that the most accurate results and the best efficiency are obtained by combining the quantum annealer with classical post-processing (greedy algorithm). Importantly, the QDE framework developed here is entirely general and can be applied to solve any system of first-order ordinary nonlinear differential equations using a quantum annealer.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

An energy-based coupling approach to nonlocal interface problems.

Nonlocal models provide accurate representations of physical phenomena ranging from fracture mechanics to complex subsurface flows, settings in which traditional partial differential equation models fail to capture effects caused by long-range forces at the microscale and mesoscale. However, the application of nonlocal models to problems involving interfaces, such as multimaterial simulations and fluid-structure interaction, is hampered by the lack of a physically consistent interface theory which is needed to support numerical developments and, among other features, reduces to classical models in the limit as the extent of nonlocal interactions vanish. In this paper, we use an energy-based approach to develop a formulation of a nonlocal interface problem which provides a physically consistent extension of the classical perfect interface formulation for partial differential equations. Numerical examples in one and two dimensions validate the proposed framework and demonstrate the scope of our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗
DOE OSTI2020

Regression Based Approach for Robust Finite Element Analysis on Arbitrary Grids. LDRD Final Report

This report summarizes the work performed under a one-year LDRD project aiming to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. In this project, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality. At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5x improvement in accuracy and allows for taking an 8x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method. The report concludes with a brief summary of ongoing projects and collaborations that utilize or extend the products of this work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Mixing Cell Model: A One-Dimensional Numerical Model for Assessment of Water Flow and Contaminant Transport in the Unsaturated Zone

This report describes the Mixing Cell Model code, a one dimensional model for water flow and solute transport in the unsaturated zone under steady state or transient flow conditions. The model is based on the principles and assumptions underlying mixing-cell model formulations. The unsaturated zone is discretized into a series of independent mixing cells. Each cell may have unique hydrologic, lithologic, and sorptive properties. Ordinary differential equations describe the material (water and solute) balance within each cell. Water-flow equations are derived from the continuity equation, assuming that unit gradient conditions exist at all times in each cell. Pressure gradients are considered implicitly through model discretization. Unsaturated hydraulic conductivity and moisture contents are determined by the material specific moisture-characteristic curves. Solute-transport processes include explicit treatment of advective processes, first order chain decay, and linear sorption reactions. Dispersion is addressed through implicit and explicit dispersion. Implicit dispersion is an inherent feature of all mixing-cell models and originates from the formulation of the problem in terms of mass balance around fully mixed volume elements. Expressions are provided that relate implicit dispersion to the physical dispersion of the system. Two FORTRAN codes were developed to solve the water flow and solute-transport equations: (1) the Mixing Cell Model for Flow (MCMF) solves transient water-flow problems and (2) the Mixing Cell Model for Transport (MCMT) solves the solute-transport problem. The transient water-flow problem is typically solved first by estimating the water flux through each cell in the model domain as a function of time using the MCMF code. These data are stored in either ASCII or binary files that are later read by the solute transport code (MCMT). Code output includes solute pore water concentrations, water and solute inventories in each cell and at each specified output time, and water and solute fluxes through each cell and specified output time. Computer run times for coupled transient water flow and solute transport were typically several seconds on a 2 GHz Intel Pentium IV desktop computer. The model was benchmarked against analytical solutions and finite element approximations to the partial differential equations (PDE) describing unsaturated flow and transport. Differences between the maximum solute flux estimated by the mixing cell model and the PDE models were typically less than two percent. This revision includes an option for a fixed concentration lower boundary condition for diffusive fluxes for versions 020321 and later.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

CryoTRANS: predicting high-resolution maps of rare conformations from self-supervised trajectories in cryo-EM

Cryogenic electron microscopy (cryo-EM) has revolutionized structural biology, enabling efficient determination of structures at near-atomic resolutions. However, a common challenge arises from the severe imbalance among various conformations of vitrified particles, leading to low-resolution reconstructions in rare conformations due to a lack of particle images in these quasi-stable states. We introduce CryoTRANS, a method that predicts high-resolution maps of rare conformations by constructing a self-supervised pseudo-trajectory between density maps of varying resolutions. This trajectory is represented by an ordinary differential equation parameterized by a deep neural network, ensuring retention of detailed structures from high-resolution density maps. By leveraging a single high-resolution density map, CryoTRANS significantly improves the reconstruction of rare conformations and has been validated on four real-world datasets: alpha-2-macroglobulin, actin-binding protein complexes, SARS-CoV-2 spike glycoprotein, and the 70S ribosome. CryoTRANS can also predict high-resolution structures in cryogenic electron tomography maps using a high-resolution cryo-EM map.Cryogenic electron microscopy (cryo-EM) has revolutionized structural biology, enabling efficient determination of structures at near-atomic resolutions. However, a common challenge arises from the severe imbalance among various conformations of vitrified particles, leading to low-resolution reconstructions in rare conformations due to a lack of particle images in these quasi-stable states. We introduce CryoTRANS, a method that predicts high-resolution maps of rare conformations by constructing a self-supervised pseudo-trajectory between density maps of varying resolutions. This trajectory is represented by an ordinary differential equation parameterized by a deep neural network, ensuring retention of detailed structures from high-resolution density maps. By leveraging a single high-resolution density map, CryoTRANS significantly improves the reconstruction of rare conformations and has been validated on four real-world datasets: alpha-2-macroglobulin, actin-binding protein complexes, SARS-CoV-2 spike glycoprotein, and the 70S ribosome. CryoTRANS can also predict high-resolution structures in cryogenic electron tomography maps using a high-resolution cryo-EM map.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Scalability of high-performance PDE solvers

Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Kinetic Monte Carlo Approach for Simulating Cascading Transmission Line Failure

In this work, cascading transmission line failures are studied through a dynamical model of the power system operating under fixed conditions. The power grid is modeled as a stochastic dynamical system where first-principles electromechanical dynamics are excited by small Gaussian disturbances in demand and generation around a specified operating point. In this context, a single line failure is interpreted in a large deviation context as a first escape event across a surface in phase space defined by line security constraints. The resulting system of stochastic differential equations admits a transverse decomposition of the drift, which leads to considerable simplification in evaluating the quasipotential (rate function) and, consequently, computation of exit rates. Tractable expressions for the rate of transmission line failure in a restricted network are derived from large deviation theory arguments and validated against numerical simulations. Extensions to realistic settings are considered, and individual line failure models are aggregated into a Markov model of cascading failure inspired by chemical kinetics. Cascades are generated by traversing a graph composed of weighted edges representing transitions to degraded network topologies. Numerical results indicate that the Markov model can produce cascades with qualitative power-law properties similar to those observed in empirical cascades.

Kinetic Monte Carlo, rare events, Cascading Failur↗
DOE OSTI2024

A new framework for higher loop Witten diagrams

The differential representation is a novel formalism for studying boundary correlators in (d + 1)-dimensional anti-de Sitter space. In this letter, we generalize the differential representation beyond tree level using the notion of operator-valued integrals. We use the differential representation to compute three-point bubble and triangle Witten diagrams with external states of conformal dimension ∆ = d. We compare the former to a position space computation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

B-PINNs: Bayesian Physics-informal Neural Networks for Forward and Inverse PDE Problems with Noisy Data

We propose a Bayesian physics-informed neural network (B-PINN) to solve both forward and inverse nonlinear problems described by partial differential equations (PDEs) and noisy data. In this Bayesian framework, the Bayesian neural network (BNN) combined with a PINN for PDEs serves as the prior while the Hamiltonian Monte Carlo (HMC) or the variational inference (VI) could serve as an estimator of the posterior. B-PINNs make use of both physical laws and scattered noisy measurements to provide predictions and quantify the aleatoric uncertainty arising from the noisy data in the Bayesian framework. Compared with PINNs, in addition to uncertainty quantification, B-PINNs obtain more accurate predictions in scenarios with large noise due to their capability of avoiding overfitting. We conduct a systematic comparison between the two different approaches for the B-PINNs posterior estimation (i.e., HMC or VI), along with dropout used for quantifying uncertainty in deep neural networks. Our experiments show that HMC is more suitable than VI with mean field Gaussian approximation for the B-PINNs posterior estimation, while dropout employed in PINNs can hardly provide accurate predictions with reasonable uncertainty. Finally, we replace the BNN in the prior with a truncated Karhunen-Loève (KL) expansion combined with HMC or a deep normalizing flow (DNF) model as posterior estimators. The KL is as accurate as BNN and much faster but this framework cannot be easily extended to high-dimensional problems unlike the BNN based framework.

Non linear PDEs, Noisy data, Bysian physics inform↗
DOE OSTI2025

$\mathrm{SageNet}$: Fast Neural Network Emulation of the Stiff-amplified Gravitational Waves from Inflation

Accurate modeling of the inflationary gravitational waves (GWs) requires time-consuming, iterative numerical integrations of differential equations to take into account their backreaction on the expansion history. To improve computational efficiency while preserving accuracy, we present the Stiff-amplified Gravitational-wave Emulator Network (SageNet), a deep learning framework designed to replace conventional numerical solvers (code available at https://github.com/YifangLuo/SageNet). SageNet employs a long short-term memory architecture to emulate the present-day energy density spectrum of the inflationary GWs with possible stiff amplification, Ω GW (f). Trained on a data set of 25,689 numerically generated solutions, SageNet allows accurate reconstructions of Ω GW (f) and generalizes well to a wide range of cosmological parameters; 90.9% of the test emulations with randomly distributed parameters exhibit errors of under 4%. In addition, SageNet demonstrates its ability to learn and reproduce the artificial, adaptive sampling patterns in numerical calculations, which implement denser sampling of frequencies around changes in spectral indices in Ω GW (f). The dual capability of learning both physical and artificial features of the numerical GW spectra establishes SageNet as a robust alternative to exact numerical methods. Finally, our benchmark tests show that SageNet reduces the computation time from tens of seconds to milliseconds, achieving a speedup of ∼10 4 times over standard CPU-based numerical solvers with the potential for further acceleration on GPU hardware. These capabilities make SageNet a powerful tool for accelerating Bayesian inference procedures for extended cosmological models. In a broad sense, the SageNet framework offers a fast, accurate, and generalizable solution to modeling cosmological observables whose theoretical predictions demand costly differential equation solvers.

Astronomy data modeling↗
DOE OSTI2022

Design of a Combined Proportional Integral Derivative Controller to Regulate the Temperature Inside a High-Temperature Tubular Solar Reactor

Solar fuels are proven to be promising candidates for thermochemical energy storage. However, the transient nature of solar radiation is an obstacle to maintaining a stable operational temperature inside a solar reactor. To overcome this challenge, the temperature of a solar reactor can be regulated by controlling the incoming solar radiation or the feedstock flowrate inside the reactor. In this work, a combined proportional integral derivative (PID) controller is implemented to regulate the temperature inside a high-temperature tubular solar reactor with counter-current flowing gas/particles. The control model incorporates two control systems to regulate incoming solar radiation and gas flow simultaneously. The design of the controller is based on a reduced-order numerical model of a high-temperature tubular solar reactor that is vertically oriented with an upward gas flow and downward particle flow. The reactor receives heat circumferentially through its wall over a finite segment of its length. Formulation of the heat transfer model is presented by applying the energy balance for the reactor tube and considering heat and mass transfer inside. A set of governing differential equations are solved numerically by using the finite volume method to obtain reactor wall, particles, and gas temperatures along the reactor length with various boundary conditions. Simulation results are used to tune the PID controller parameters by utilizing the Ziegler–Nichols tuning method. Both the simulation results and the controller performance are visualized on the LABVIEW platform. The controller is challenged to track different temperature setpoints with different scenarios of transient solar radiation. Here, the performance of the PID controller was compared to experimental results obtained from an industrial PID controller embedded in a 7 kW electric furnace. Results show that the combined PID controller is successful in maintaining a stable temperature inside the reactor by regulating the incoming solar radiation and the flowrate via small steady-state error and reasonable settling time and overshoot.

14 SOLAR ENERGY↗
DOE OSTI2020

Quandary

Quandary numerically simulates and optimizes the time-evolution of open quantum systems. The underlying dynamics are modelled by Lindblad's master equation, a linear ordinary differential equation (ODE) describing quantum systems interacting with the environment. Quandary solves this ODE numerically by applying a time-stepping integration scheme, and utilizes a gradient-based optimization approach to determine optimal control pulses that drive the quantum system to a desired target state. Two optimization objectives are considered: (a) Unitary gate optimization that finds controls to realize a unitary gate transformation, and (b) optimal reset that aims to drive the quantum system to the ground states. Gradient-based optimization schemes utilizing Petsc's Tao optimization package are applied to generate control pulses that minimize the respective measure. To evaluate the gradient of the objective function, the discrete adjoint method is used while leveraging techniques from Algorithmic Differentiation to produce exact and consistent gradients. To mitigate excessive execution run times, the software can be build together with the XBraid software library which provides a parallelization strategy to distribute the time-evolution of the underlying dynamics onto multiple processor.

Petersson, NilsA.↗