A Preconditioned Multiple Shooting Shadowing Algorithm for the Sensitivity Analysis of Chaotic Systems
Karim Shawki, George Papadakis

TL;DR
This paper introduces a preconditioned MSS algorithm with a block diagonal preconditioner for efficient sensitivity analysis in chaotic systems, demonstrating significant convergence improvements and applicability to large-scale problems.
Contribution
It develops a matrix-free, parallelizable preconditioner for MSS, enhancing convergence and enabling sensitivity analysis of large chaotic systems like turbulence.
Findings
Preconditioner accelerates MSS convergence.
Eigenvalue bracketing improves stability and speed.
Method closely matches finite difference sensitivities.
Abstract
We propose a preconditioner that can accelerate the rate of convergence of the Multiple Shooting Shadowing (MSS) method. This recently proposed method can be used to compute derivatives of time-averaged objectives (also known as sensitivities) to system parameter(s) for chaotic systems. We propose a block diagonal preconditioner, which is based on a partial singular value decomposition of the MSS constraint matrix. The preconditioner can be computed using matrix-vector products only (i.e. it is matrix-free) and is fully parallelised in the time domain. Two chaotic systems are considered, the Lorenz system and the 1D Kuramoto Sivashinsky equation. Combination of the preconditioner with a regularisation method leads to tight bracketing of the eigenvalues to a narrow range. This combination results in a significant reduction in the number of iterations, and renders the convergence rate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
