Search NASA⌕ Search

SEARCH · Search NASA

Results for “ODE”

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 253 records · Page 14

Fast estimation of reaction rates in spherical and non-spherical porous catalysts

Here we present a methodology for modeling multi-step reaction rates in porous catalyst particles for use in CFD-DEM and two fluid models. Single-step effectiveness factors based on a Thiele modulus, while useful, cannot accurately capture the cascading reaction systems common in high temperature vapor-phase chemical reactors like fluidized catalytic cracking units and catalytic biomass fast pyrolysis systems. Instead, multi-step effectiveness vectors derived from steady-state solutions to the governing reaction-diffusion equations are needed. Solutions for various catalyst shapes are presented, including spheres, cylinders, and prisms. Computational challenges inherent in repeated evaluation of reaction rates with diffusion limitations are discussed, and an efficient implementation based on pre-computed lookup tables is proposed and demonstrated on a simulation of a fluidized bed reactor. Open-source code is provided for the compilation of reaction rate tables for use in ODE, DEM, and two-fluid models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-order, linearly stable, partitioned solvers for general multiphysics problems based on implicit–explicit Runge–Kutta schemes

This work introduces a general framework for constructing high-order, linearly stable, partitioned solvers for multiphysics problems from a monolithic implicit–explicit Runge–Kutta (IMEX-RK) discretization of the semi-discrete equations. The generic multiphysics problem is modeled as a system of n systems of partial differential equations where the i th subsystem is coupled to the other subsystems through a coupling term that can depend on the state of all the other subsystems. This coupled system of partial differential equations reduces to a coupled system of ordinary differential equations via the method of lines where an appropriate spatial discretization is applied to each subsystem. The coupled system of ordinary differential equations is taken as a monolithic system and discretized using an IMEX-RK discretization with a specific implicit–explicit decomposition that introduces the concept of a predictor for the coupling term. We propose four coupling predictors that enable the monolithic system to be solved in a partitioned manner, i.e., subsystem-by-subsystem, and preserve the IMEX-RK structure and therefore the design order of accuracy of the monolithic scheme. The four partitioned solvers that result from these predictors are high-order accurate, allow for maximum re-use of existing single-physics software, and two of the four solvers allow the subsystems to be solved in parallel at a given stage and time step. We also analyze the stability of a coupled, linear model problem with a specific coupling structure and show that one of the partitioned solvers achieves unconditional linear stability for this problem, while the others are unconditionally stable only for certain values of the coupling strength. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems including a simple linear system of ODEs, advection–diffusion–reaction systems, fluid–structure interaction problems, and particle-laden flows, where we verify the design order of the IMEX schemes and study various stability properties.

97 MATHEMATICS AND COMPUTING↗

Combining DPG in space with DPG time-marching scheme for the transient advection–reaction equation

In this article, we present a general methodology to combine the Discontinuous Petrov–Galerkin (DPG) method in space and time in the context of methods of lines for transient advection–reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). Further, we also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection–reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.

42 ENGINEERING↗

Surrogate construction via weight parameterization of residual neural networks

Surrogate model development is a critical step for uncertainty quantification or other sample-intensive tasks for complex computational models. Here, in this work, we develop a multi-output surrogate form using a class of neural networks (NNs) that employ shortcut connections, namely Residual NNs (ResNets). ResNets are known to regularize the surrogate learning problem and improve the efficiency and accuracy of the resulting surrogate. Inspired by the continuous, Neural ODE analogy, we augment ResNets with weight parameterization strategy with respect to ResNet depth. Weight-parameterized ResNets regularize the NN surrogate learning problem and allow better generalization with a drastically reduced number of learnable parameters. We demonstrate that weight-parameterized ResNets are more accurate and efficient than conventional feed-forward multi-layer perceptron networks. We also compare various options for parameterization of the weights as functions of ResNet depth. We demonstrate the results on both synthetic examples and a large scale earth system model of interest.

97 MATHEMATICS AND COMPUTING↗

Linear eddy mixing based tabulation and artificial neural networks for large eddy simulations of turbulent flames

