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

Kernel learning for robust dynamic mode decomposition: linear and nonlinear disambiguation optimization

Abstract: Research in modern data-driven dynamical systems is typically focused on the three key challenges of high dimensionality, unknown dynamics and nonlinearity. The dynamic mode decomposition (DMD) has emerged as a cornerstone for modelling high-dimensional systems from data. However, the quality of the linear DMD model is known to be fragile with respect to strong nonlinearity, which contaminates the model estimate. By contrast, sparse identification of nonlinear dynamics learns fully nonlinear models, disambigua… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(25 citation statements)
references
References 69 publications
0
25
0
Order By: Relevance
“…where ε(t) denotes the error associated with the projection of s(t) − s ref onto the linear subspace V. While many different manifold constructs are conceivable, we focus on a polynomial mapping between the highdimensional data samples and their lower-dimensional representations. Explicit nonlinear mappings with a polynomial structure were originally proposed in manifold learning [42], but similar formulations have emerged recently in model reduction [2,3,5,43,44]. Our attention will be restricted to the case of quadratic Kronecker products:…”
Section: Data-driven Quadratic Solution-manifoldsmentioning
confidence: 99%
“…where ε(t) denotes the error associated with the projection of s(t) − s ref onto the linear subspace V. While many different manifold constructs are conceivable, we focus on a polynomial mapping between the highdimensional data samples and their lower-dimensional representations. Explicit nonlinear mappings with a polynomial structure were originally proposed in manifold learning [42], but similar formulations have emerged recently in model reduction [2,3,5,43,44]. Our attention will be restricted to the case of quadratic Kronecker products:…”
Section: Data-driven Quadratic Solution-manifoldsmentioning
confidence: 99%
“…The leading numerical algorithm used to approximate K from trajectory data is dynamic mode decomposition (DMD) (Tu et al 2014;Kutz et al 2016a). First introduced by Schmid (2009Schmid ( , 2010 in the fluids community and connected to the Koopman operator in Rowley et al (2009), there are now numerous extensions and variants of DMD (Chen, Tu & Rowley 2012;Wynn et al 2013;Jovanović, Schmid & Nichols 2014;Kutz, Fu & Brunton 2016b;Noack et al 2016;Korda & Mezić 2018;Loiseau & Brunton 2018;Deem et al 2020;Klus et al 2020;Baddoo et al 2021Baddoo et al , 2022Herrmann et al 2021;Wang & Shoele 2021;. Of particular interest is extended DMD (EDMD) (Williams, Kevrekidis & Rowley 2015a), which generalised DMD to a broader class of nonlinear observables.…”
Section: Introductionmentioning
confidence: 99%
“…In this regard, the so-called kernel methods are also considered, when a certain set, called the dictionary, of transformations is selected to reduce the dimension of the basis arising in the spectrum approximation of the infinite-dimensional Koopman operator. For instance, in 29 a robust kernel method is presented, which allowed to separate with good accuracy the linear and nonlinear dynamics for dynamical systems of several different types.…”
Section: Introductionmentioning
confidence: 99%