2008
DOI: 10.1063/1.3030611
|View full text |Cite
|
Sign up to set email alerts
|

Spatiotemporal system reconstruction using Fourier spectral operators and structure selection techniques

Abstract: A technique based on trigonometric spectral methods and structure selection is proposed for the reconstruction, from observed time series, of spatiotemporal systems governed by nonlinear partial differential equations of polynomial type with terms of arbitrary derivative order and nonlinearity degree. The system identification using Fourier spectral differentiation operators in conjunction with a structure selection procedure leads to a parsimonious model of the original system by detecting and eliminating the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
15
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(16 citation statements)
references
References 47 publications
(38 reference statements)
1
15
0
Order By: Relevance
“…Such reliability and high accuracy in the presence of noisy or sparse data is indispensable for analysis of experimental data. Notably, even in the absence of noise, our results compare very favorably with those of previous studies 11,14 because the discretization error of the algorithm can be made extremely small: for the Kuramoto-Sivashinsky equation, the relative error in all parameters can easily be reduced to 10 −10 . It is also important to mention that the computational cost of our algorithm is comparable to that of existing sparse regression methods.…”
Section: Discussionsupporting
confidence: 83%
See 2 more Smart Citations
“…Such reliability and high accuracy in the presence of noisy or sparse data is indispensable for analysis of experimental data. Notably, even in the absence of noise, our results compare very favorably with those of previous studies 11,14 because the discretization error of the algorithm can be made extremely small: for the Kuramoto-Sivashinsky equation, the relative error in all parameters can easily be reduced to 10 −10 . It is also important to mention that the computational cost of our algorithm is comparable to that of existing sparse regression methods.…”
Section: Discussionsupporting
confidence: 83%
“…Sparse regression aims to convert the PDE (1) to a tractable (and ideally, robust) linear algebra problem. Conventionally this is done by evaluating all of the terms in the PDE at a random collection of points (x k , t k ) using finite differences 17,18 , spectral methods 11,12 , or polynomial approximation 14,15 . All of these approaches are extremely sensitive to noise, especially when high-order derivatives are present.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…2 Our attempt is to extend the algebraic spectral operators to the field of system identification and highlight their superiority when dealing with inverse problems for spatiotemporal systems on nonperiodic domains. We will also introduce a filtering algorithm that builds on the accuracy of the proposed spectral operators and leads to automatic SR.…”
Section: Introductionmentioning
confidence: 99%
“…In our case, this is not an option, since f satisfies neither condition. Furthermore, taking a derivative greatly amplifies the noise present in the data, whether this is done using finite differences 6,12 , polynomial interpolation 11 , or spectral methods 13,14 . Instead, we use a weak form of the model to address both noise sensitivity and the dependence on latent variables.…”
mentioning
confidence: 99%