Search NASA⌕ Search

SEARCH · Search NASA

Results for “ordinary 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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↗
DOE OSTI2022

Simulation of crumpled sheets via alternating quasistatic and dynamic representations

In this work, we present a method for simulating the large-scale deformation and crumpling of thin, elastoplastic sheets. Motivated by the physical behavior of thin sheets during crumpling, two different formulations of the governing equations of motion are used: (1) a quasistatic formulation that effectively describes smooth deformations, and (2) a fully dynamic formulation that captures large changes in the sheet's velocity. The former is a differential-algebraic system of equations integrated implicitly in time, while the latter is a set of ordinary differential equations (ODEs) integrated explicitly. We adopt a hybrid integration scheme to adaptively alternate between the quasistatic and dynamic representations as appropriate. Further, we demonstrate the capacity of this method to effectively simulate a variety of crumpling phenomena. Finally, we show that statistical properties, notably the accumulation of creases under repeated loading, as well as the area distribution of facets, are consistent with experimental observations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Scale Invariance of the Homentropic Inviscid Euler Equations with Application to the Noh Problem

We investigate the inviscid compressible flow (Euler) equations constrained by an ”isentropic” equation of state (EOS), whose functional form in pressure is an arbitrary function of density alone. Under the aforementioned condition, we interrogate using symmetry methods the scale-invariance of the homentropic inviscid Euler equations. We find that under general conditions, we can reduce the inviscid Euler equations into a system of two coupled ordinary differential equations. To exemplify the utility of these results, we formulate two example scale-invariant, self-similar solutions. The first example includes a shock-free expanding bubble scenario, featuring a modified Tait EOS. The second example features the classical Noh problem, coupled to an arbitrary isentropic EOS. In this case, in order to satisfy the conditions set forth in the classical Noh problem, we find that the solution for the flow is given by a transcendental algebraic equation in the shocked density.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improving ADAM through an implicit-explicit (IMEX) time-stepping approach

The ADAM optimizer, often used in machine learning for neural network training, corresponds to an underlying ordinary differential equation (ODE) in the limit of very small learning rates. Here, this work shows that the classical ADAM algorithm is a first-order implicit-explicit (IMEX) Euler discretization of the underlying ODE. Employing the time discretization point of view, we propose new extensions of the ADAM scheme obtained by using higher-order IMEX methods to solve the ODE. Based on this approach, we derive a new optimization algorithm for neural network training that performs better than classical ADAM on several regression and classification problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Uncertainty quantification of graph convolution neural network models of evolving processes

The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Patient-Specific Mathematical Model of the Clear Cell Renal Cell Carcinoma Microenvironment

The interactions between cells and molecules in the tumor microenvironment can give insight into the initiation and progression of tumors and their optimal treatment options. In this paper, we developed an ordinary differential equation (ODE) mathematical model of the interaction network of key players in the clear cell renal cell carcinoma (ccRCC) microenvironment. We then performed a global gradient-based sensitivity analysis to investigate the effects of the most sensitive parameters of the model on the number of cancer cells. The results indicate that parameters related to IL-6 have high a impact on cancer cell growth, such that decreasing the level of IL-6 can remarkably slow the tumor’s growth.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

An ODE-Enabled Distributed Transient Stability Analysis for Networked Microgrids

Networked microgrid (NMG) exhibits noteworthy resiliency and flexibility benefits for the mutual support from neighboring microgrids. With high penetration of distributed energy resources (DERs) and the associated controls, the transient stability analysis of NMGs is of critical significance. To address the issues of computation burdens and privacy in the centralized transient analysis, this paper devises an ordinary differential equation (ODE)-enabled distributed transient stability (DTS) methodology for NMGs. First, an ODE-based microgrid model is established to capture the dynamics in the droop control of DERs as well as network and load. Further, a distributed DTS is devised for the ODE representation of an NMG, allowing a privacy-preserving transient analysis of each microgrid while accurately reconstructing the frequency dynamics under droop controls in all DERs. In conclusion, extensive tests are performed to verify the validity of the ODE-based microgrid model through both dynamic response and eigenvalue analysis, and the efficacy of the DTS algorithm in simulating the large signal responses and the frequent fluctuations in NMG.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Discrete Empirical Interpolation Method Based Dynamic Load Model Reduction

