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

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - 2

The global asymptotic nonlinear behavior of 1 1 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODES) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDES.

Yee, H. C.↗

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - Part 2

The global asymptotic nonlinear behavior of 11 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDEs.

Yee, H. C.↗

A Hysteresis Model for Piezoceramic Materials

This paper addresses the modeling of nonlinear constitutive relations and hysteresis inherent to piezoceramic materials at moderate to high drive levels. Such models are, necessary to realize the, full potential of the materials in high performance control applications, and a necessary prerequisite is the development of techniques which permit control implementation. The approach employed here is based on the qualification of reversible and irreversible domain wall motion in response to applied electric fields. A comparison with experimental data illustrates that because the resulting ODE model is physics-based, it can be employed for both characterization and prediction of polarization levels throughout the range of actuator operation. Finally, the ODE formulation is amenable to inversion which facilitates the development of an inverse compensator for linear control design.

Smith, Ralph C.↗

On the Importance of the Dynamics of Discretizations

It has been realized recently that the discrete maps resulting from numerical discretizations of differential equations can possess asymptotic dynamical behavior quite different from that of the original systems. This is the case not only for systems of Ordinary Differential Equations (ODEs) but in a more complicated manner for Partial Differential Equations (PDEs) used to model complex physics. The impact of the modified dynamics may be mild and even not observed for some numerical methods. For other classes of discretizations the impact may be pronounced, but not always obvious depending on the nonlinear model equations, the time steps, the grid spacings and the initial conditions. Non-convergence or convergence to periodic solutions might be easily recognizable but convergence to incorrect but plausible solutions may not be so obvious - even for discretized parameters within the linearized stability constraint. Based on our past four years of research, we will illustrate some of the pathology of the dynamics of discretizations, its possible impact and the usage of these schemes for model nonlinear ODEs, convection-diffusion equations and grid adaptations.

Sweby, Peter K.↗

A Textbook for a First Course in Computational Fluid Dynamics

