Convergence of the least squares shadowing method for computing derivative of ergodic averages

preprint2013arXivOpen access

Abstract

For a parameterized hyperbolic system ui+1=f(ui,s)u_{i+1} = f(u_i,s), the derivative of an ergodic average  <J >=lim⁡n→∞1n∑1nJ(ui,s)\ < J\ > = \underset{n\rightarrow\infty}{\lim} \frac1n \sum_1^n J(u_i,s) to the parameter ss can be computed via the least squares sensitivity method. This method solves a constrained least squares problem and computes an approximation to the desired derivative d <J >dsd\ < J\ > \over ds from the solution. This paper proves that as the size of the least squares problem approaches infinity, the computed approximation converges to the true derivative.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.