Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ordinary differential equation”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

On the mechanism of ionization oscillations in Hall thrusters

Low-frequency ionization oscillations involving plasma and neutral density (breathing modes) are the most violent perturbations in Hall thrusters for electric propulsion. Because of its simplicity, the zero-dimensional (0D) predator–prey model of two nonlinearly coupled ordinary differential equations for plasma and neutral density has often been used for the characterization of such oscillations and scaling estimates. In this work, we investigate the properties of its continuum analog, the one-dimensional (1D) system of two nonlinearly coupled equations in partial derivatives (PDEs) for plasma and neutral density. This is a more general model, of which the standard 0D predator–prey model is a special limit case. We show that the 1D model is stable and does not show any oscillations for the boundary conditions relevant to Hall thrusters and the uniform ion velocity. We then propose a reduced 1D model based on two coupled PDEs for plasma and neutral densities that is unstable and exhibit oscillations if the ion velocity profile with the near-the-anode back-flow (toward the anode) region is used. Comparisons of the reduced model with the predictions of the full model that takes into account the self-consistent plasma response show that the main properties of the breathing mode are well captured. In particular, it is shown that the frequency of the breathing mode oscillations is weakly dependent on the final ion velocity but shows a strong correlation with the width of the ion back-flow region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Machine learning methods for probabilistic locked-mode predictors in tokamak plasmas

A rotating tokamak plasma can interact resonantly with the external helical magnetic perturbations, also known as error fields. This can lead to locking and then to disruptions. We leverage machine learning (ML) methods to predict the locking events. We use a coupled third-order nonlinear ordinary differential equation model to represent the interaction of the magnetic perturbation and the plasma rotation with the error field. This model is sufficient to describe qualitatively the locking and unlocking bifurcations. Here, we explore using ML algorithms with the simulation data and experimental data, focusing on the methods that can be used with sparse datasets. These methods lead to the possibility of the avoidance of locking in real-time operations. We describe the operational space in terms of two control parameters: the magnitude of the error field and the rotation frequency associated with the momentum source that maintains the plasma rotation. The outcomes are quan- tified by order parameters that completely characterize the state, whether locked or unlocked. We use unsupervised ML methods to classify locked/unlocked states and note the usefulness of a certain normalization of the order parameters. Three supervised ML classifiers are used in suite to estimate the probability of locking in the region of control parameter space with hysteresis, i.e., the set of control parameters for which both locked and unlocked states can exist. The results show that a neural network gives the best estimate of the locking probability. An analogy of the present locking model with the van der Waals equation of state is also provided.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Geometry optimization speedup through a geodesic approach to internal coordinates

We present a new geodesic-based method for geometry optimization in a basis set of redundant internal coordinates. Overall, our method updates the molecular geometry by following the geodesic generated by a displacement vector on the internal coordinate manifold, which dramatically reduces the number of steps required to converge to a minimum. Our method can be implemented in any existing optimization code, requiring only implementation of derivatives of the Wilson B-matrix and the ability to numerically solve an ordinary differential equation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Probabilistic locked mode predictor in the presence of a resistive wall and finite island saturation in tokamaks

We present a framework for estimating the probability of locking to an error field in a rotating tokamak plasma. This leverages machine learning methods trained on data from a mode-locking model, including an error field, resistive magnetohydrodynamics modeling of the plasma, a resistive wall, and an external vacuum region, leading to a fifth-order ordinary differential equation (ODE) system. It is an extension of the model without a resistive wall introduced by Akçay et al. [Phys. Plasmas 28, 082106 (2021)]. Tearing mode saturation by a finite island width is also modeled. We vary three pairs of control parameters in our studies: the momentum source plus either the error field, the tearing stability index, or the island saturation term. The order parameters are the time-asymptotic values of the five ODE variables. Normalization of them reduces the system to 2D and facilitates the classification into locked (L) or unlocked (U) states, as illustrated by Akçay et al., [Phys. Plasmas 28, 082106 (2021)]. This classification splits the control space into three regions: L̂, with only L states; Û, with only U states; and a hysteresis (hysteretic) region Ĥ, with both L and U states. In regions L̂ and Û, the cubic equation of torque balance yields one real root. Region Ĥ has three roots, allowing bifurcations between the L and U states. The classification of the ODE solutions into L/U is used to estimate the locking probability, conditional on the pair of the control parameters, using a neural network. We also explore estimating the locking probability for a sparse dataset, using a transfer learning method based on a dense model dataset.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Construction of quasisymmetric stellarators using a direct coordinate approach

