Convergence of the least squares shadowing method for computing derivative of ergodic averages
Abstract
For a parameterized hyperbolic system ui+1 = f(ui,s), the derivative of an ergodic average \ < J\ > = n→∞ 1n Σ1n J(ui,s) to the parameter s 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\ > 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.