Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic system”

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 487 records · Page 27

Data Assimilation Methods for Dynamical Systems [Slides]

Models are not perfect. Observations are not perfect. Data assimilation combines these sources of imperfect information to provide better information. The outline for this presentation is as follows: Introduction to Data Assimilation Variational Methods 3 Kalman Filter Methods Lorenz 96 EnKF Example Data Assimilation Examples

97 MATHEMATICS AND COMPUTING↗

Learning Implicit Models of Complex Dynamical Systems From Partial Observations [Slides]

Conclusions: certain data-driven models do implicitly what physics simulations do explicitly; theoretical underpinnings in Koopman theory, delay-coordinate embeddings, and Mori-Zwanzig formalism; best approach for given system with finite data an open question; physics-informed machine learning (PIML) emerging framework for combining explicit and implicit modeling.

97 MATHEMATICS AND COMPUTING↗

CSPlib - A Software Toolkit for the Analysis of Dynamical Systems and Chemical Kinetic Models

CSPlib is an open source software library for analyzing general ordinary differential equation (ODE) systems and detailed chemical kinetic ODE systems. It relies on the computational singular perturbation (CSP) method for the analysis of these systems. The software provides support for: General ODE models (gODE model class) for computing source terms and Jacobians for a generic ODE system; TChem model (ChemElemODETChem model class) for computing source term, Jacobian, other necessary chemical reaction data, as well as the rates of progress for a homogenous batch reactor using an elementary step detailed chemical kinetic reaction mechanism. This class relies on the TChem [2] library; A set of functions to compute essential elements of CSP analysis (Kernel class). This includes computations of the eigensolution of the Jacobian matrix, CSP basis vectors and co-vectors, time scales (reciprocals of the magnitudes of the Jacobian eigenvalues), mode amplitudes, CSP pointers, and the number of exhausted modes. This class relies on the Tines library; A set of functions to compute the eigensolution of the Jacobian matrix using Tines library GPU eigensolver; A set of functions to compute CSP indices (Index Class). This includes participation indices and both slow and fast importance indices.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Quantification in High-Low Dynamic System Coupling Using RAVEN and TRANSFORM

This report demonstrates new functionality and applications stemming from the development of high fidelity to low fidelity (high-low) coupling for system simulations and to further explore the capabilities of RAVEN in the performance of uncertainty quantification in this kind of high-low coupled system models. The work builds from previous work on high-low coupling that utilized CTF, the high fidelity subchannel analysis code, with a low fidelity model built in TRANSFORM, the system analysis code, utilizing the Functional Mock-Up Interface (FMI)

97 MATHEMATICS AND COMPUTING↗

An Ensemble Score Filter for Tracking High-Dimensional Nonlinear Dynamical Systems

We propose an ensemble score filter (EnSF) for solving high-dimensional nonlinear filtering problems with superior accuracy. A major drawback of existing filtering methods, e.g., particle filters or ensemble Kalman filters, is the low accuracy in handling high-dimensional and highly nonlinear problems. EnSF attacks this challenge by exploiting the score-based diffusion model, defined in a pseudo-temporal domain, to characterizing the evolution of the filtering density. EnSF stores the information of the recursively updated filtering density function in the score function, in stead of storing the information in a set of finite Monte Carlo samples (used in particle filters and ensemble Kalman filters). Unlike existing diffusion models that train neural networks to approximate the score function, we develop a training-free score estimation that uses mini-batch-based Monte Carlo estimator to directly approximate the score function at any pseudo-spatial-temporal location, which provides sufficient accuracy in solving high-dimensional nonlinear problems as well as saves tremendous amount of time spent on training neural networks. Another essential aspect of EnSF is its analytical update step, gradually incorporating data information into the score function, which is crucial in mitigating the degeneracy issue faced when dealing with very high-dimensional nonlinear filtering problems. High-dimensional Lorenz systems are used to demonstrate the performance of our method. EnSF provides surprisingly impressive performance in reliably tracking extremely high-dimensional Lorenz systems (up to 1,000,000 dimension) with highly nonlinear observation processes, which is a well-known challenging problem for existing filtering methods.

97 MATHEMATICS AND COMPUTING↗