In this work, optimized stellarator configurations and their analytical properties are obtained using a near-axis expansion approach. Such configurations are associated with good confinement as the guiding center particle trajectories and neoclassical transport are isomorphic to those in a tokamak. This makes them appealing as fusion reactor candidates. Using a direct coordinate approach, where the magnetic field and flux surface functions are found explicitly in terms of the position vector at successive orders in the distance to the axis, the set of ordinary differential equations for first and second order quasisymmetry is derived. Examples of quasi-axisymmetric shapes are constructed using a pseudospectral numerical method. Finally, the direct coordinate approach is used to independently verify two hypotheses commonly associated with quasisymmetric magnetic fields, namely that the number of equations exceeds the number of parameters at third order in the expansion and that the near-axis expansion does not prohibit exact quasisymmetry from being achieved on a single flux surface.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Time-dependent SOLPS-ITER simulations of the tokamak plasma boundary for model predictive control using SINDy *

Abstract Time-dependent SOLPS-ITER simulations have been used to identify reduced models with the sparse identification of nonlinear dynamics (SINDy) method and develop model-predictive control of the boundary plasma state using main ion gas puff actuation. A series of gas actuation sequences are input into SOLPS-ITER to produce a dynamic response in upstream and divertor plasma quantities. The SINDy method is applied to identify reduced linear and nonlinear models for the electron density at the outboard midplane n e , s e p O M P and the electron temperature at the outer divertor T e , s e p d i v . Note that T e , s e p d i v is not necessarily the peak value of T e along the divertor. The identified reduced models are interpretable by construction (i.e. not black box), and have the form of coupled ordinary differential equations. Despite significant noise in T e , s e p d i v , the reduced models can be used to predict the response over a range of actuation levels to a maximum deviation of 0.5% in n e , s e p O M P and 5%–10% in T e , s e p d i v for the cases considered. Model retraining using time history data triggered by a preset error threshold is also demonstrated. A model predictive control strategy for nonlinear models is developed and used to perform feedback control of a SOLPS-ITER simulation to produce a setpoint trajectory in n e , s e p O M P using the integrated plasma simulator framework. The developed techniques are general and can be applied to time-dependent data from other boundary simulations or experimental data. Ongoing work is extending the approach to model identification and control for divertor detachment, which will present transient nonlinear behavior from impurity seeding, including realistic latency and synthetic diagnostic signals derived from the full SOLPS-ITER output.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Forecasting high-dimensional spatio-temporal systems from sparse measurements

This paper introduces a new neural network architecture designed to forecast high-dimensional spatio-temporal data using only sparse measurements. The architecture uses a two-stage end-to-end framework that combines neural ordinary differential equations (NODEs) with vision transformers. Initially, our approach models the underlying dynamics of complex systems within a low-dimensional space; and then it reconstructs the corresponding high-dimensional spatial fields. Many traditional methods involve decoding high-dimensional spatial fields before modeling the dynamics, while some other methods use an encoder to transition from high-dimensional observations to a latent space for dynamic modeling. In contrast, our approach directly uses sparse measurements to model the dynamics, bypassing the need for an encoder. This direct approach simplifies the modeling process, reduces computational complexity, and enhances the efficiency and scalability of the method for large datasets. We demonstrate the effectiveness of our framework through applications to various spatio-temporal systems, including fluid flows and global weather patterns. Although sparse measurements have limitations, our experiments reveal that they are sufficient to forecast system dynamics accurately over long time horizons. Our results also indicate that the performance of our proposed method remains robust across different sensor placement strategies, with further improvements as the number of sensors increases. This robustness underscores the flexibility of our architecture, particularly in real-world scenarios where sensor data is often sparse and unevenly distributed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFit

