Least squares shadowing sensitivity analysis of a modified Kuramoto-Sivashinsky equation
Name
Wang_Least squares.pdf
Size
2.33 MB
Format
Adobe PDF
Checksum (MD5)
80992e46039c365d0a5230a2685a5897
Author(s)
Blonigan, Patrick Joseph
Wang, Qiqi
Date Issued
April 2014
Journal
Chaos, Solitons & Fractals
Publisher
Elsevier
Citation
Blonigan, Patrick J., and Qiqi Wang. "Least squares shadowing sensitivity analysis of a modified Kuramoto–Sivashinsky equation." Chaos, Solitons & Fractals 64 (July 2014), pp.16-25.
Version
Original manuscript
Abstract
Computational methods for sensitivity analysis are invaluable tools for scientists and engineers investigating a wide range of physical phenomena. However, many of these methods fail when applied to chaotic systems, such as the Kuramoto–Sivashinsky (K–S) equation, which models a number of different chaotic systems found in nature. The following paper discusses the application of a new sensitivity analysis method developed by the authors to a modified K–S equation. We find that least squares shadowing sensitivity analysis computes accurate gradients for solutions corresponding to a wide range of system parameters.
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.chaos.2014.03.005
