2017
DOI: 10.1098/rspa.2016.0446
|View full text |Cite
|
Sign up to set email alerts
|

Learning partial differential equations via data discovery and sparse optimization

Abstract: We investigate the problem of learning an evolution equation directly from some given data. This work develops a learning algorithm to identify the terms in the underlying partial differential equations and to approximate the coefficients of the terms only using data. The algorithm uses sparse optimization in order to perform feature selection and parameter estimation. The features are data driven in the sense that they are constructed using nonlinear algebraic equations on the spatial derivatives of the data.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
334
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 365 publications
(335 citation statements)
references
References 36 publications
0
334
0
1
Order By: Relevance
“…In both plots, two terms are chosen from the 15 term trial set. The first plot is shows the result of a sparse optimization method for fitting the trial functions directly to the ODE, inspired by the trial functions used in [3][4][5][6] but using a similar model to Eq. [7].…”
Section: Figmentioning
confidence: 99%
See 1 more Smart Citation
“…In both plots, two terms are chosen from the 15 term trial set. The first plot is shows the result of a sparse optimization method for fitting the trial functions directly to the ODE, inspired by the trial functions used in [3][4][5][6] but using a similar model to Eq. [7].…”
Section: Figmentioning
confidence: 99%
“…In [3], a sequential thresholded least-squares algorithm is used to fit a set of candidate polynomials to computed velocity data. Sparse optimization for learning partial differential equations from spatio-temporal data is detailed in [4,5]. In [6], a sparse optimization problem is proposed for joint model selection and outlier detection, which allows for learning in the presence of time-intervals with large corruption.…”
mentioning
confidence: 99%
“…A major extension of the SINDy modeling framework generalized the library to include partial derivatives, enabling the identification of partial differential equations (PDEs) [58,59]. The resulting algorithm, called the PDE functional identification of nonlinear dynamics (FIND), which is especially relevant for materials discovery, has been demonstrated to successfully identify several canonical PDEs from classical physics, purely from noisy data.…”
Section: Sindy: Sparse Identification Of Nonlinear Dynamicsmentioning
confidence: 99%
“…features are written back in the form (2) and regression is used to find the coefficients. Usually, in regression all possible combinations [12] of the feature vectors Eq. 4 are chosen for minimization problem Eq.…”
Section: Sparse Regressionmentioning
confidence: 99%
“…7 is the parameter of the evolutionary algorithm. The second remark is that, in contrast to the existing algorithms [11,12,7], the target feature is chosen randomly, whereas in the sparse-regression only cases time-derivative is used.…”
Section: Evolutionary Algorithmmentioning
confidence: 99%