Dynamic load models add significant complexity to bulk power system time-domain simulations. The complexity is due to the large number of ordinary differential equations (ODEs) introduced by the dynamic load components such as induction motors. It is challenging to derive reduced-order models (ROMs) for dynamic loads due to the nonlinear functions in their governing equations. This paper applies the discrete empirical interpolation method enhanced proper orthogonal decomposition (DEIM-POD) to approximate the full dynamic load model with the ROM that minimizes the projection error of the nonlinear functions in dynamic load ODEs onto their dominant modes. This approach only requires evaluation of nonlinear functions at selected observation points. The observation points selected by DEIM also provide information for screening critical load buses where dynamic load model parameters contribute the most to the accuracy of ROM across multiple contingencies. The proposed approach is validated on IEEE 9-bus, WECC 179-bus and 2384-bus Polish systems.

bulk power system↗
DOE OSTI2026

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↗
DOE OSTI2020

Data-driven selection of stiff chemistry ODE solver in operator-splitting schemes

Most computational fluid dynamics simulations of practical combustion applications employ operator-splitting schemes, where chemistry and transport are separated and integrated with distinct numerical methods. The changes in composition due to chemistry are evaluated by solving ordinary differential equations (ODE) in each cell of the computational domain, which typically dominates the computational cost when detailed chemistry is considered. In this work, a data-driven approach for the selection of chemistry ODE solvers in operator-splitting schemes is presented. Neural networks are used to predict the ODE solvers CPU times and errors for a given thermochemical state. This allows the selection of an optimal ODE solver on a cell-by-cell, timestep-by-timestep basis. The models are trained using a wide set of thermochemical states generated through partially-stirred reactors and flames simulations. The methodology is validated by quantifying the prediction errors, the classification accuracy, and the computational speedup. The model predicts the optimal ODE solver for 70 to 95% of the validation cases and decreases the computional cost by a factor of 3 or more. The generalizability of the methodology to different chemical mechanisms and different fuels is assessed and it is shown that the model’s performance is only slightly degraded and its applicability is significantly enhanced if the inputs to the neural networks are restricted to a small set of thermochemical state variables present in most chemical mechanisms. In conclusion, the models are used in an homogeneous reactor case and a multi-dimensional CFD simulation of a diesel spray at high pressure where a speedup of more than 3 is achieved.

42 ENGINEERING↗
DOE OSTI2020

Quantum Spectral Methods for Differential Equations

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ϵ with complexity poly(log(1/ϵ)), no such algorithm was previously known for differential equations with time-dependent coefficients. In this work, we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd, log(1/ϵ)).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Operator evolution from the similarity renormalization group and the Magnus expansion

The Magnus expansion is an efficient alternative to solving similarity renormalization group (SRG) flow equations with high-order, memory-intensive ordinary differential equation solvers. The numerical simplifications it offers for operator evolution are particularly valuable for in-medium SRG calculations, though challenges remain for difficult problems involving intruder states. Here we test the Magnus approach in an analogous but more accessible situation, which is the free-space SRG treatment of the spurious bound states arising from a leading-order chiral effective field theory (EFT) potential with very high cutoffs. In this work, we show that the Magnus expansion passes these tests and then use the investigations as a springboard to address various aspects of operator evolution that have renewed relevance in the context of the scale and scheme dependence of nuclear processes. These aspects include SRG operator flow with band- versus block-diagonal generators, universality for chiral EFT Hamiltonians and associated operators with different regularization schemes, and the impact of factorization arising from scale separation. Implications for short-range correlations physics and the possibilities for reconciling high- and low-resolution treatments of nuclear structure and reactions are discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Dual Representations and H ∞ -Optimal Control of Partial Differential Equations

