Probability density adjoint for sensitivity analysis of the Mean of Chaos
Name
Wang_Probability density.pdf
Size
1.53 MB
Format
Adobe PDF
Checksum (MD5)
bd2ddfdaa0f8be1a803f7967108d0348
Author(s)
Blonigan, Patrick Joseph
Wang, Qiqi
Date Issued
April 2014
Journal
Journal of Computational Physics
Citation
Blonigan, Patrick J., and Qiqi Wang. “Probability Density Adjoint for Sensitivity Analysis of the Mean of Chaos.” Journal of Computational Physics 270 (August 2014): 660–686.
Version
Original manuscript
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.
This paper presents a new method for sensitivity analysis of 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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.jcp.2014.04.027