A large eddy simulation (LES) sub-grid model is developed based on the artificial neural network (ANN) approach to calculate the species instantaneous reaction rates for multi-step, multi-species chemical kinetics mechanisms. The proposed methodology depends on training the ANNs off-line on a thermo-chemical database representative of the actual composition and turbulence (but not the actual geometrical problem) of interest, and later using them to replace the stiff ODE solver (direct integration (DI)) to calculate the reaction rates in the sub-grid. The thermo-chemical database is tabulated with respect to the thermodynamic state vector without any reduction in the number of state variables. The thermo-chemistry is evolved by stand-alone linear eddy mixing (LEM) model simulations under both premixed and non-premixed conditions, where the unsteady interaction of turbulence with chemical kinetics is included as a part of the training database. The proposed methodology is tested in LES and in stand-alone LEM studies of three distinct test cases with different reduced mechanisms and conditions. LES of premixed flame-turbulence-vortex interaction provides direct comparison of the proposed ANN method against DI and ANNs trained on thermo-chemical database created using another type of tabulation method. It is shown that the ANN trained on the LEM database can capture the correct flame physics with accuracy comparable to DI, which cannot be achieved by ANN trained on a laminar premix flame database. A priori evaluation of the ANN generality within and outside its training domain is carried out using stand-alone LEM simulations as well. Results in general are satisfactory, and it is shown that the ANN provides considerable amount of memory saving and speed-up with reasonable and reliable accuracy. The speed-up is strongly affected by the stiffness of the reduced mechanism used for the computations, whereas the memory saving is considerable regardless. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

State space parameterization of explosive eigenvalues during autoignition

Explosive modes such as ignition and extinction are characterized by an eigenvalue of the chemical Jacobian matrix with positive real part, representing the transient instability of chain-branching chemistry and thermal feedback. Formation and eigen-decomposition of the Jacobian matrix are expensive operations whose cost increases cubically with chemical mechanism size. As an alternative to directly computing the eigenvalues of the Jacobian, we explore principal component analysis (PCA) along with nonlinear regression as a methodology to parameterize the eigenvalues by state variables (or linear combinations thereof). We evaluate this modeling strategy using homogeneous autoignition data on two different applications: pseudotransient continuation (Ψtc)-based ODE solvers and chemical explosive mode analysis (CEMA). Results indicate that the PCA-based parameterization of the eigenvalues appears feasible for Ψtc solvers in autoignition calculations over a range of temperatures and pressures. Our results also show that eigenvalue models are capable of tracking sharp discontinuities (such as ignition or extinction) in the eigenvalue for computational flame diagnostics such as CEMA.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗

Learning subgrid-scale models with neural ordinary differential equations

We propose a new approach to learning the subgrid-scale model when simulating partial differential equations (PDEs) solved by the method of lines and their representation in chaotic ordinary differential equations, based on neural ordinary differential equations (NODEs). Solving systems with fine temporal and spatial grid scales is an ongoing computational challenge, and closure models are generally difficult to tune. Machine learning approaches have increased the accuracy and efficiency of computational fluid dynamics solvers. In this approach neural networks are used to learn the coarse- to fine-grid map, which can be viewed as subgrid-scale parameterization. We propose a strategy that uses the NODE and partial knowledge to learn the source dynamics at a continuous level. Our method inherits the advantages of NODEs and can be used to parameterize subgrid scales, approximate coupling operators, and improve the efficiency of low-order solvers. Numerical results with the two-scale Lorenz 96 ODE, the convection-diffusion PDE, and the viscous Burgers' PDE are used to illustrate this approach.

97 MATHEMATICS AND COMPUTING↗

High order interpolation of magnetic fields with vector potential reconstruction for particle simulations

We propose a method for interpolating divergence-free continuous magnetic fields via vector potential reconstruction using Hermite interpolation, which ensures high-order continuity for applications requiring adaptive, high-order ordinary differential equation (ODE) integrators, such as the Dormand-Prince method. The method provides C(m) continuity and achieves high-order accuracy, making it particularly suited for particle trajectory integration and Poincaré section analysis under optimal integration order and timestep adjustments. Through numerical experiments, we demonstrate that the Hermite interpolation method preserves volume and continuity, which are critical for conserving toroidal canonical momentum and magnetic moment in guiding center simulations, especially over long-term trajectory integration. Furthermore, we analyze the impact of insufficient derivative continuity on Runge-Kutta schemes and show how it degrades accuracy at low error tolerances, introducing discontinuity-induced truncation errors. Lastly, we demonstrate performant Poincaré section analysis in two relevant settings of field data collocated from finite element meshes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

