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 181 records · Page 10

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↗

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum-inspired techniques with classical methods. It focuses on fixed-point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed-point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

SU-C-BRE-03: Dual Compartment Mathematical Modeling of Glioblastoma Multiforme (GBM)

Purpose: To explore the aggressive recurrence and radioresistence of GBM with a dual compartment tumor survival mathematical model based on intrinsic tumor heterogeneity, cancer stem cells (CSC) and differentiated cancer cells (DCC). Methods: The repopulation and differentiation responses to radiotherapy of a solid tumor were simulated using an Ordinary Differential Equation (ODE). To obtain the tumor radiobiological parameters, we assumed that a tumor consists of two subpopulations, each with its distinctive linear quadratic parameters. The dual compartment cell survival model was constructed as SF(D)=F × exp(-α{sub 1} D-β{sub 1}D{sup 2}) + (1-F) × exp(-α{sub 2}D-β{sub 2}D{sup 2}) for a single fraction of treatment, with F as the fraction of CSC, and α and β describing the radiological properties of each population. Robust least square fitting was performed on clonogenic survival data from one GBM (U373MG) and one NSCLC (H460) cell line. The fit parameters were then used in the ODE model to predict treatment outcome of various treatment schemes. Results: The fit parameters from GBM cell survival data were (F, α{sub 1}, β{sub 1}, α{sub 2}, β{sub 2})=(0.0396, 0.0801, 0.0006, 0.1363, 0.0279), exhibiting two populations with distinctive radiological properties, CSC more radioresistant than DCC. The GBM cell line exhibited significantly poorer tumor control than its single compartment model prediction and NSCLC, which responded well to hypofrationation. The increased radioresistance was due to rapid regrowth of the DCC compartment triggered by its depletion while maintaining a viable CSC population. The rapid regrowth can be reduced by treating dose fractions ≤ 2 Gy with a prolonged treatment period. Conclusion: The interaction between a radioresistant CSC compartment and DCC compartment can explain the poor clinical outcome of GBM after radiotherapy despite dose escalation and hypofractionation attempts. Lower dose fractions result in better treatment outcome but still eventually recurs. Dose escalation beyond 100 Gy and/or differentiation therapy will be vital in achieving GBM tumor control.

60 APPLIED LIFE SCIENCES↗

SU-D-BRB-06: Treating Glioblastoma Multiforme (GBM) as a Chronic Disease: Implication of Temporal-Spatial Dose Fractionation Optimization Including Cancer Stem Cell Dynamics

Purpose: To explore the feasibility of improving GBM treatment outcome with temporal-spatial dose optimization of an ordinary differential equation (ODE) that models the differentiation and distinct radiosensitivity between cancer stem cells (CSC) and differentiated cancer cells (DCC). Methods: The ODE was formulated into a non-convex optimization problem with the objective to minimize remaining total cancer cells 500 days from the onset of radiotherapy when the total cancer cell number was 3.5×10{sup 7}, while maintaining normal tissue biological effective dose (BED) of 100Gy resulted from standard prescription of 2Gyx30. Assuming spatially separated CSC and DCC, optimization was also performed to explore the potential benefit from dose-painting the two compartments. Dose escalation to a sub-cell-population in the GTV was also examined assuming that a 2 cm margin around the GTV allows sufficient dose drop-off to 100Gy BED. The recurrence time was determined as the time at which the total cancer cell number regrows to 10{sup 9} cells. Results: The recurrence time with variable fractional doses administered once per week, bi-week and month for one year were found to be 615, 593 and 570 days, superior to the standard-prescription recurrence time of 418 days. The optimal dose-fraction size progression for both uniform and dose-painting to the tumor is low and relatively constant in the beginning and gradually increases to more aggressive fractions at end of the treatment course. Dose escalation to BED of 200Gy to the whole tumor alongside with protracted weekly treatment was found to further delay recurrence to 733 days. Dose-painting of 200 and 500Gy BED to CSC on a year-long weekly schedule further extended recurrence to 736 and 1076 days, respectively. Conclusion: GBM treatment outcome can possibly be improved with a chronic treatment approach. Further dose escalation to the entire tumor or CSC targeted killing is needed to achieve total tumor control. This work is supported by the NSF Graduate Research Fellowship (DGE-1144087)

60 APPLIED LIFE SCIENCES↗

SU-E-T-751: Three-Component Kinetic Model of Tumor Growth and Radiation Response for Stereotactic Radiosurgery

