Discovery of Dynamics Using Linear Multistep Methods

Abstract

Linear multistep methods (LMMs) are popular time discretization techniques for the numerical solution of differential equations. Traditionally they are applied to solve for the state given the dynamics (the forward problem), but here we consider their application for learning the dynamics given the state (the inverse problem). This repurposing of LMMs is largely motivated by growing interest in data-driven modeling of dynamics, but the behavior and analysis of LMMs for discovery turn out to be significantly different from the well-known, existing theory for the forward problem. Assuming a highly idealized setting of being given the exact state with a zero residual of the discrete dynamics, we establish for the first time a rigorous framework based on refined notions of consistency and stability to yield convergence using LMMs for discovery. When applying these concepts to three popular $M-$step LMMs, the Adams-Bashforth, Adams-Moulton, and Backwards Differentiation Formula schemes, the new theory suggests that Adams-Bashforth for $M$ ranging from $1$ and $6$, Adams-Moulton for $M=0$ and $M=1$, and Backwards Differentiation Formula for all positive $M$ are convergent, and, otherwise, the methods are not convergent in general. In addition, we provide numerical experiments to both motivate and substantiate our theoretical analysis.

References in corpus (19)

• Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
• Solving high-dimensional partial differential equations using deep learning
• LSTM Fully Convolutional Networks for Time Series Classification
• Bayesian Deep Convolutional Encoder-Decoder Networks for Surrogate Modeling and Uncertainty Quantification
• PDE-Net 2.0: Learning PDEs from Data with A Numeric-Symbolic Hybrid Deep Network
• Data Driven Governing Equations Approximation Using Deep Neural Networks
• Lift & Learn: Physics-informed machine learning for large-scale nonlinear dynamical systems
• Deep learning of dynamics and signal-noise decomposition with time-stepping constraints
• Data-Driven Deep Learning of Partial Differential Equations in Modal Space
• Multistep Neural Networks for Data-driven Discovery of Nonlinear Dynamical Systems
• Nonparametric inference of interaction laws in systems of agents from trajectory data
• A comparative study of physics-informed neural network models for learning unknown dynamics and constitutive relations
• NeuPDE: Neural Network Based Ordinary and Partial Differential Equations for Modeling Time-Dependent Data
• IDENT: Identifying Differential Equations with Numerical Time evolution
• Hierarchical Attention-Based Recurrent Highway Networks for Time Series Prediction
• Stochastic Training of Residual Networks: a Differential Equation Viewpoint
• Model Reduction with Memory and the Machine Learning of Dynamical Systems
• FD-Net with Auxiliary Time Steps: Fast Prediction of PDEs using Hessian-Free Trust-Region Methods
• Non-intrusive inference reduced order model for fluids using linear multistep neural network

Cited by in corpus (6)

• Weak SINDy For Partial Differential Equations
• Weak SINDy: Galerkin-Based Data-Driven Model Selection
• Kernel-based parameter estimation of dynamical systems with unknown observation functions
• Learning Interaction Kernels for Agent Systems on Riemannian Manifolds
• Accuracy and Architecture Studies of Residual Neural Network solving Ordinary Differential Equations
• Multiscale and Nonlocal Learning for PDEs using Densely Connected RNNs