Numerical aspects for approximating governing equations using data
From MaRDI portal
data-driven discoverydifferential-algebraic equationmeasurement dataordinary differential equationregressionsequential approximation
Implicit ordinary differential equations, differential-algebraic equations (34A09) Inverse problems involving ordinary differential equations (34A55) Time series analysis of dynamical systems (37M10) Nonparametric regression and quantile regression (62G08) Probabilistic models, generic numerical methods in probability and statistics (65C20)
Abstract: We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high accuracy. Upon recasting the problem into a function approximation problem, we discuss several important aspects for accurate approximation. Most notably, we discuss the importance of using a large number of short bursts of trajectory data, rather than using data from a single long trajectory. Several options for the numerical algorithms to perform accurate approximation are then presented, along with an error estimate of the final equation approximation. We then present an extensive set of numerical examples of both linear and nonlinear systems to demonstrate the properties and effectiveness of our equation recovery algorithms.
Recommendations
- Data assimilation algorithms for numerical models
- Numerical approximation of partial differential equations
- scientific article; zbMATH DE number 635667
- Numerical approximation of partial differential equations
- A forward approach to numerical data assimilation
- Solvability and numerical solution of variational data assimilation problems
- On the solvability and numerical solution of data assimilation problems
- Data driven governing equations approximation using deep neural networks
- Numerical linear algebra in data assimilation
- Finite difference methods for the numerical differentiation of non-exact data
Cites work
- A randomized algorithm for multivariate function approximation
- A randomized tensor quadrature method for high dimensional polynomial approximation
- A variational method for numerical differentiation
- Automated reverse engineering of nonlinear dynamical systems
- Correcting data corruption errors for multivariate function approximation
- Decoding by Linear Programming
- Detecting causality in complex ecosystems
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems
- Efficient collocational approach for parametric uncertainty analysis
- Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level analysis
- scientific article; zbMATH DE number 4105912 (Why is no real title available?)
- scientific article; zbMATH DE number 3708924 (Why is no real title available?)
- scientific article; zbMATH DE number 3516003 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3209393 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3301601 (Why is no real title available?)
- Learning partial differential equations via data discovery and sparse optimization
- Methods for numerical differentiation of noisy data
- Model selection for dynamical systems via sparse regression and information criteria
- Nonlinear Laplacian spectral analysis for time series with intermittency and low-frequency variability
- Normal forms for reduced stochastic climate models
- Numerical Differentiation and Regularization
- Numerical differentiation of noisy, nonsmooth data
- Polynomial chaos for semiexplicit differential algebraic equations of index 1
- Sequential function approximation on arbitrarily distributed point sets
- Sequential function approximation with noisy data
- Weighted discrete least-squares polynomial approximation using randomized quadratures
Cited in
(38)- Data fitting in partial differential algebraic equations: Some academic and industrial applications.
- A physics-informed operator regression framework for extracting data-driven continuum models
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- Poincaré maps for multiscale physics discovery and nonlinear Floquet theory
- Data-driven deep learning of partial differential equations in modal space
- On generalized residual network for deep learning of unknown dynamical systems
- Weak SINDy for partial differential equations
- Dynamic calibration of differential equations using machine learning, with application to turbulence models
- Adaptive deep density approximation for Fokker-Planck equations
- Deep neural network modeling of unknown partial differential equations in nodal space
- Model order reduction method based on (r)POD-ANNs for parameterized time-dependent partial differential equations
- Methods to recover unknown processes in partial differential equations using data
- Data driven governing equations approximation using deep neural networks
- Unsupervised discovery of interpretable hyperelastic constitutive laws
- Sequential approximation of functions in Sobolev spaces using random samples
- A particle swarm optimization-based method for numerically solving ordinary differential equations
- Deep learning of biological models from data: applications to ODE models
- Local parameter identification with neural ordinary differential equations
- WeakIdent: weak formulation for identifying differential equation using narrow-fit and trimming
- Data-driven learning of nonautonomous systems
- Learning interaction kernels in heterogeneous systems of agents from multiple trajectories
- The discovery of dynamics via linear multistep methods and deep learning: error estimation
- Structure-Preserving Method for Reconstructing Unknown Hamiltonian Systems From Trajectory Data
- Weak SINDy: Galerkin-based data-driven model selection
- SINDy-PI: a robust algorithm for parallel implicit sparse identification of nonlinear dynamics
- DL-PDE: Deep-Learning Based Data-Driven Discovery of Partial Differential Equations from Discrete and Noisy Data
- Data-driven sparse identification of nonlinear dynamical systems using linear multistep methods
- Deep-OSG: deep learning of operators in semigroup
- Accuracy and architecture studies of residual neural network method for ordinary differential equations
- Learning black- and gray-box chemotactic PDEs/closures from agent based Monte Carlo simulation data
- Simultaneous Identification and Denoising of Dynamical Systems
- A Review of Data‐Driven Discovery for Dynamic Systems
- Wave-packet behaviors of the defocusing nonlinear Schrödinger equation based on the modified physics-informed neural networks
- Implementation and (inverse modified) error analysis for implicitly templated ODE-nets
- WG-IDENT: weak group identification of PDEs with varying coefficients
- Weak-form modified sparse identification of nonlinear dynamics
- DUE: a deep learning framework and library for modeling unknown equations
- Kernel Localization and Whole-Trajectory Generalization for Linear Multistep Methods in Deep Learning-Based Discovery of Dynamical Systems
This page was built for publication: Numerical aspects for approximating governing equations using data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214649)