High order finite difference methods with subcell resolution for advection equations with stiff source terms

A new high order finite-difference method utilizing the idea of Harten ENO subcell resolution method is proposed for chemical reactive flows and combustion. In reaction problems, when the reaction time scale is very small, e.g., orders of magnitude smaller than the fluid dynamics time scales, the governing equations will become very stiff. Wrong propagation speed of discontinuity may occur due to the underresolved numerical solution in both space and time. The present proposed method is a modified fractional step method which solves the convection step and reaction step separately. In the convection step, any high order shock-capturing method can be used. In the reaction step, an ODE solver is applied but with the computed flow variables in the shock region modified by the Harten subcell resolution idea. For numerical experiments, a fifth-order finite-difference WENO scheme and its anti-diffusion WENO variant are considered. A wide range of 1D and 2D scalar and Euler system test cases are investigated. Studies indicate that for the considered test cases, the new method maintains high order accuracy in space for smooth flows, and for stiff source terms with discontinuities, it can capture the correct propagation speed of discontinuities in very coarse meshes with reasonable CFL numbers.

97 MATHEMATICS AND COMPUTING↗

Tau leaping of stiff stochastic chemical systems via local central limit approximation

Stiffness manifests in stochastic dynamic systems in a more complex manner than in deterministic systems; it is not only important for a time-stepping method to remain stable but it is also important for the method to capture the asymptotic variances accurately. In the context of stochastic chemical systems, time stepping methods are known as tau leaping. Well known existing tau leaping methods have shortcomings in this regard. The implicit tau method is far more stable than the trapezoidal tau method but underestimates the asymptotic variance. On the other hand, the trapezoidal tau method which estimates the asymptotic variance exactly for linear systems suffers from the fact that the transients of the method do not decay fast enough in the context of very stiff systems. We propose a tau leaping method that possesses the same stability properties as the implicit method while it also captures the asymptotic variance with reasonable accuracy at least for the test system S{sub 1}↔S{sub 2}. The proposed method uses a central limit approximation (CLA) locally over the tau leaping interval and is referred to as the LCLA-τ. The CLA predicts the mean and covariance as solutions of certain differential equations (ODEs) and for efficiency we solve these using a single time step of a suitable low order method. We perform a mean/covariance stability analysis of various possible low order schemes to determine the best scheme. Numerical experiments presented show that LCLA-τ performs favorably for stiff systems and that the LCLA-τ is also able to capture bimodal distributions unlike the CLA itself. The proposed LCLA-τ method uses a split implicit step to compute the mean update. We also prove that any tau leaping method employing a split implicit step converges in the fluid limit to the implicit Euler method as applied to the fluid limit differential equation.

97 MATHEMATICS AND COMPUTING↗

Semi-global approach for propagation of the time-dependent Schrödinger equation for time-dependent and nonlinear problems

A detailed exposition of highly efficient and accurate method for the propagation of the time-dependent Schrödinger equation is presented. The method is readily generalized to solve an arbitrary set of ODE's. The propagation is based on a global approach, in which large time-intervals are treated as a whole, replacing the local considerations of the common propagators. The new method is suitable for various classes of problems, including problems with a time-dependent Hamiltonian, nonlinear problems, non-Hermitian problems and problems with an inhomogeneous source term. In this paper, a thorough presentation of the basic principles of the propagator is given. We give also a special emphasis on the details of the numerical implementation of the method. For the first time, we present the application for a non-Hermitian problem by a numerical example of a one-dimensional atom under the influence of an intense laser field. The efficiency of the method is demonstrated by a comparison with the common Runge–Kutta approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adjoint sensitivity analysis of chaotic dynamical systems with non-intrusive least squares shadowing

