Probability density adjoint for sensitivity analysis of the Mean of Chaos

Abstract

Sensitivity analysis, especially adjoint based sensitivity analysis, is a powerful tool for engineering design which allows for the efficient computation of sensitivities with respect to many parameters. However, these methods break down when used to compute sensitivities of long-time averaged quantities in chaotic dynamical systems. The following paper presents a new method for sensitivity analysis of {\em ergodic} chaotic dynamical systems, the density adjoint method. The method involves solving the governing equations for the system's invariant measure and its adjoint on the system's attractor manifold rather than in phase-space. This new approach is derived for and demonstrated on one-dimensional chaotic maps and the three-dimensional Lorenz system. It is found that the density adjoint computes very finely detailed adjoint distributions and accurate sensitivities, but suffers from large computational costs.

29 pages, 27 figures

Cited by in corpus (9)

• Least Squares Shadowing Sensitivity Analysis of a Modified Kuramoto-Sivashinsky Equation
• Multiple Shooting Shadowing for Sensitivity Analysis of Chaotic Dynamical Systems
• Gradient-free optimization of chaotic acoustics with reservoir computing
• Periodic Shadowing Sensitivity Analysis of Chaotic Systems
• Nonlinear Boundary Conditions for Energy and Entropy Stable Initial Boundary Value Problems in Computational Fluid Dynamics
• Nonlinear and Linearised Primal and Dual Initial Boundary Value Problems: When are they Bounded? How are they Connected?
• Computational assessment of smooth and rough parameter dependence of statistics in chaotic dynamical systems
• A computable realization of Ruelle's formula for linear response of statistics in chaotic systems
• Ergodic Sensitivity Analysis of One-Dimensional Chaotic Maps