An augmented shadowing algorithm for calculating the sensitivity of time-average quantities of chaotic systems
File(s) 1-s2.0-S0021999125003134-main.pdf (3.99 MB)
Published version
Author(s)
Fang, Liang
Papadakis, George
Type
Journal Article
Abstract
We apply the non-intrusive least-squares shadowing (NILSS) method to a newly proposed augmented tangent system in order to calculate the sensitivity of time-average quantities of chaotic dynamical systems to parameter variations. The original tangent system is augmented with an additional equation that acts as a low-pass filter, leaving low frequencies unaffected while filtering out high frequencies. A linear damping term is also added to the original tangent system; the term is activated at high frequencies but vanishes at low frequencies. The method introduces two new parameters, the damping coefficient and the time-scale of the filter. Their values can be estimated from the properties of the dynamical system. We evaluate the performance of the proposed algorithm in the Kuramoto–Sivashinsky equation and the Kolmogorov flow system. The number of non-negative Lyapunov exponents (NNLEs) of the augmented system is generally smaller than that of the original system, and this accelerates the sensitivity calculations. Comparisons with the standard NILSS demonstrate the accuracy of the method at a reduced computational cost. The proposed algorithm is more scalable compared to existing approaches and can be applied to sensitivity analysis as well as optimisation and control of complex, large-scale dynamical systems, including turbulent flows.
Date Issued
2025-08-01
Date Acceptance
2025-04-21
Citation
Journal of Computational Physics, 2025, 534
ISSN
0021-9991
Publisher
Elsevier
Journal / Book Title
Journal of Computational Physics
Volume
534
Copyright Statement
© 2025 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
License URL
Publication Status
Published
Article Number
114030
Date Publish Online
2025-04-25
