Numerical solution of a coupled PDE and ODE system in nonlinear aeroelasticity.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is {sup 98}Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)
Efficient and accurate ordinary differential equation (ODE) solvers are necessary for powertrain and vehicle dynamics modeling. However, current commercial ODE solvers can be financially prohibitive, leading to a need for accessible, effective, open-source ODE solvers designed for powertrain modeling. Rust is a compiled programming language that has the potential to be used for fast and easy-to-use powertrain models, given its exceptional computational performance, robust package ecosystem, and short time required for modelers to become proficient. However, of the three commonly used (>3,000 downloads) packages in Rust with ODE solver capabilities, only one has more than four numerical methods implemented, and none are designed specifically for modeling physical systems. Therefore, the goal of the Differential Equation System Solver (DESS) was to implement accurate ODE solvers in Rust designed for the component-based problems often seen in powertrain modeling. DESS is a text-based software package that provides a flexible framework for building and solving systems of ODEs. This allows DESS to be included as a dependency for automotive powertrain models that require a variety of solvers and solver configurations. Seven explicit ODE solver methods have been implemented in DESS: Euler’s, Heun’s, midpoint, Ralston’s, classic Runge-Kutta, Bogacki-Shampine, and Cash-Karp. These represent five fixed-step methods and two adaptive-step methods. This paper shows that the solver implementations increase accuracy and computational efficiency compared to Euler's method when modeling a system of three thermal masses in Rust. DESS also includes features designed for modeling component-based physical systems. Users can define relationships between nodes in their system, which the package then translates into a system of equations, leading to simpler and more intuitive code. In the case of a three-thermal-mass system, the user can specify node thermal properties (e.g., thermal capacitance), how nodes are interconnected, and thermal conductance between nodes rather than providing a system of equations. The core contribution from this work is an open-source, text-based Rust package with ODE solvers for automotive powertrain modeling to support cost-free, fast, and accurate simulation.
In this study, we present a novel multiscale computational framework for efficiently linking multiple lower-dimensional models describing the distal lung mechanics to imaging-based 3D computational fluid dynamics (CFDs) models of the upper pulmonary airways in order to incorporate physiologically appropriate outlet boundary conditions. The framework is an extension of the modified Newton’s method with nonlinear Krylov accelerator developed by Carlson and Miller [1], Miller [2] and Scott and Fenves [3]. Our extensions include the retention of subspace information over multiple timesteps, and a special correction at the end of a timestep that allows for corrections to be accepted with verified low residual with as little as a single residual evaluation per timestep on average. In the case of a single residual evaluation per timestep, the method has zero additional computational cost compared to uncoupled or unidirectionally coupled simulations. We expect these enhancements to be generally applicable to other multiscale coupling applications where timestepping occurs. In addition we have developed a “pressure-drop” residual which allows for stable coupling of flows between a 3D incompressible CFD application and another (lower-dimensional) fluid system. We expect this residual to also be useful for coupling non-respiratory incompressible fluid applications, such as multiscale simulations involving blood flow. The lower-dimensional models that are considered in this study are sets of simple ordinary differential equations (ODEs) representing the compliant mechanics of symmetric human pulmonary airway trees. To validate the method, we compare the predictions of hybrid CFD–ODE models against an ODE-only model of pulmonary airflow in an idealized geometry. Subsequently, we couple multiple sets of ODEs describing the distal lung to an imaging-based human lung geometry. Boundary conditions in these models consist of atmospheric pressure at the mouth and intrapleural pressure applied to the multiple sets of ODEs. In both the simplified geometry and in the imaging-based geometry, the performance of the method was comparable to that of monolithic schemes, in most cases requiring only a single CFD evaluation per time step. Thus, this new accelerator allows us to begin combining pulmonary CFD models with lower-dimensional models of pulmonary mechanics with little computational overhead. Moreover, because the CFD and lower-dimensional models are totally separate, this framework affords great flexibility in terms of the type and breadth of the adopted lower-dimensional model, allowing the biomedical researcher to appropriately focus on model design. Research funded by the National Heart and Blood Institute Award 1RO1HL073598.
The neural ordinary differential equation (ODE) framework has shown considerable promise in recent years in developing highly accelerated surrogate models for complex physical systems characterized by partial differential equations (PDEs). For PDE-based systems, state-of-the-art neural ODE strategies leverage a two-step procedure to achieve this acceleration: a nonlinear dimensionality reduction step provided by an autoencoder, and a time integration step provided by a neural-network based model for the resultant latent space dynamics (the neural ODE). This work explores the applicability of such autoencoder-based neural ODE strategies for PDEs in which advection terms play a critical role. More specifically, alongside predictive demonstrations, physical insight into the sources of model acceleration (i.e., how the neural ODE achieves its acceleration) is the scope of the current study. Such investigations are performed by quantifying the effects of both autoencoder and neural ODE components on latent system time-scales using eigenvalue analysis of dynamical system Jacobians. To this end, the sensitivity of various critical training parameters – de-coupled versus end-to-end training, latent space dimensionality, and the role of training trajectory length, for example – to both model accuracy and the discovered latent system timescales is quantified. Furthermore, this work specifically uncovers the key role played by the training trajectory length (the number of rollout steps in the loss function during training) on the latent system timescales: larger trajectory lengths correlate with an increase in limiting neural ODE time-scales, and optimal neural ODEs are found to recover the largest time-scales of the full-order (ground-truth) system. Demonstrations are performed across fundamentally different unsteady fluid dynamics configurations influenced by advection: (1) the Kuramoto–Sivashinsky equations (2) Hydrogen-Air channel detonations (the compressible reacting Navier–Stokes equations with detailed chemistry), and (3) 2D Atmospheric flow.
Neural Ordinary Differential Equations (ODEs) are a promising approach to learn dynamical models from time-series data in science and engineering applications. This work aims at learning neural ODEs for stiff systems, which are usually raised from chemical kinetic modeling in chemical and biological systems. We first show the challenges of learning neural ODEs in the classical stiff ODE systems of Robertson’s problem and propose techniques to mitigate the challenges associated with scale separations in stiff systems. We then present successful demonstrations in stiff systems of Robertson’s problem and an air pollution problem. The demonstrations show that the usage of deep networks with rectified activations, proper scaling of the network outputs as well as loss functions, and stabilized gradient calculations are the key techniques enabling the learning of stiff neural ODEs. The success of learning stiff neural ODEs opens up possibilities of using neural ODEs in applications with widely varying time-scales, such as chemical dynamics in energy conversion, environmental engineering, and life sciences.
We consider semidiscrete ODE models of single-phase fluids and two-fluid mixtures. In the presence of multiple fine-scale heterogeneities, the size of these ODE systems can be very large. Spatial averaging is then a useful tool for reducing computational complexity of the problem. The averages satisfy exact balance equations of mass, momentum, and energy. These equations do not form a satisfactory continuum model because evaluation of stress and heat flux requires solving the underlying ODEs. To produce continuum equations that can be simulated without resolving microscale dynamics, we recently proposed a closure method based on the use of regularized deconvolution. Here we continue the investigation of deconvolution closure with the long term objective of developing consistent computational upscaling for multiphase particle methods. The structure of the fine-scale particle solvers is reminiscent of molecular dynamics. For this reason we use nonlinear averaging introduced for atomistic systems by Noll, Hardy, and Murdoch-Bedeaux. We also consider a simpler linear averaging originally developed in large eddy simulation of turbulence. We present several simple but representative examples of spatially averaged ODEs, where the closure error can be analyzed. Based on this analysis we suggest a general strategy for reducing the relative error of approximate closure. For problems with periodic highly oscillatory material parameters we propose a spectral boosting technique that augments the standard deconvolution and helps to correctly account for dispersion effects. We also conduct several numerical experiments, one of which is a complete mesoscale simulation of a stratified two-fluid flow in a channel. In this simulation, the operation count per coarse time step scales sublinearly with the number of particles.
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.
Abstract In biokinetic modeling systems employed for radiation protection, biological retention and excretion have been modeled as a series of discretized compartments representing the organs and tissues of the human body. Fractional retention and excretion in these organ and tissue systems have been mathematically governed by a series of coupled first-order ordinary differential equations (ODEs). The coupled ODE systems comprising the biokinetic models are usually stiff due to the severe difference between rapid and slow transfers between compartments. In this study, the capabilities of solving a complex coupled system of ODEs for biokinetic modeling were evaluated by comparing different Python programming language solvers and solving methods with the motivation of establishing a framework that enables multi-level analysis. The stability of the solvers was analyzed to select the best performers for solving the biokinetic problems. A Python-based linear algebraic method was also explored to examine how the numerical methods deviated from an analytical or semi-analytical method. Results demonstrated that customized implicit methods resulted in an enhanced stable solution for the inhaled 60 Co (Type M) and 131 I (Type F) exposure scenarios for the inhalation pathway of the International Commission on Radiological Protection (ICRP) Publication 130 Human Respiratory Tract Model (HRTM). The customized implementation of the Python-based implicit solvers resulted in approximately consistent solutions with the Python-based matrix exponential method ( expm ). The differences generally observed between the implicit solvers and expm are attributable to numerical precision and the order of numerical approximation of the numerical solvers. This study provides the first analysis of a list of Python ODE solvers and methods by comparing their usage for solving biokinetic models using the ICRP Publication 130 HRTM and provides a framework for the selection of the most appropriate ODE solvers and methods in Python language to implement for modeling the distribution of internal radioactivity.
Many natural physical processes exhibit a multiscale behavior, that is the same processes allow different mathematical description on different scales. The microscale description is usually based on fundamental conservation laws that form a closed system of ordinary differential equations (ODEs) or partial differential equations (PDEs) but the numerical discretization of these equations may produce a system of ODEs with an enormous number of unknowns. Furthermore, a time integration of the microscale equations usually requires time steps that are smaller than the observation time by many orders of magnitude. A direct solution of these ODEs can be extremely expensive. This necessitates development of advanced algorithms for model (or dimension) reduction. Often, we are only interested in the average behavior of the system rather than the exact solution of the ODEs. Here we developed a novel dimension reduction method that gives an approximate solution of the ODEs and gives an accurate prediction of the average behavior. The method relies on a computational closure of averaged evolution balance equations. The computational closure is achieved via short bursts of microscale simulation. The dimension reduction model was used to simulate flow and transport with mixing controlled reactions and mineral precipitation. A pore-scale model was used as a microscale model. A good agreement between microscale simulations and the accelerated microscale simulations confirms the accuracy and computational efficiency of the dimension reduction model. The method significant accelerates microscale simulations, while providing accurate approximation of the solution and accurate prediction of the average behavior of the system.
We consider systems of ordinary differential equations (ODEs) of the form BK=0, where B is a Hamiltonian operator of a completely integrable partial differential equation hierarchy, and K = (K, L){sup T}. Such systems, while of quite low order and linear in the components of K, may represent higher-order nonlinear systems if we make a choice of K in terms of the coefficient functions of B. Indeed, our original motivation for the study of such systems was their appearance in the study of Painlevé hierarchies, where the question of the reduction of order is of great importance. However, here we do not consider such particular cases; instead we study such systems for arbitrary K, where they may represent both integrable and nonintegrable systems of ordinary differential equations. We consider the application of the Prelle-Singer (PS) method—a method used to find first integrals—to such systems in order to reduce their order. We consider the cases of coupled second order ODEs and coupled third order ODEs, as well as the special case of a scalar third order ODE; for the case of coupled third order ODEs, the development of the PS method presented here is new. We apply the PS method to examples of such systems, based on dispersive water wave, Ito and Korteweg-de Vries Hamiltonian structures, and show that first integrals can be obtained. It is important to remember that the equations in question may represent sequences of systems of increasing order. We thus see that the PS method is a further technique which we expect to be useful in our future work.
The turbulent random walk of magnetic field lines plays an important role in the transport of plasmas and energetic particles in a wide variety of astrophysical situations, but most theoretical work has concentrated on determination of the asymptotic field line diffusion coefficient. Here we consider the evolution with distance of the field line random walk using a general ordinary differential equation (ODE), which for most cases of interest in astrophysics describes a transition from free streaming to asymptotic diffusion. By challenging theories of asymptotic diffusion to also describe the evolution, one gains insight on how accurately they describe the random walk process. Previous theoretical work has effectively involved closure of the ODE, often by assuming Corrsin's hypothesis and a Gaussian displacement distribution. Approaches that use quasilinear theory and prescribe the mean squared displacement ({Delta}x {sup 2}) according to free streaming (random ballistic decorrelation, RBD) or asymptotic diffusion (diffusive decorrelation, DD) can match computer simulation results, but only over specific parameter ranges, with no obvious 'marker' of the range of validity. Here we make use of a unified description in which the ODE determines ({Delta}x {sup 2}) self-consistently, providing a natural transition between the assumptions of RBD and DD. We find that the minimum kurtosis of the displacement distribution provides a good indicator of whether the self-consistent ODE is applicable, i.e., inaccuracy of the self-consistent ODE is associated with non-Gaussian displacement distributions.
Smoothed Particle Hydrodynamics model of a complex multiscale processe often results in a system of ODEs with an enormous number of unknowns. Furthermore, a time integration of the SPH equations usually requires time steps that are smaller than the observation time by many orders of magnitude. A direct solution of these ODEs can be extremely expensive. Here we propose a novel dimension reduction method that gives an approximate solution of the SPH ODEs and provides an accurate prediction of the average behavior of the modeled system. The method consists of two main elements. First, effective equationss for evolution of average variables (e.g. average velocity, concentration and mass of a mineral precipitate) are obtained by averaging the SPH ODEs over the entire computational domain. These effective ODEs contain non-local terms in the form of volume integrals of functions of the SPH variables. Second, a computational closure is used to close the system of the effective equations. The computational closure is achieved via short bursts of the SPH model. The dimension reduction model is used to simulate flow and transport with mixing controlled reactions and mineral precipitation. An SPH model is used model transport at the porescale. Good agreement between direct solutions of the SPH equations and solutions obtained with the dimension reduction method for different boundary conditions confirms the accuracy and computational efficiency of the dimension reduction model. The method significantly accelerates SPH simulations, while providing accurate approximation of the solution and accurate prediction of the average behavior of the system.
In this paper, we focus on the derivation of an analytical model of the aeroelastic dynamics of an elastically mounted flexible wing. This equations of motion obtained serve to help understand the behaviour of the aeroelastic wind tunnel setup in question, which consists of a rectangular wing with a uniform NACA 0012 airfoil profile, whose base is free to rotate rigidly about a longitudinal axis. Of particular interest are the structural geometric nonlinearities primarily introduced by the coupling between the rigid body pitch degree-of-freedom and the continuous system. A coupled system of partial differential equations (PDEs) coupled with an ordinary differential equation (ODE) describing axial-bending-bending-torsion-pitch motion is derived using Hamilton's principle. A finite dimensional approximation of the system of coupled differential equations is obtained using the Galerkin method, leading to a system of coupled nonlinear ODEs. Subsequently, these nonlinear ODEs are solved numerically using Houbolt's method. The results that are obtained are verified by comparison with the results obtained by direct integration of the equations of motion using a finite difference scheme. Adopting a linear unsteady aerodynamic model, it is observed that the system undergoes coalescence flutter due to coupling between the rigid body pitch rotation dominated mode and the first flapwise bending dominated mode. Finally, the behaviour of the limit cycle oscillations is primarily influenced by the structural geometric nonlinear terms in the coupled system of PDEs and ODE.
Accurate frequency modelling of inverter‐based resource (IBR)‐dominated power systems is crucial for ensuring stable, reliable and resilient operations, particularly given their inherent low‐inertia characteristics and fast dynamics that traditional swing equation‐based models inadequately capture. This paper explores neural ordinary differential equations (Neural ODEs) as a computationally efficient, data‐driven framework for modelling power system frequency dynamics, specifically within microgrids integrating high penetrations of distributed energy resources (DERs). The developed neural ODEs framework incorporates a neural network architecture designed to capture input dynamics. By actively perturbing the system with a known signal, the Python‐based neural ODEs framework was trained using measured system states and inputs, without the need for detailed system information. The framework, tested on a model of the Cordova, AK, microgrid, achieved a goodness of fit ranging from 60% to 99% across different state variables and maintained a mean square error in the 10 -6 p.u. range under square and step excitation signals. The proposed approach demonstrated robustness to measurement noise and initial condition variations while maintaining low computational complexity suitable for real‐time power system control applications. Furthermore, transfer learning enabled the neural ODEs model to adapt to the following changes in system topology or generator dispatch, highlighting its effectiveness for dynamic microgrids with frequently evolving configurations and diverse DERs.
Recent research suggests that any set of first order linear vector ODEs can be converted to a set of specific vector ODEs adhering to what we have called ''Quantum Harmonical Form (QHF)''. QHF has been developed using a virtual quantum multi harmonic oscillator system where mass and force constants are considered to be time variant and the Hamiltonian is defined as a conic structure over positions and momenta to conserve the Hermiticity. As described in previous works, the conversion to QHF requires the matrix coefficient of the first set of ODEs to be a normal matrix. In this paper, this limitation is circumvented using a space extension approach expanding the potential applicability of this method. Overall, conversion to QHF allows the investigation of a set of ODEs using mathematical tools available to the investigation of the physical concepts underlying quantum harmonic oscillators. The utility of QHF in the context of dynamical systems and dynamical causal modeling in behavioral and cognitive neuroscience is briefly discussed.
In this paper, the results of the Lie group method carried out by Ovsiannikov are utilized to study the one-dimensional hydrodynamic equations governing compressible, inviscid fluid flow in the absence of heat conduction. One-parameter subgroups of the admissible R-parameter Lie group of point transformations of the system are applied to reduce the first-order, non-linear system of partial differential equations (PDE)s to a first-order system of ordinary differential equations (ODE)s. Closed-form solutions to the reduced ODE systems are subsequently determined using a linear velocity profile ansatz. These solutions are valid in one-dimensional (1D) planar, cylindrical and spherical geometries and are connected to solutions of the governing system of PDEs through an inverse map. The linear velocity type solutions were first considered by Sedov in 1953 and constitute a subclass of all possible similarity solutions of the compressible hydrodynamics equations. They further serve as illustrative examples of using solutions obtained for the reduced ODEs to find solutions of the associated system of PDEs. Consequently, the reduced systems of ODEs are provided in their entirety inviting additional solutions to be determined via alternative explicit or numerical solution techniques.
Background: The correlation between the expression levels of transcription factors and their target genes can be used to infer interactions within animal regulatory networks, but current methods are limited in their ability to make correct predictions. Results: Here we describe a novel approach which uses nonparametric statistics to generate ordinary differential equation (ODE) models from expression data. Compared to other dynamical methods, our approach requires minimal information about the mathematical structure of the ODE; it does not use qualitative descriptions of interactions within the network; and it employs new statistics to protect against over-fitting. It generates spatiotemporal maps of factor activity, highlighting the times and spatial locations at which different regulators might affect target gene expression levels. We identify an ODE model for eve mRNA pattern formation in the Drosophila melanogaster blastoderm and show that this reproduces the experimental patterns well. Compared to a nondynamic, spatial-correlation model, our ODE gives 59% better agreement to the experimentally measured pattern. Our model suggests that protein factors frequently have the potential to behave as both an activator and inhibitor for the same cis-regulatory module depending on the factors’ concentration, and implies different modes of activation and repression. Conclusions: Our method provides an objective quantification of the regulatory potential of transcription factors in a network, is suitable for both low- and moderate-dimensional gene expression datasets, and includes improvements over existing dynamic and static models.