Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “universal 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 37 records · Page 2

Kinematic flow for cosmological loop integrands

Recently, an interesting pattern was found in the differential equations satisfied by the Feynman integrals describing tree-level correlators of conformally coupled scalars in a power-law FRW cosmology [1, 2]. It was proven that simple and universal graphical rules predict the equations for arbitrary graphs as a flow in kinematic space. In this note, we show that the same rules — with one small addition — also determine the differential equations for loop integrands. We explain that both the basis of master integrals and the singularities of the differential equations can be represented by tubings of marked graphs. An important novelty in the case of loops is that some basis functions can vanish, and we present a graphical rule to identify these vanishing functions. Taking this into account, we then demonstrate that the kinematic flow correctly predicts the differential equations for all loop integrands.

Cosmological models↗

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗

Instability Effects in F(R)-Modified Gravity and in Gravitational Baryogenesis

The review is devoted to the development and subsequent application of methods for studying the stability of solutions of higher-order differential equations arising in various models of modified gravity and baryosynthesis. Major attention is paid to F (R )-modified theories proposed to describe the accelerated expansion of the universe and to baryon asymmetry generation in the framework of the spontaneous and gravitational baryogenesis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Progressive wave equations and algorithms for sonic boom propagation

Raspet, Bass, and others have carried out a number of studies of sonic boom propagation using algorithms that can be traced back to a 1973 doctoral thesis written by Pestorius at the University of Texas. The algorithm was originally set forth without a formal derivation from a governing set of partial differential equations. Perusal of Pestorius's report and of subsequent reports from the Texas nonlinear accoustics group suggests that such a derivation has not yet appeared in the archival literature. The author and his colleagues, on the other hand, have been working with an explicit set of approximate partial differential equations analogous to Burgers' equation. The present paper traces through the pertinent statements in the Pestorius reports and shows that the derived algorithm, at least in the limit of sufficiently short steps, is equivalent to the numerical solution of a similar (and nearly equivalent) explicit set of partial differential equations. The tying-together of the two approaches is important because it is possible that some of the basic ideas embodied in the Pestorius algorithm may be incorporated in other contexts where more nearly general models of sonic boom propagation through realistic atmospheres are to be solved numerically.

Pierce, Allan D.↗

Derivation and application of the reciprocity relations for radiative transfer with internal illumination

A Green's function formulation is used to derive basic reciprocity relations for planar radiative transfer in a general medium with internal illumination. Reciprocity (or functional symmetry) allows an explicit and generalized development of the equivalence between source and probability functions. Assuming similar symmetry in three-dimensional space, a general relationship is derived between planar-source intensity and point-source total directional energy. These quantities are expressed in terms of standard (universal) functions associated with the planar medium, while all results are derived from the differential equation of radiative transfer.

Cogley, A. C.↗

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

nPINNs: Nonlocal physics-informed neural networks for a parametrized nonlocal universal Laplacian operator. Algorithms and applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius $\delta$ goes to zero, and to the fractional Laplacian as $\delta$ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We also provide theoretical convergence rates with respect to $\delta$ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, $\delta$ and $\alpha$, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order $\alpha(y)$, which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as $\delta$. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

97 MATHEMATICS AND COMPUTING↗

nPINNs: nonlocal Physics-Informed Neural Networks for a parametrized nonlocal universal Laplacian operator. Algorithms and Applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius δ goes to zero, and to the fractional Laplacian as δ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We provide theoretical convergence rates with respect to δ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, δ and α, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order α(γ), which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as δ. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physics informed deep neural network embedded in a chemical transport model for the Amazon rainforest

Secondary organic aerosols (SOA) are fine particles in the atmosphere, which interact with clouds, radiation and affect the Earth’s energy budget. SOA formation involves chemistry in gas phase, aqueous aerosols, and clouds. Simulating these chemical processes involve solving a stiff set of differential equations, which are computationally expensive steps for three-dimensional chemical transport models. Deep neural networks (DNNs) are universal function approximators that could be used to represent the complex nonlinear changes in aerosol physical and chemical processes; however, key challenges such as generalizability to extended time periods, preservation of mass balance, simulating sparse model outputs, and maintaining physical constraints have limited their use in atmospheric chemistry. Here, we develop an approach of using a physics-informed DNN that overcomes previous such challenges and demonstrates its applicability for the chemical formation processes of isoprene epoxydiol SOA (IEPOX-SOA) over the Amazon rainforest. The DNN is trained with data generated by simulating IEPOX-SOA over the entire atmospheric column, using the Weather Research and Forecasting Model coupled with Chemistry (WRF-Chem). The trained DNN is then embedded within WRF-Chem to replace the computationally expensive default solver of IEPOX-SOA formation. The trained DNN predictions generalizes well with the default model simulation of the IEPOX-SOA mass concentrations and its size distribution (20 size bins) over several days of simulations in both dry and wet seasons. The embedded DNN reduces the computational expense of WRF-Chem by a factor of 2. Our approach shows promise in terms of application to other computationally expensive chemistry solvers in climate models.

