Multigrid-in-time for sensitivity analysis of chaotic dynamical systems
Name
Wang_Multigrid-in-time.pdf
Size
1.2 MB
Format
Adobe PDF
Checksum (MD5)
0f016029f55aa65ab5879edb96d73057
Author(s)
Blonigan, Patrick Joseph
Wang, Qiqi
Date Issued
June 2014
Journal
Numerical Linear Algebra with Applications
Publisher
Wiley Blackwell
Citation
Blonigan, Patrick, and Qiqi Wang. “Multigrid-in-Time for Sensitivity Analysis of Chaotic Dynamical Systems: MULTIGRID-IN-TIME FOR CHAOTIC SENSITIVITY ANALYSIS.” Numerical Linear Algebra with Applications (2014): n. pag.
Version
Original manuscript
Abstract
The following paper discusses the application of a multigrid-in-time scheme to Least Squares Shadowing (LSS), a novel sensitivity analysis method for chaotic dynamical systems. While traditional sensitivity analysis methods break down for chaotic dynamical systems, LSS is able to compute accurate gradients. Multigrid is used because LSS requires solving a very large Karush–Kuhn–Tucker system constructed from the solution of the dynamical system over the entire time interval of interest. Several different multigrid-in-time schemes are examined, and a number of factors were found to heavily influence the convergence rate of multigrid-in-time for LSS. These include the iterative method used for the smoother, how the coarse grid system is formed and how the least squares objective function at the center of LSS is weighted.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1002/nla.1946