This paper describes and discusses the textbook, Fundamentals of Computational Fluid Dynamics by Lomax, Pulliam, and Zingg, which is intended for a graduate level first course in computational fluid dynamics. This textbook emphasizes fundamental concepts in developing, analyzing, and understanding numerical methods for the partial differential equations governing the physics of fluid flow. Its underlying philosophy is that the theory of linear algebra and the attendant eigenanalysis of linear systems provides a mathematical framework to describe and unify most numerical methods in common use in the field of fluid dynamics. Two linear model equations, the linear convection and diffusion equations, are used to illustrate concepts throughout. Emphasis is on the semi-discrete approach, in which the governing partial differential equations (PDE's) are reduced to systems of ordinary differential equations (ODE's) through a discretization of the spatial derivatives. The ordinary differential equations are then reduced to ordinary difference equations (O(Delta)E's) using a time-marching method. This methodology, using the progression from PDE through ODE's to O(Delta)E's, together with the use of the eigensystems of tridiagonal matrices and the theory of O(Delta)E's, gives the book its distinctiveness and provides a sound basis for a deep understanding of fundamental concepts in computational fluid dynamics.

Zingg, D. W.↗

Fully Nonlinear Modeling and Analysis of Precision Membranes

High precision membranes are used in many current space applications. This paper presents a fully nonlinear membrane theory with forward and inverse analyses of high precision membrane structures. The fully nonlinear membrane theory is derived from Jaumann strains and stresses, exact coordinate transformations, the concept of local relative displacements, and orthogonal virtual rotations. In this theory, energy and Newtonian formulations are fully correlated, and every structural term can be interpreted in terms of vectors. Fully nonlinear ordinary differential equations (ODES) governing the large static deformations of known axisymmetric membranes under known axisymmetric loading (i.e., forward problems) are presented as first-order ODES, and a method for obtaining numerically exact solutions using the multiple shooting procedure is shown. A method for obtaining the undeformed geometry of any axisymmetric membrane with a known inflated geometry and a known internal pressure (i.e., inverse problems) is also derived. Numerical results from forward analysis are verified using results in the literature, and results from inverse analysis are verified using known exact solutions and solutions from the forward analysis. Results show that the membrane theory and the proposed numerical methods for solving nonlinear forward and inverse membrane problems are accurate.

Pai, P. Frank↗

Semi-Analytic Reconstruction of Flux in Finite Volume Formulations

Semi-analytic reconstruction uses the analytic solution to a second-order, steady, ordinary differential equation (ODE) to simultaneously evaluate the convective and diffusive flux at all interfaces of a finite volume formulation. The second-order ODE is itself a linearized approximation to the governing first- and second- order partial differential equation conservation laws. Thus, semi-analytic reconstruction defines a family of formulations for finite volume interface fluxes using analytic solutions to approximating equations. Limiters are not applied in a conventional sense; rather, diffusivity is adjusted in the vicinity of changes in sign of eigenvalues in order to achieve a sufficiently small cell Reynolds number in the analytic formulation across critical points. Several approaches for application of semi-analytic reconstruction for the solution of one-dimensional scalar equations are introduced. Results are compared with exact analytic solutions to Burger s Equation as well as a conventional, upwind discretization using Roe s method. One approach, the end-point wave speed (EPWS) approximation, is further developed for more complex applications. One-dimensional vector equations are tested on a quasi one-dimensional nozzle application. The EPWS algorithm has a more compact difference stencil than Roe s algorithm but reconstruction time is approximately a factor of four larger than for Roe. Though both are second-order accurate schemes, Roe s method approaches a grid converged solution with fewer grid points. Reconstruction of flux in the context of multi-dimensional, vector conservation laws including effects of thermochemical nonequilibrium in the Navier-Stokes equations is developed.

Gnoffo, Peter A.↗

Algorithm for Stabilizing a POD-Based Dynamical System

This algorithm provides a new way to improve the accuracy and asymptotic behavior of a low-dimensional system based on the proper orthogonal decomposition (POD). Given a data set representing the evolution of a system of partial differential equations (PDEs), such as the Navier-Stokes equations for incompressible flow, one may obtain a low-dimensional model in the form of ordinary differential equations (ODEs) that should model the dynamics of the flow. Temporal sampling of the direct numerical simulation of the PDEs produces a spatial time series. The POD extracts the temporal and spatial eigenfunctions of this data set. Truncated to retain only the most energetic modes followed by Galerkin projection of these modes onto the PDEs obtains a dynamical system of ordinary differential equations for the time-dependent behavior of the flow. In practice, the steps leading to this system of ODEs entail numerically computing first-order derivatives of the mean data field and the eigenfunctions, and the computation of many inner products. This is far from a perfect process, and often results in the lack of long-term stability of the system and incorrect asymptotic behavior of the model. This algorithm describes a new stabilization method that utilizes the temporal eigenfunctions to derive correction terms for the coefficients of the dynamical system to significantly reduce these errors.

Kalb, Virginia L.↗

Optimal Control via Self-Generated Stochasticity

The problem of global maxima of functionals has been examined. Mathematical roots of local maxima are the same as those for a much simpler problem of finding global maximum of a multi-dimensional function. The second problem is instability even if an optimal trajectory is found, there is no guarantee that it is stable. As a result, a fundamentally new approach is introduced to optimal control based upon two new ideas. The first idea is to represent the functional to be maximized as a limit of a probability density governed by the appropriately selected Liouville equation. Then, the corresponding ordinary differential equations (ODEs) become stochastic, and that sample of the solution that has the largest value will have the highest probability to appear in ODE simulation. The main advantages of the stochastic approach are that it is not sensitive to local maxima, the function to be maximized must be only integrable but not necessarily differentiable, and global equality and inequality constraints do not cause any significant obstacles. The second idea is to remove possible instability of the optimal solution by equipping the control system with a self-stabilizing device. The applications of the proposed methodology will optimize the performance of NASA spacecraft, as well as robot performance.

Zak, Michail↗

Comparison of Multispectral Imaging and Traditional Fundoscopy in the Detection of Terrestrial Retinal and Optic Nerve Pathologies like those Encountered During and/or Immediately Following Long-Duration Spaceflight

INTRODUCTION: The purpose of this investigation was to evaluate if MultiColor Imaging (MCI) can replace color fundus photography (CFP) as a diagnostic screening tool during spaceflight. MCI significantly reduces crew time (approx. 115 minutes/session, 36 hours/year) by eliminating nominal on-orbit fundoscopy sessions, while also providing the option to capture a larger field of view (55 vs. 35). METHODS: A comprehensive PubMed literature search was conducted using the following key words: multicolor, multispectral, imaging, retina, choroid, optic nerve, optic disc, and papilledema. Publications were filtered based on optic nerve and chorioretinal pathologies matching those seen during or immediately after spaceflight: optic disc edema (ODE), cotton wool spots (CWS), retinal hemorrhage, pigment epithelial detachment (PED), and serous chorioretinopathy (SCR). In a separate effort, 44 multicolor images (30 abnormal) of terrestrial patients were graded and compared to corresponding color fundus images acquired at the Doheny Eye Centers and UCLA. RESULTS: The search identified 340 articles; 9 describing MCI in relevant pathologies, 6 comparing MCI to CFP. MCI is superior in detecting CWS (1 paper), PED (2 papers), retinal hemorrhages (2 papers), and choroidal folds (1 paper), and can better delineate extent or boundaries of subretinal fluid and identify areas of RPE damage in SCR (2 papers). On MCI, ODE was described as a hyperreflective ring with a green shift and indistinct disc margins, with equaldetectability as using CFP (3 papers). Grading at Doheny Eye Institute confirmed these findings. DISCUSSION: MCI can effectively detect all retinal and optic nerve findings detectable by CFP during and immediately post-spaceflight and represents a suitable replacement as an on-orbit diagnostic screening tool. Additionally, by eliminating the nominal on-orbit fundoscopy sessions, dozens of crew hours are spared per year by utilizing MCI.

Jorge Nagel↗

Spaceflight Associated Neuro-ocular Syndrome (SANS): Clinical Update

Spaceflight Associated Neuro-ocular Syndrome (SANS) is a condition unique to long-duration spaceflight, with an unclear pathogenesis and pathophysiology, and no perfect terrestrial analog. Approximately 69% of long duration astronauts present with the earliest indications of SANS, which is defined as development of one or more of the following new signs in at least one eye during or immediately after spaceflight: 1) optic disc edema (ODE; represented by an increase of ≥ 20 microns in peripapillary total retinal thickness [ΔTRT]); 2) chorioretinal folds; 3) globe flattening; and 4) excessive shift in refractive error (≥ +0.75D). Each of these signs presents potential risk to a crewmember’s vision and mission effectiveness, with ODE posing the highest risk overall. It is not yet known what severity and/or duration of signs represents the “pathological” threshold of SANS, or how this threshold will eventually influence the SANS case definition. Brain anatomical changes also occur during long-duration spaceflight and are being monitored in the astronaut population; however, these changes have not yet been associated with functional decrements or with SANS. An update will be provided on the latest SANS clinical analyses, diagnostic technologies, and program initiatives.

