2017
DOI: 10.1016/j.jcp.2016.10.035
|View full text |Cite
|
Sign up to set email alerts
|

Simplified Least Squares Shadowing sensitivity analysis for chaotic ODEs and PDEs

Abstract: This paper develops a variant of the Least Squares Shadowing (LSS) method, which has successfully computed the derivative for several chaotic ODEs and PDEs. The development in this paper aims to simplify Least Squares Shadowing method by improving how time dilation is treated. Instead of adding an explicit time dilation term as in the original method, the new variant uses windowing, which can be more efficient and simpler to implement, especially for PDEs.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…By deploying the shadowing lemma [120,121], the sensitivity of timeaveraged cost functionals was developed by Wang [122]. Such a technique was made more computationally feasible by the least-square shadowing method [123][124][125][126] and its improved versions [127][128][129]. The discussion of Larsson and Wang [130] is particularly relevant to fluid dynamics simulations.…”
Section: Non-reacting Flowsmentioning
confidence: 99%
“…By deploying the shadowing lemma [120,121], the sensitivity of timeaveraged cost functionals was developed by Wang [122]. Such a technique was made more computationally feasible by the least-square shadowing method [123][124][125][126] and its improved versions [127][128][129]. The discussion of Larsson and Wang [130] is particularly relevant to fluid dynamics simulations.…”
Section: Non-reacting Flowsmentioning
confidence: 99%
“…This is natural due to the fact that turbulence is a chaotic system so that any linear sensitivity evaluation (be it forward or backward) is bound to diverge. [20][21][22] This limits in practice the length of our optimal control window, which we take here to be 200 s.…”
Section: Appendix C: Gradient Verificationmentioning
confidence: 99%
“…We estimate the sensitivity of x3 = lim T →∞ 1 T T 0 x 3 t dt with respect to θ at θ = 28, which is approximately 0.981, an average of 50 finite difference estimates using different initial conditions shown in [4]. Theorem 3.1 in chapter IV in [17] shows that the invariant measure π σ of the stochastic Lorenz equation weakly converges to π 0 as σ → 0 in discrete version, but the convergence speed is not known.…”
Section: Numerical Investigationmentioning
confidence: 99%
“…The black line shows the sensitivity of the ODE, a constant 0.981 shown in [4]. For the SDEs, we use the new PS estimator and similarly simulate longer T for smaller σ.…”
Section: Numerical Investigationmentioning
confidence: 99%