Least squares shadowing sensitivity analysis of a modified Kuramoto-Sivashinsky equation

From MaRDI portal
Publication:336145

DOI10.1016/J.CHAOS.2014.03.005zbMATH Open1348.35025arXiv1307.8197OpenAlexW2075808749MaRDI QIDQ336145FDOQ336145


Authors: Patrick J. Blonigan, Qiqi Wang Edit this on Wikidata


Publication date: 10 November 2016

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1307.8197




Recommendations



Cites Work


Cited In (18)





This page was built for publication: Least squares shadowing sensitivity analysis of a modified Kuramoto-Sivashinsky equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336145)