TJ Brunstetter↗

brulilo, Version 0.x

brulilo is a Python package for building and evolving thermonuclear reaction networks, such as those used in astrophysical explosion calculations. It is very much a current work in progress, and much of the intended functionality is still under development. The main goal of brulilo is an easy-to-use code for quick calculations or post-processing, as well as a learning tool to test various implementations of solvers on both CPUs and GPUs. Currently, brulilo parses an input text file that specifies the reactions to be included in the network. The notation of the inputs are in the typical astrophysical notation; i.e. hydrogen burning to deuterium in the sun, "p + p + e --> d + neutrino", is given as "p(p,)d." Each reaction is added to a list comprising the reaction network, and once completed, the network contains a list of all isotopes and reactions involved. brulilo then parses publicly available nuclear data (binding energy, spin, partition function data, etc.) for each isotope from the WebNucleo group's data at nucleo.ces.clemson.edu. Fits to reaction rate data for each reaction are obtained from the publicly available data provided by the Joint Institute for Nuclear Astrophysics' Reaclib database. Reverse reactions are calculated from detailed balance. The reaction network then consists of a sparse system of mathematically stiff ordinary differential equations (ODEs). Physically, "stiffness" here means that there are some reaction rates that are occurring much faster than others; the ratio of the fast to slow often being greater than 10^15 in astrophysics. Numerical integration of such systems typically involves implicit integration schemes, which brulilo will leverage from the scientific computing Python package, Numpy, as well as implement its own. There has recently been work from researchers at Oak Ridge National Lab who have found good results from applying quasi-equilibrium and quasi-asymptotic conditions to the stiff system of ODEs, which effectively remove some of the stiffness and allow for efficient explicit integration techniques to be used. The original intent of brulilo was to implement these stiffness-alleviating techniques with explicit integrators and compare the performance to traditional implicit integrations of the full stiff system. This is still underway, as the code is very much in an alpha-release state. Furthermore, explicit integrators are often much easier to parallelize than their implicit counterparts. brulilo will implement parallelization of these techniques, leveraging both the Python implementation of MPI, mpi4py, as well as highly parallelized versions targeted at GPUs with PyOpenCL and/or PyCUDA.

