Approximating linear response by nonintrusive shadowing algorithms
arXiv:2003.09801
Abstract
Nonintrusive shadowing algorithms efficiently compute , the difference between shadowing trajectories, then use to compute derivatives of averaged objectives of chaos with respect to parameters of the dynamical system. However, previous proofs of shadowing methods wrongly assume that shadowing trajectories are representative. In contrast, the linear response formula is proved rigorously, but is more difficult to compute. We prove that gives only a part, called the shadowing contribution, of the linear response; hence, the other part, the unstable contribution, is the systematic error of shadowing methods. For systems with a small ratio of unstable dimensions, with some further statistical assumptions, we show that the unstable contribution is small. We also briefly describe an algorithm for the unstable contribution, which is simpler to derive but less efficient than the fast linear response algorithm. Moreover, we prove the convergence of the nonintrusive shadowing algorithm, the fastest shadowing algorithm, to and to the shadowing contribution.
24 pages, no figure
References in corpus (9)
- Multiple Shooting Shadowing for Sensitivity Analysis of Chaotic Dynamical Systems
- Adjoint sensitivity analysis on chaotic dynamical systems by Non-Intrusive Least Squares Adjoint Shadowing (NILSAS)
- Periodic Shadowing Sensitivity Analysis of Chaotic Systems
- Sensitivity analysis on chaotic dynamical systems by Finite Difference Non-Intrusive Least Squares Shadowing (FD-NILSS)
- Fourier approximation of the statistical properties of Anosov maps on tori
- A computable realization of Ruelle's formula for linear response of statistics in chaotic systems
- A Preconditioned Multiple Shooting Shadowing Algorithm for the Sensitivity Analysis of Chaotic Systems
- Adjoint shadowing directions in hyperbolic systems for sensitivity analysis
- Fast differentiation of hyperbolic chaos