We consider H ∞ -optimal state-feedback control of the class of linear Partial Differential Equations (PDEs) which admit a Partial Integral Equation (PIE) representation. While linear matrix inequalities are commonly used for optimal control of Ordinary Differential Equations (ODEs), the absence of a universal state-space representation and suitable dual form prevents such methods from being applied to optimal control of PDEs. Specifically, for ODEs, the controller synthesis problem is defined in state-space, and duality is used to resolve the bilinearity of that synthesis problem. Recently, the PIE representation was proposed as a universal state-space representation for linear PDE systems. In this paper, we show that any PDE system represented by a PIE admits a dual PIE with identical stability and I/O properties. This result allows us to reformulate the stabilizing and optimal state-feedback control problems as convex optimization over the cone of positive Partial Integral (PI) operators. Operator inversion formulae then allow us to construct feedback gains for the original PDE system. The results are verified through application to several canonical problems in optimal control of PDEs and indicate the resulting bounds on H ∞ norm are not conservative.

42 ENGINEERING↗
DOE OSTI2021

Vibration-Based Sensor Design: A Grey-Box Approach

Knowledge of the internal structure of an object or device under investigation proceeds from the basic idea of constructing its dynamic behavioral relations governed by a set of differential/algebraic equations that characterize its response. These equations can be partial differential equations leading to finite element or finite difference relations requiring a complex numerical solution on a super computer or ordinary differential equations requiring sophisticated numerical integration techniques to obtain the desired solution. Discrete dynamic systems evolving from digitized data acquisition are typically captured by sampled-data (continuous-to-discrete) representations characterized by a set of difference equations specifying the underlying system dynamics. In any case, with a mathematical description in hand, Grey-Box modeling techniques have evolved, concerned with the estimation of model parameters embedded in a prescribed set of equations (the system) governing its behavior, while capturing the underlying physical phenomenology of the problem at hand.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A stochastic solver based on the residence time algorithm for crystal plasticity models

Abstract The deformation of crystalline materials by dislocation motion takes place in discrete amounts determined by the Burgers vector. Dislocations may move individually or in bundles, potentially giving rise to intermittent slip. This confers plastic deformation with a certain degree of variability that can be interpreted as being caused by stochastic fluctuations in dislocation behavior. However, crystal plasticity (CP) models are almost always formulated in a continuum sense, assuming that fluctuations average out over large material volumes and/or cancel out due to multi-slip contributions. Nevertheless, plastic fluctuations are known to be important in confined volumes at or below the micron scale, at high temperatures, and under low strain rate/stress deformation conditions. Here, we develop a stochastic solver for CP models based on the residence-time algorithm that naturally captures plastic fluctuations by sampling among the set of active slip systems in the crystal. The method solves the evolution equations of explicit CP formulations, which are recast as stochastic ordinary differential equations and integrated discretely in time. The stochastic CP model is numerically stable by design and naturally breaks the symmetry of plastic slip by sampling among the active plastic shear rates with the correct probability. This can lead to phenomena such as intermittent slip or plastic localization without adding external symmetry-breaking operations to the model. The method is applied to body-centered cubic tungsten single crystals under a variety of temperatures, loading orientations, and imposed strain rates.

42 ENGINEERING↗
DOE OSTI2021

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗
DOE OSTI2025

From clutter to clarity: Emergent neural operators via questionnaire metrics

Real-world datasets in chemical engineering and bioengineering processes—such as those from catalytic reactors, multiphase flows, polymerization reactors, bioreactors, and clinical trials—can often be unlabeled or disorganized, rendering the training of existing supervised learning models ineffective at learning the underlying dynamics. To salvage these datasets for decision-making, we first seek to obtain clarity from the cluttered data. Here, we present a framework for developing “structural” generative models, discovering emergent equations, and constructing efficient emulators from scrambled datasets by integrating unsupervised organizational learning techniques (Questionnaires) with advanced deep learning architectures (Deep Hidden Physics Models and Deep Operator Networks). Our approach is demonstrated on two illustrative model systems: (a) a 1D advection–diffusion partial differential equation representing a winding underground pipe and (b) an ensemble of Stuart–Landau oscillators, an agent-based system of coupled ordinary differential equations. In both cases, we successfully reconstruct meaningful spatial, temporal, and parameter embeddings from scrambled data, enabling good predictions of system dynamics. As a result, we highlight the framework’s potential for broader applications, enabling data-driven system identification in fields with inherently disorganized or hidden parameter spaces.

42 ENGINEERING↗