This paper presents a discrete adjoint version of the recently developed non-intrusive least squares shadowing (NILSS) algorithm, which circumvents the instability that conventional adjoint methods encounter for chaotic systems. The NILSS approach involves solving a smaller minimization problem than other shadowing approaches and can be implemented with only minor modifications to preexisting tangent and adjoint solvers. Adjoint NILSS is demonstrated on a small chaotic ODE, a one-dimensional scalar PDE, and a direct numerical simulation (DNS) of the minimal flow unit, a turbulent channel flow on a small spatial domain. This is the first application of an adjoint shadowing-based algorithm to a three-dimensional turbulent flow. - Highlights: • A discrete adjoint non-intrusive least squares shadowing (NILSS) is presented. • The NILSS approach is closely related to multiple shooting shadowing (MSS). • Adjoint NILSS prevents exponential growth in time of the adjoint field. • Adjoint NILSS is demonstrated on a simulation of wall-bounded turbulent flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gaussian wave packet transform based numerical scheme for the semi-classical Schrödinger equation with random inputs

In this work, we study the semi-classical limit of the Schrödinger equation with random inputs, and show that the semi-classical Schrödinger equation produces O(ε) oscillations in the random variable space. With the Gaussian wave packet transform, the original Schrödinger equation is mapped to an ordinary differential equation (ODE) system for the wave packet parameters coupled with a partial differential equation (PDE) for the quantity w in rescaled variables. Further, we show that the w equation does not produce ε dependent oscillations, and thus it is more amenable for numerical simulations. We propose multi-level sampling strategy in implementing the Gaussian wave packet transform, where in the most costly part, i.e. simulating the w equation, it is sufficient to use ε independent samples. We also provide extensive numerical tests as well as meaningful numerical experiments to justify the properties of the numerical algorithm, and hopefully shed light on possible future directions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Flow-driven spectral chaos (FSC) method for simulating long-time dynamics of arbitrary-order non-linear stochastic dynamical systems

Uncertainty quantification techniques such as the time-dependent generalized polynomial chaos (TD-gPC) use an adaptive orthogonal basis to better represent the stochastic part of the solution space (aka random function space) in time. However, because the random function space is constructed using tensor products, TD-gPC-based methods are known to suffer from the curse of dimensionality. Here, we introduce a new numerical method called the flow-driven spectral chaos (FSC) which overcomes this curse of dimensionality at the random-function-space level. The proposed method is not only computationally more efficient than existing TD-gPC-based methods but is also far more accurate. The FSC method uses the concept of enriched stochastic flow maps to track the evolution of a finite-dimensional random function space efficiently in time. To transfer the probability information from one random function space to another, two approaches are developed and studied herein. In the first approach, the probability information is transferred in the mean-square sense, whereas in the second approach the transfer is done exactly using a new theorem that was developed for this purpose. The FSC method can quantify uncertainties with high fidelity, especially for the long-time response of stochastic dynamical systems governed by ODEs of arbitrary order. Six representative numerical examples, including a nonlinear problem (the Van-der-Pol oscillator), are presented to demonstrate the performance of the FSC method and corroborate the claims of its superior numerical properties. Finally, a parametric, high-dimensional stochastic problem is used to demonstrate that when the FSC method is used in conjunction with Monte Carlo integration, the curse of dimensionality can be overcome altogether.

(nonlinear) stochastic dynamical systems↗

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↗

Long-time integration of parametric evolution equations with physics-informed DeepONets

Ordinary and partial differential equations (ODEs/PDEs) play a paramount role in analyzing and simulating complex dynamic processes across all corners of science and engineering. In recent years machine learning tools are aspiring to introduce new effective ways of simulating such equations, however existing approaches are not able to reliably return stable and accurate predictions across long temporal horizons. We aim to address this challenge by introducing an effective framework for learning evolution operators that map random initial conditions to associated ODE/PDE solutions within a short time interval. Such operators can be parametrized by deep neural networks that are trained in an entirely self-supervised manner without requiring one to generate any paired input-output observations. Global long-time predictions across a range of initial conditions can be then obtained by iteratively evaluating the trained model using each prediction as the initial condition for the next evaluation step. Here, this introduces a new approach to temporal domain decomposition that is shown to be effective in performing accurate long-time simulations for a wide range of parametric ODE and PDE systems, from wave propagation, to reaction-diffusion dynamics and stiff chemical kinetics, introducing a new way of rapidly emulating non-equilibrium processes in science and engineering.

97 MATHEMATICS AND COMPUTING↗

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↗