Purpose: To develop and study a kinetic model of tumor growth and its response to stereotactic radiosurgery (SRS) by assuming that the cells in irradiated tumor volume were made of three types. Methods: A set of ordinary differential equations (ODEs) were derived for three types of cells and a tumor growth rate. It is assumed that the cells were composed of actively proliferating cells, lethally damaged-dividing cells, and non-dividing cells. We modeled the tumor volume growth with a time-dependent growth rate to simulate the saturation of growth. After SRS, the proliferating cells were permanently damaged and converted to the lethally damaged cells. The amount of damaged cells were estimated by the LQ-model. The damaged cells gradually stopped dividing/proliferating and died with a constant rate. The dead cells were cleared from their original location with a constant rate. The total tumor volume was the sum of the three components. The ODEs were numerically solved with appropriate initial conditions for a given dosage. The proposed model was used to model an animal experiment, for which the temporal change of a rhabdomyosarcoma tumor volume grown in a rat was measured with time resolution sufficient to test the model. Results: To fit the model to the experimental data, the following characteristics were needed with the model parameters. The α-value in the LQ-model was smaller than the commonly used value; furthermore, it decreased with increasing dose. At the same time, the tumor growth rate after SRS had to increase. Conclusions: The new 3-component model of tumor could simulate the experimental data very well. The current study suggested that the radiation sensitivity and the growth rate of the proliferating tumor cells may change after irradiation and it depended on the dosage used for SRS. These preliminary observations must be confirmed by future animal experiments.

60 APPLIED LIFE SCIENCES↗

Extrapolated implicit-explicit time stepping.

This paper constructs extrapolated implicit-explicit time stepping methods that allow one to efficiently solve problems with both stiff and nonstiff components. The proposed methods are based on Euler steps and can provide very high order discretizations of ODEs, index-1 DAEs, and PDEs in the method-of-lines framework. Implicit-explicit schemes based on extrapolation are simple to construct, easy to implement, and straightforward to parallelize. This work establishes the existence of perturbed asymptotic expansions of global errors, explains the convergence orders of these methods, and studies their linear stability properties. Numerical results with stiff ODE, DAE, and PDE test problems confirm the theoretical findings and illustrate the potential of these methods to solve multiphysics multiscale problems.

97 MATHEMATICS AND COMPUTING↗

Lack of robustness and accuracy of many numerical schemes for phase-field simulations

In this paper, we study the stability, accuracy and convergence behavior of various numerical schemes for phase-field modeling through a simple ODE model. Both theoretical analysis and numerical experiments are carried out on this ODE model to demonstrate the limitation of most numerical schemes that have been used in practice. One main conclusion is that the first-order fully implicit scheme is the only robust algorithm for phase-field simulations while all other schemes (that have been analyzed) may have convergence issue if the time step size is not exceedingly small. More specifically, by rigorous analysis in most cases, we have the following conclusions: (i) The first-order fully implicit scheme converges to the correct steady state solution for all time step sizes. In the case of multiple solutions, one of the solution branches always converges to the correct steady state solution. (ii) The first-order convex splitting scheme, which is equivalent to the first-order fully implicit scheme with a different time scaling, always converges to the correct steady state solution but may seriously lack numerical accuracy for transient solutions. (iii) For the second-order fully implicit and convex splitting schemes, for any time step size $δt > 0$, there exists an initial condition $u_0$ , with $|u_0| > 1$, such that the numerical solution converges to the wrong steady state solution. (iv) For $|u_0|$ ≤ 1, all second-order schemes studied in this paper converge to the correct steady state solution although severe numerical oscillations occur for most of them if the time step size is not sufficiently small. (v) An unconditionally energy-stable scheme (such as the modified Crank–Nicolson scheme) is not necessarily better than a conditionally energy-stable scheme (such as the Crank–Nicolson scheme). Finally, most, if not all, of the above conclusions are expected to be true for more general Allen–Cahn and other phase-field models.

97 MATHEMATICS AND COMPUTING↗

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↗

Tempus v. 1.0

Tempus is a software framework for the time integration of ordinary differential equations (ODEs), partial differential equations (PDEs), and differential-algebraic equations (DAEs). Examples of time-integration methods available are Forward Euler, Backward Euler, Explicit Runge-Kutta and Implicit Runge-Kutta methods. Tempus can be used from small systems of equations (e.g., single ODEs for the time evolution of plasticity models) to large-scale transient simulations requiring exascale computing (e.g., flow fields around reentry vehicles and magneto-hydrodynamics). Tempus will be released as part of Trilinos under a BSD open source license.

Obert, CurtisC.↗

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.↗

Quandary

Quandary numerically simulates and optimizes the time-evolution of open quantum systems. The underlying dynamics are modelled by Lindblad's master equation, a linear ordinary differential equation (ODE) describing quantum systems interacting with the environment. Quandary solves this ODE numerically by applying a time-stepping integration scheme, and utilizes a gradient-based optimization approach to determine optimal control pulses that drive the quantum system to a desired target state. Two optimization objectives are considered: (a) Unitary gate optimization that finds controls to realize a unitary gate transformation, and (b) optimal reset that aims to drive the quantum system to the ground states. Gradient-based optimization schemes utilizing Petsc's Tao optimization package are applied to generate control pulses that minimize the respective measure. To evaluate the gradient of the objective function, the discrete adjoint method is used while leveraging techniques from Algorithmic Differentiation to produce exact and consistent gradients. To mitigate excessive execution run times, the software can be build together with the XBraid software library which provides a parallelization strategy to distribute the time-evolution of the underlying dynamics onto multiple processor.

