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 217 records · Page 12

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

Coupled momentum balance and phase-field solver with fenicsx module

Code solves momentum balance and phase-field equations simultaneously. The differential equations are solved on a discretized domain with appropriate boundary and initial conditions using finite element method. Primary purpose of the code is to simulate brittle fracture under dynamic loading. Constitutive equations are that of linear elasticity with degradation of stress due to fracture. Small strain formulation is used.

Zecevic, Milovan↗

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗

Method and apparatus for shape-based energy analysis of solids

A computer-readable medium stores instructions including storing a model of a physical structure and defining a mesh for the model. The mesh includes finite elements, each defined by a respective set of edges. The instructions include, for each finite element, identifying a governing differential equation and a set of complementary functions that exactly satisfy the governing differential equation. The instructions include determining an applied physical stimulus for the physical structure. The instructions include generating an energy optimization model that minimizes a difference between internal energy and external energy of the finite elements in response to the applied physical stimulus. The model includes a matrix of respective scalar multipliers for the complementary functions for each finite element. The instructions include transforming the matrix and calculating a physical parameter of interest. The instructions include, in response to the physical parameter not satisfying a design parameter, updating the model of the physical structure.

Spears, Robert E.↗

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

Evolution of coupled weakly driven waves in a dissipative plasma

The nonlinear collisional dynamics of coupled driven plasma waves in the presence of background dissipation is studied analytically within kinetic theory. Sufficiently near marginal stability, phase space correlations are poorly preserved and time delays become unimportant. The system is then shown to be governed by two first-order coupled autonomous differential equations of cubic order for the wave amplitudes and two complementary first-order equations for the evolution of their phases. That system of equations can be decoupled and further simplified to a single second-order differential equation of Liénard's type for each amplitude. Numerical solutions for this equation are obtained in the general case, while analytic solutions are obtained for special cases in terms of parameters related to the spacing of the resonances of the two waves in frequency space, e.g., wave lengths and oscillation frequencies. These parameters are further analyzed to find classes of quasi-steady saturation and pulsating scenarios. To classify equilibrium points, local stability analysis is applied, and bifurcation conditions are determined. When the two waves saturate at similar amplitude levels, their combined signal is shown to invariably exhibit amplitude beating and phase jumps of nearly π. In conclusion, the obtained analytical results can be used to benchmark simulations and to interpret eigenmode amplitude measurements in fusion experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Crowd Dynamics: Modeling and Control of Multiagent Systems

This review aims to present recent developments in modeling and control of multiagent systems. A particular focus is set on crowd dynamics characterized by complex interactions among agents, also called social interactions, and large-scale systems. Specifically, in a crowd each individual agent interacts with a field generated by the other agents and the environment. These systems can be modeled at the microscopic scale by ordinary differential equations, while an alternative description at the mesoscopic scale is given by a partial differential equation for the propagation of the probability density of the agents. Control actions can be applied at the individual level as well as at the level of the corresponding fields. This article presents and compares different control types, and the specific application to multilane, multiclass traffic is developed in some detail, showing the main tools at work in a hybrid setting with relevant impacts on autonomous driving.

33 ADVANCED PROPULSION SYSTEMS↗

The Method of Finite Averages

The Method of Finite Averages (MoFA) is a rigorous multiscale modeling methodology for efficiently modeling multi-physical phenomena in heterogeneous porous media. The code developed in this project aims to perform the numerical calculations required to formulate, implement, and verify MoFA models for Earth and Energy systems (i.e., model verification refers to performing fully-resolved simulations of the systems and comparing their results to those of the models). In general, MoFA transforms partial differential equations (PDEs) describing the fine-scale physics of a system into coupled ordinary differential equations (ODEs)---in time---that describe the coarse-scale---or "average"---physical behaviors of the system. This transformation significantly expedites system simulation, as the coarse-scale ODEs involve vastly fewer degrees of freedom than the fine-scale PDEs. The code developed under this project will allow users to 1.) generate system geometries and numerical meshes, 2.) solve the PDE and ODE systems required for MoFA model formulation and implementation, 3.) solve the PDE systems required to obtain fully-resolved simulation results for model verification, and 4.) compare and plot results (e.g., the model and fully-resolved simulation solutions, the error between the solutions, etc.).

