Sensitivity analysis on chaotic dynamical systems by Non-Intrusive Least Squares Adjoint Shadowing (NILSAS).
This paper develops the Non-Intrusive Least Squares Adjoint Shadowing (NILSAS) algorithm, which computes the gradient for long-time averaged objectives in chaotic dynamical systems. The computational cost of NILSAS scales with the number of unstable adjoint directions and the number of objectives, but is independent of the number of parameters. For developing the algorithm, we first prove several properties of the adjoint flow. Based on properties of the adjoint flow, we derive the adjoint shadowing direction. Finally, we approximate the adjoint shadowing direction by a `non-intrusive' formulation of a least squares problem: this formulation not only allows NILSAS be implemented with little modification to existing adjoint solvers, but also allows NILSAS to constrain the minimization to over only the unstable adjoint directions. Finally, we demonstrate NILSAS on the Lorenz 63 system.
Publisher URL: http://arxiv.org/abs/1801.08674
DOI: arXiv:1801.08674v1
Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.
Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.