Abstract Summary Bayesian inference in biological modeling commonly relies on Markov chain Monte Carlo (MCMC) sampling of a multidimensional and non-Gaussian posterior distribution that is not analytically tractable. Here, we present the implementation of a practical MCMC method in the open-source software package PyBioNetFit (PyBNF), which is designed to support parameterization of mathematical models for biological systems. The new MCMC method, am, incorporates an adaptive move proposal distribution. For warm starts, sampling can be initiated at a specified location in parameter space and with a multivariate Gaussian proposal distribution defined initially by a specified covariance matrix. Multiple chains can be generated in parallel using a computer cluster. We demonstrate that am can be used to successfully solve real-world Bayesian inference problems, including forecasting of new Coronavirus Disease 2019 case detection with Bayesian quantification of forecast uncertainty. Availability and implementation PyBNF version 1.1.9, the first stable release with am, is available at PyPI and can be installed using the pip package-management system on platforms that have a working installation of Python 3. PyBNF relies on libRoadRunner and BioNetGen for simulations (e.g. numerical integration of ordinary differential equations defined in SBML or BNGL files) and Dask.Distributed for task scheduling on Linux computer clusters. The Python source code can be freely downloaded/cloned from GitHub and used and modified under terms of the BSD-3 license (https://github.com/lanl/pybnf). Online documentation covering installation/usage is available (https://pybnf.readthedocs.io/en/latest/). A tutorial video is available on YouTube (https://www.youtube.com/watch?v=2aRqpqFOiS4&t=63s). Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Cavitation in a soft porous material

Abstract We study the collapse and expansion of a cavitation bubble in a deformable porous medium. We develop a continuum-scale model that couples compressible fluid flow in the pore network with the elastic response of a solid skeleton. Under the assumption of spherical symmetry, our model can be reduced to an ordinary differential equation that extends the Rayleigh–Plesset equation to bubbles in soft porous media. The extended Rayleigh–Plesset equation reveals that finite-size effects lead to the breakdown of the universal scaling relation between bubble radius and time that holds in the infinite-size limit. Our data indicate that the deformability of the porous medium slows down the collapse and expansion processes, a result with important consequences for wide-ranging phenomena, from drug delivery to spore dispersion.

Leng, Yu↗
DOE OSTI2022

Sparsifying priors for Bayesian uncertainty quantification in model discovery

We propose a probabilistic model discovery method for identifying ordinary differential equations governing the dynamics of observed multivariate data. Our method is based on the sparse identification of nonlinear dynamics (SINDy) framework, where models are expressed as sparse linear combinations of pre-specified candidate functions. Promoting parsimony through sparsity leads to interpretable models that generalize to unknown data. Instead of targeting point estimates of the SINDy coefficients, we estimate these coefficients via sparse Bayesian inference. The resulting method, uncertainty quantification SINDy (UQ-SINDy), quantifies not only the uncertainty in the values of the SINDy coefficients due to observation errors and limited data, but also the probability of inclusion of each candidate function in the linear combination. UQ-SINDy promotes robustness against observation noise and limited data, interpretability (in terms of model selection and inclusion probabilities) and generalization capacity for out-of-sample forecast. Sparse inference for UQ-SINDy employs Markov chain Monte Carlo, and we explore two sparsifying priors: the spike and slab prior, and the regularized horseshoe prior. UQ-SINDy is shown to discover accurate models in the presence of noise and with orders-of-magnitude less data than current model discovery methods, thus providing a transformative method for real-world applications which have limited data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Bayesian differential programming for robust systems identification under uncertainty

This paper presents a machine learning framework for Bayesian systems identification from noisy, sparse and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of recent developments in differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling. This allows an efficient inference of the posterior distributions over plausible models with quantified uncertainty, while the use of sparsity-promoting priors enables the discovery of interpretable and parsimonious representations for the underlying latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed methods, including nonlinear oscillators, predator–prey systems and examples from systems biology. Taken together, our findings put forth a flexible and robust workflow for data-driven model discovery under uncertainty. All codes and data accompanying this article are available at https://bit.ly/34FOJMj .

Science & Technology - Other Topics↗
DOE OSTI2022

Gaussian processes meet NeuralODEs: a Bayesian framework for learning the dynamics of partially observed systems from scarce and noisy data

We present a machine learning framework (GP-NODE) for Bayesian model discovery from partial, noisy and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling and Gaussian Process priors over the observed system states. This allows us to exploit temporal correlations in the observed data, and efficiently infer posterior distributions over plausible models with quantified uncertainty. The use of the Finnish Horseshoe as a sparsity-promoting prior for free model parameters also enables the discovery of parsimonious representations for the latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed GP-NODE method including predator–prey systems, systems biology and a 50-dimensional human motion dynamical system. This article is part of the theme issue ‘Data-driven prediction in dynamical systems’.

Science & Technology - Other Topics↗
DOE OSTI2026

Comprehensive analytical model of the dynamic 𝑍 pinch

In this work we present an analytical 1D axisymmetric model describing the evolution of the dynamic 𝑍 pinch. This model is capable of predicting the trajectories of the imploding sheath's magnetic piston and preceding shock front, along with the velocity, pressure, density, and magnetic field profiles, for any time-dependent current, spatially varying initial density profile, and weak initial axial field. The implosion is divided into stages, with each stage described by a set of coupled ordinary differential equations derived from the ideal MHD equations. Comparisons with experimental data from the COBRA pulsed-power facility are quite promising and imply this model could prove useful in designing and analyzing future pulsed-power experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Nonperturbative random matrix model of N = 2 JT supergravity

It is shown how to nonperturbatively define a random matrix model that captures key physics of N = 2 Jackiw-Teitelboim supergravity, going well beyond the perturbative topological expansion defined recently by Turiaci and Witten. A decomposition into an infinite family of certain multicritical models is derived, leading to the definition of a nonlinear ordinary differential equation from which the physics may be computed. Bogomol’nyi-Prasad-Sommerfield (BPS) states are naturally described by the model. The nonperturbative completions of the spectral densities for non-BPS multiplets are readily extracted. Published by the American Physical Society 2024

Johnson, Clifford V. (ORCID:0000000189645830)↗
DOE OSTI2024

Machine learning for the identification of phase transitions in interacting agent-based systems: A Desai-Zwanzig example

Deriving closed-form analytical expressions for reduced-order models, and judiciously choosing the closures leading to them, has long been the strategy of choice for studying phase- and noise-induced transitions for agent-based models (ABMs). In this paper, we propose a data-driven framework that pinpoints phase transitions for an ABM—the Desai-Zwanzig model—in its mean-field limit, using a smaller number of variables than traditional closed-form models. To this end, we use the manifold learning algorithm Diffusion Maps to identify a parsimonious set of data-driven latent variables, and we show that they are in one-to-one correspondence with the expected theoretical order parameter of the ABM. We then utilize a deep learning framework to obtain a conformal reparametrization of the data-driven coordinates that facilitates, in our example, the identification of a single parameter-dependent ordinary differential equation (ODE) in these coordinates. Additionally, we identify this ODE through a residual neural network inspired by a numerical integration scheme (forward Euler). We then use the identified ODE—enabled through an odd symmetry transformation—to construct the bifurcation diagram exhibiting the phase transition.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Computing with a Chemical Reservoir

Contemporary computation is expensive, with large language models and artificial intelligence becoming more common in daily life. However, high-performance computing is reaching the limits in speed and energy expenditure, and domain science requires ever-increasing computational capacity, with simulations and data analysis pipelines ever-growing in complexity. As we progress towards post-exascale computation, with the associated high energy costs, new methods of energy-conscious computation are required. Novel analog and hybrid digital-analog systems can overcome these challenges, and chemical reactions offer a promising avenue. Computers based on chemistry can provide compact desktop devices with immense computational power. These devices are readily scalable by considering greater reaction systems or vessels, meeting the high-performance requirements for scientific workflows. In this article, we present ChemComp, a compilation pipeline for the conversion of ordinary differential equations into implementable chemical reactions. We then demonstrate the solving capabilities of ChemComp by emulating a potential chemical reservoir device. We leverage the multi-layer intermediate representation (MLIR) compiler framework to implement an expressive chemical reaction abstraction and propose a path for chemical reaction networks (CRNs) to represent mathematical problems effectively. Combined, we demonstrate a potential workflow that can harness chemistry’s computing power to create energy-efficient, high-performance computation systems for contemporary computing needs.

artificial intelligence↗
DOE OSTI2023

Certifiably Robust Neural ODE With Learning-Based Barrier Function

Neural Ordinary Differential Equations (ODEs) have gained traction in many applications. While recent studies have focused on empirically increasing the robustness of neural ODEs against natural or adversarial attacks, certified robustness is still lacking. In this work, we propose a framework for training a neural ODE using barrier functions and demonstrate improved robustness for classification problems. Finally, we further provide the first generalization guarantee of robustness against adversarial attacks using a wait-and-judge scenario approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