Petersson, NilsA.↗

ILI Code

This R code consists of three scripts, described below. 1. ILI_LHC_sample.R The first script generate 10,000 samples from the total parameter space formed by the ranges of the following five parameters inputted into the ILI model: transmission rate (beta), per capita rate of progress from exposed to infectious state (gamma_1), per capita rate of progress through initial infectious state (gamma_2), per capita rate of progress through hospitalized state (gamma_3), and per capita rate of progress through non-hospitalized infectious state (gamma_4). The output is LHS_samples.csv, for input into the global sensitivity script, ILI_SEIR. 2. ILI_SEIR.R The second script solves a standard Susceptible-Exposed-Infected- Recovered (SEIR) model (a system of Ordinary Differential Equations (ODEs)), runs global sensitivity analyses, and generates plots showing the impact of the input variables on the response variables for each virus. 3. virus_sims.R The third script solves a standard Susceptible-Exposed-Infected- Recovered (SEIR) model (a system of Ordinary Differential Equations (ODEs)), aimed at modeling outbreaks for five common upper respiratory viruses within a contained population. The output of this code is an epidemic curve to show timing and magnitude of the epidemic peak for each virus. Note: for all three scripts, the parameter values must be hard-coded by the user or the output will not be accurate.

Spencer, Julie↗

gpde

The R package gpde is an R implementation of a probabilistic differential equation solver. The package has a basic implementation of the Chkrebtii (2013) probabilistic ODE solver and an extension using the connection between Kalman Filtering for SDEs and Gaussian Processes from work by Simo Sarkka. The package also implements the Integrated Wiener covariance function from Schober 2014 to obtain probabilistic ODE solutions with the Runge-Kutta solution as the mean result. This collection of tools has been built into an R package for easy use at LANL and in the probabilistic numerics community.

Grosskopf, Michael↗

pnnl/neural_ODE_ICLR2020

We show how to model discrete ordinary differential equations (ODE) with algebraic nonlinearities as deep neural networks with varying degrees of prior knowledge. We derive the stability guarantees of the network layers based on the implicit constraints imposed on the weight's eigenvalues. Moreover, we show how to use barrier methods to generically handle additional inequality constraints. We demonstrate the prediction accuracy of learned neural ODEs evaluated on open-loop simulations compared to ground truth dynamics with bi-linear terms.

Tuor, Aaron↗

DESS (Differential Equation System Solver) [SWR-24-48]

The Differential Equation System Solver (DESS) is a Rust crate implementing fixed-step and adaptive-step solvers and designed especially for modeling physical systems. Seven explicit ordinary differential equation (ODE) solver methods have been added so far: Euler’s, Heun’s, Midpoint, Ralston’s, Classic Runge-Kutta, Bogacki-Shampine, and Cash-Karp. These comprise five fixed-step methods and two adaptive-step methods. Few solver packages are implemented in the Rust ecosystem and none are intended specifically for physical system modeling, so the goal of DESS is to create a Rust ODE solver crate designed to easily specify and model physical systems with modular, configurable solver options. In addition to allowing users to directly input equations to solve, DESS allows users to optionally specify and define relationships between nodes in their system, which the package then translates into a system of equations via the Rust macro system, leading to simpler and more intuitive code.

Steuteville, Robin↗

scikit-SUNDAE ((SUN)DIALS Differential Algebraic Equations) [SWR-24-137]

Scikit-SUNDAE provides Python bindings to SUNDIALS integrators. The implicit differential algebraic (IDA) solver and C-based variable-coefficient ordinary differential equations (CVODE) solver are both included. The name SUNDAE combines (SUN)DIALS and DAE, which stands for differential algebraic equations. Solvers specific to DAE problems are not frequently available in Python. An ordinary differential equation (ODE) solver is also included for completeness. ODEs can be categorized as a subset of DAEs (i.e., DAEs with no algebraic constraints). https://pypi.org/project/scikit-sundae

Randall, Corey↗

Modeling Dynamic Regulatory Processes in Stroke.

The ability to examine in silico the behavior of biological systems can greatly accelerate the pace of discovery in disease pathologies, such as stroke, where in vivo experimentation is lengthy and costly. In this paper we describe an approach to in silico examination of blood genomic responses to neuroprotective agents and subsequent stroke through the development of dynamic models of the regulatory processes observed in the experimental gene expression data. First, we identified functional gene clusters from these data. Next, we derived ordinary differential equations (ODEs) relating regulators and functional clusters from the data. These ODEs were used to develop dynamic models that simulate the expression of regulated functional clusters using system dynamics as the modeling paradigm. The dynamic model has the considerable advantage of only requiring an initial starting state, and does not require measurement of regulatory influences at each time point in order to make accurate predictions. The manipulation of input model parameters, such as changing the magnitude of gene expression, made it possible to assess the behavior of the networks through time under varying conditions. We report that an optimized dynamic model can provide accurate predictions of overall system behavior under several different preconditioning paradigms.

dynamic modeling↗