54 ENVIRONMENTAL SCIENCES↗

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗

Special perturbations employing osculating reference states

The concept of employing osculating reference position and velocity vectors in the numerical integration of the equations of motion of a satellite is examined. The choice of the reference point is shown to have a significant effect upon numerical efficiency and the class of trajectories described by the differential equations of motion. For example, when the position and velocity vectors on the osculating orbit at a fixed reference time are chosen, a universal formulation is yielded. For elliptical orbits, however, this formulation is unattractive for numerical integration purposes due to Poisson terms (mixed secular) appearing in the equations of motion. Other choices for the reference point eliminate this problem but usually at the expense of universality. A number of these formulations, including a universal one, are considered here. Comparisons of the numerical characteristics of these techniques with those of the Encke method are presented.

Born, G. H.↗

What do physics-informed DeepONets learn? Understanding and improving training for scientific computing applications

Physics-informed deep operator networks (DeepONets) have emerged as a promising approach toward numerically approximating the solution of partial differential equations (PDEs). In this work, we aim to develop further understanding of what is being learned by physics-informed DeepONets by assessing the universality of the extracted basis functions and demonstrating their potential toward model reduction with spectral methods. Results provide clarity about measuring the performance of a physics-informed DeepONet through the decays of singular values and expansion coefficients. In addition, we propose a transfer learning approach for improving training for physics-informed DeepONets between parameters of the same PDE as well as across different, but related, PDEs where these models struggle to train well. This approach results in significant error reduction and learned basis functions that are more effective in representing the solution of a PDE.

Deep operator networks↗

On a new method for calculating the potential flow past a body of revolution

A new method is presented for obtaining the velocity potential of the flow about a body of revolution moving uniformly in the direction of its axis of symmetry in a fluid otherwise at rest. This method is based essentially on the fact that the form of the differential equation for the velocity potential is invariant with regard to conformal transformation of the meridian plane. By means of the conformal transformation of the meridian profile into a circle a system of orthogonal curvilinear coordinates is obtained, the main feature of which is that one of the coordinate lines is the meridian profile itself. The use of this type of coordinate system yields a simple expression of the boundary condition at the surface of the solid and leads to a rational process of iteration for the solution of the differential equation for the velocity potential. It is shown that the velocity potential for an arbitrary body of revolution may be expressed in terms of universal functions which, although not normal, are obtainable by means of simple quadratures. The general results are applied to a body of revolution obtained by revolving a symmetrical Joukowski profile about its axis of symmetry. A numerical example further serves to illustrate the theory.

Kaplan, Carl↗

Block smoothers and generalized ideal interpolation in AMG (Final Report)

The Pennsylvania State University (“Subcontractor”) worked on developing new parallel algebraic multilevel methods suitable for solving PDEs. Specifically, work on the design of multigrid solvers for coupled systems of partial differential equations arising in numerical modeling of various applications was completed. A main emphasis was on the design of new ideal algebraic multigrid interpolation for problems such as Maxwell’s equations where block smoothers are needed and the standard form of ideal interpolation is not an effective choice.

97 MATHEMATICS AND COMPUTING↗

Chapter 4 - Recent Advances in Identification of Differential Equations from Noisy Data: IDENT Review

Differential equations and numerical methods are extensively used to model various real-world phenomena in science and engineering. With modern developments, we aim to find the underlying differential equation from a single observation of time-dependent data. If we assume that the differential equation is a linear combination of various linear and nonlinear differential terms, then the identification problem can be formulated as solving a linear system. The goal then reduces to finding the optimal coefficient vector that best represents the time derivative of the given data. We review some recent works on the identification of differential equations. We find some common themes for the improved accuracy: (i) The formulation of linear system with proper denoising is important, (ii) how to utilize sparsity and model selection to find the correct coefficient support needs careful attention, and (iii) there are ways to improve the coefficient recovery. We present an overview and analysis of recent developments on the topic.

97 MATHEMATICS AND COMPUTING↗

Cavitation in a soft porous material

Abstract We study the collapse and expansion of a cavitation bubble in a deformable porous medium. We develop a continuum-scale model that couples compressible fluid flow in the pore network with the elastic response of a solid skeleton. Under the assumption of spherical symmetry, our model can be reduced to an ordinary differential equation that extends the Rayleigh–Plesset equation to bubbles in soft porous media. The extended Rayleigh–Plesset equation reveals that finite-size effects lead to the breakdown of the universal scaling relation between bubble radius and time that holds in the infinite-size limit. Our data indicate that the deformability of the porous medium slows down the collapse and expansion processes, a result with important consequences for wide-ranging phenomena, from drug delivery to spore dispersion.

Leng, Yu↗