Search

Nonintrusive shadowing algorithms efficiently compute $v$, the difference between shadowing trajectories, then use $v$ 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 $v$ 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 $v$ and to the shadowing contribution., 24 pages, no figure

We develop the NILSAS algorithm, which performs adjoint sensitivity analysis of chaotic systems via computing the adjoint shadowing direction. NILSAS constrains its minimization to the adjoint unstable subspace, and can be implemented with little modification to existing adjoint solvers. The computational cost of NILSAS is independent of the number of parameters. We demonstrate NILSAS on the Lorenz 63 system and a weakly turbulent three-dimensional flow over a cylinder., Comment: 34 pages, 11 figures. The adjoint shadowing direction which we compute is defined at arXiv:1807.05568

We present the Finite Difference Non-Intrusive Least Squares Shadowing (FD-NILSS) algorithm for computing sensitivities of long-time averaged quantities in chaotic dynamical systems. FD-NILSS does not require tangent solvers, and can be implemented with little modification to existing numerical simulation software. We also give a formula for solving the least-squares problem in FD-NILSS, which can be applied in NILSS as well. Finally, we apply FD-NILSS for sensitivity analysis of a chaotic flow over a 3-D cylinder at Reynolds number 525, where FD-NILSS computes accurate sensitivities and the computational cost is in the same order as the numerical simulation., 20 pages, 8 figures

This paper uses compressible flow simulation to analyze the hyperbolicity, shadowing directions, and sensitivities of a weakly turbulent three dimensional cylinder flow at Reynolds number 525 and Mach number 0.1. By computing the first 40 Covariant Lyapunov Vectors (CLVs), we find that unstable CLVs are active in the near-wake region, whereas stable CLVs are active in the far-wake region. This phenomenon is related to hyperbolicity since it shows that CLVs point to different directions; it also suggests that for open flows there is a large fraction of CLVs that are stable. However, due to the extra neutral CLV and the occasional tangencies between CLVs, our system is not uniform hyperbolic. By the Non-intrusive least-squares shadowing (NILSS) algorithm, we compute shadowing directions and sensitivities of long-time-averaged objectives. Our results suggest that shadowing methods may be valid for general chaotic fluid problems., Comment: 26 pages, 14 figures

For a parameterized hyperbolic system $\frac{du}{dt}=f(u,s)$ the derivative of the ergodic average $\langle J \rangle = \lim_{T \to \infty}\frac{1}{T}\int_0^T J(u(t),s)$ to the parameter $s$ can be computed via the Least Squares Shadowing algorithm (LSS). We assume that the sytem is ergodic which means that $\langle J \rangle$ depends only on $s$ (not on the initial condition of the hyperbolic system). After discretizing this continuous system using a fixed timestep, the algorithm solves a constrained least squares problem and, from the solution to this problem, computes the desired derivative $\frac{d\langle J \rangle}{ds}$. The purpose of this paper is to prove that the value given by the LSS algorithm approaches the exact derivative when the discretization timestep goes to $0$ and the timespan used to formulate the least squares problem grows to infinity., 21 pages, this article complements arXiv:1304.3635 and analyzes LSS for the case of continuous hyperbolic systems