Pietrzyk, KyleM [Lawrence Livermore National Labor↗

Calculation fo the Reflection and Transmission Coefficients for Gradual Tapered Waveguide Structures

It is required to find the reflection and transmission coefficients for a tapered waveguide. It is assumed that the taper is very long and gradual such that no higher order modes are excited from the discontinuity of the waveguide. Three different methods are presented for finding the reflection coefficient and two methods are presented for finding the transmission coefficient. A traditional differential equation method which finds only the reflection coefficient is presented. An additional set of differential equations are presented which finds both the reflection and transmission coefficients. A FEM (finite element method), which solves for both the reflection and transmission coefficients, is presented with its limitations. An example of a tapered coaxial line and waveguide is presented with the different methods compared and contrasted.

43 PARTICLE ACCELERATORS↗

Earth Filter Mathematica Toolbox V4 User’s Guide: Simplifying, Visualizing and Quick Modeling of All Fission Products from 60 Nuclear Sources

The Earth Filter Mathematica toolbox is a set of user-friendly routines that accurately calculate the ingrowth and decay of any of the 908 fission products for an infinite combination of sources over a large dynamic range and large time scales. This toolbox was developed by Dr. W. P. Brug at Los Alamos National Laboratory and eliminates the need for the user to define and solve differential equations by automatically scanning the ENDF-349 dataset and creating a complete set of differential equations (including delayed neutron branches to both the ground and metastable states) for every fission product. Additionally, this code allows the user to choose the data source for half-lives from several key references (i.e., TORI, IAEA, ENDF or NUDAT.) The complete set of ENDF-349 independent and cumulative fission yields for all 60 isotopic targets and 4 different neutron spectrums are included. This allows nearly any nuclear fission source to be accurately modeled as a linear combination of endpoint sources. The Earth Filter Toolbox has no limit as to the length of split list, and split lists of 5 or more endpoint sources can be quite common.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PolyODENet: Deriving mass-action rate equations from incomplete transient kinetics data

Kinetics of a reaction network that follows mass-action rate laws can be described with a system of ordinary differential equations (ODEs) with polynomial right-hand side. However, it is challenging to derive such kinetic differential equations from transient kinetic data without knowing the reaction network, especially when the data are incomplete due to experimental limitations. We introduce a program, PolyODENet, toward this goal. Based on the machine-learning method Neural ODE, PolyODENet defines a generative model and predicts concentrations at arbitrary time. As such, it is possible to include unmeasurable intermediate species in the kinetic equations. Importantly, we have implemented various measures to apply physical constraints and chemical knowledge in the training to regularize the solution space. Here, using simple catalytic reaction models, we demonstrate that PolyODENet can predict reaction profiles of unknown species and doing so even reveal hidden parts of reaction mechanisms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The extended auxiliary equation mapping method to determine novel exact solitary wave solutions of the nonlinear fractional PDEs

Abstract In this paper, some new nonlinear fractional partial differential equations (PDEs) have been considered.Three models are including the space-time fractional-order Boussinesq equation, space-time (2 + 1)-dimensional breaking soliton equations, and space-time fractional-order SRLW equation describe the behavior of these equations in the diverse applications. Meanwhile, the fractional derivatives in the sense of β -derivative are defined. Some fractional PDEs will convert to the considered ordinary differential equations by the help of transformation of β -derivative. These equations are analyzed utilizing an integration scheme, namely, the extended auxiliary equation mapping method. The different kinds of traveling wave solutions, solitary, topological, dark soliton, periodic, kink, and rational, fall out as a by-product of this scheme. Finally, the existence of the solutions for the constraint conditions is also shown. The outcome indicates that some fractional PDEs are used as a growing finding in the engineering sciences, mathematical physics, and so forth.

Engineering↗

Latent Neural ODE for Integrating Multi-Timescale Measurements in Smart Distribution Grids

Under a smart grid paradigm, there has been an increase in sensor installations to enhance situational awareness. The measurements from these sensors can be leveraged for real-time monitoring, control, and protection. However, these measurements are typically irregularly sampled. These measure-ments may also be intermittent due to communication bandwidth limitations. To tackle this problem, this paper proposes a novel latent neural ordinary differential equations (LODE) approach to aggregate the unevenly sampled multivariate time-series measurements. The proposed approach is flexible in performing both imputations and predictions while being computationally efficient. Simulation results on IEEE 37 bus test systems illustrate the efficiency of the proposed approach.

multi time-scale measurements↗

Leveraging Multitime Hamilton–Jacobi PDEs for Certain Scientific Machine Learning Problems

Hamilton-Jacobi partial differential equations (HJ PDEs) have deep connections with a wide range of fields, including optimal control, differential games, and imaging sciences. By considering the time variable to be a higher dimensional quantity, HJ PDEs can be extended to the multi-time case. In this paper, we establish a novel theoretical connection between specific optimization problems arising in machine learning and the multi-time Hopf formula, which corresponds to a representation of the solution to certain multi-time HJ PDEs. Through this connection, we increase the interpretability of the training process of certain machine learning applications by showing that when we solve these learning problems, we also solve a multi-time HJ PDE and, by extension, its corresponding optimal control problem. As a first exploration of this connection, we develop the relation between the regularized linear regression problem and the Linear Quadratic Regulator (LQR). We then leverage our theoretical connection to adapt standard LQR solvers (namely, those based on the Riccati ordinary differential equations) to design new training approaches for machine learning. Lastly, we provide some numerical examples that demonstrate the versatility and possible computational advantages of our Riccati-based approach in the context of continual learning, post-training calibration, transfer learning, and sparse dynamics identification.

97 MATHEMATICS AND COMPUTING↗

PolyODENet

Kinetics of a reaction network that follows mass-action rate laws can be described with a system of ordinary differential equations (ODEs) with polynomial right-hand side. However, it is challenging to derive such kinetic differential equations from transient kinetic data without knowing the reaction network, especially when the data are incomplete due to experimental limitations. We introduce a program, PolyODENet, toward this goal. Based on the machine-learning method Neural ODE, PolyODENet defines a generative model and predicts concentrations at arbitrary time. As such, it is possible to include unmeasurable intermediate species in the kinetic equations. Importantly, we have implemented various measures to apply physical constraints and chemical knowledge in the training to regularize the solution space.

Wu, Qin [Brookhaven National Lab. (BNL), Upton, NY↗

Black and gray box learning of amplitude equations: Application to phase field systems

Here, we present a data-driven approach to learning surrogate models for amplitude equations and illustrate its application to interfacial dynamics of phase field systems. In particular, we demonstrate learning effective partial differential equations describing the evolution of phase field interfaces from full phase field data. We illustrate this on a model phase field system, where analytical approximate equations for the dynamics of the phase field interface (a higher-order eikonal equation and its approximation, the Kardar-Parisi-Zhang equation) are known. For this system, we discuss data-driven approaches for the identification of equations that accurately describe the front interface dynamics. When the analytical approximate models mentioned above become inaccurate, as we move beyond the region of validity of the underlying assumptions, the data-driven equations outperform them. In these regimes, going beyond black box identification, we explore different approaches to learning data-driven corrections to the analytically approximate models, leading to effective gray box partial differential equations.

42 ENGINEERING↗