Malone, Chris↗

An evaluation of solution algorithms and numerical approximation methods for modeling an ion exchange process

The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte-Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward difference formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte-Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC-FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ChemComp: Compiling and Computing with Chemical Reaction Networks

The exponential growth in computing demands driven by scientific computing, data analytics, and artificial intelligence is pushing conventional CMOS-based high-performance computing systems to their physical and energy efficiency limits. As we approach the era of post-exascale computing, disruptive approaches are necessary to overcome these barriers and achieve substantial gains in energy efficiency. Analog and hybrid digital-analog computing systems have emerged as promising alternatives, offering the potential for orders-of-magnitude improvements in efficiency. Among these, biochemical computing stands out as a novel paradigm capable of leveraging the natural efficiency of chemical reactions, which have shown promise in solving optimization problems by converging to steady states. By scaling up reaction networks or reaction vessel sizes, biochemical systems present an opportunity to meet the high-performance demands of modern computing tasks. Despite their promise, significant theoretical and practical challenges remain, particularly in formulating and mapping computational problems to chemical reaction networks (CRNs) and designing viable biochemical computing devices. This paper addresses these challenges by introducing new ideas to ChemComp, a compilation and emulation framework for chemical computation. This work describes the mechanisms through which solutions to ordinary differential equations (ODEs) that can be represented as CRN systems can be achieved. Furthermore, we explain the design principles of an ODE dialect implemented as a multi-level intermediate representation (MLIR) compiler extension that will be coupled with existing infrastructure. We demonstrate the potential of our framework through a case study emulating a simplified chemical reservoir computing device. This work establishes foundational tools and methodologies necessary to harness the computational power of chemistry, paving the way for the development of energy-efficient, high-performance computing systems tailored to contemporary and future computational needs.

Bohm Agostini, Nicolas↗

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↗

A projection-based analytical Jacobian framework for chemical kinetics applications

A major challenge in simulating complex combustion systems with detailed chemical kinetic models is the cost of integrating the chemical source terms, often done using stiff ODE solvers that require frequent Jacobian evaluations. Using analytically derived Jacobian matrices instead of divided-difference-based numerical Jacobian approximations can significantly reduce the associated computational cost. However, ambiguities arise in the formulation of analytical Jacobians because the chemical state of the system, or state vector, can be expressed in multiple ways, involving variables that are typically not independent from one another. Here, in this work, the consequences of those ambiguities on practical calculations are characterized in detail, and a generalized, projection-based framework is proposed as a mitigation strategy. Performances are assessed in a series of test cases involving a variety of configurations and numerical solution approaches. Results show that with proper treatment, commonly used analytical Jacobian formulations can be considered as equivalent for practical purposes, thereby alleviating concerns that the state vector chosen to express the governing equations and corresponding analytical Jacobian may significantly impact the accuracy of the simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamics of vortex dipoles in anisotropic Bose-Einstein condensates

We study the motion of a vortex dipole in a Bose-Einstein condensate confined to an anisotropic trap. We focus on a system of ODEs describing the vortices' motion, which is in turn a reduced model of the Gross-Pitaevskii equation describing the condensate's motion. Using a sequence of canonical changes of variables, we reduce the dimension and simplify the equations of motion. In this study, we uncover two interesting regimes. Near a family of periodic orbits known as guiding centers, we find that the dynamics is essentially that of a pendulum coupled to a linear oscillator, leading to stochastic reversals in the overall direction of rotation of the dipole. Near the separatrix orbit in the isotropic system, we find other families of periodic, quasi-periodic, and chaotic trajectories. In a neighborhood of the guiding center orbits, we derive an explicit iterated map that simplifies the problem further. Numerical calculations are used to illustrate the phenomena discovered through the analysis. Using the results from the reduced system, we are able to construct complex periodic orbits in the original, PDE, mean-field model for Bose-Einstein condensates, which corroborates the phenomenology observed in the reduced dynamical equations.

74 ATOMIC AND MOLECULAR PHYSICS↗

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