Least Squares Shadowing method for sensitivity analysis of differential equations

Abstract

For a parameterized hyperbolic system dudt=f(u,s) the derivative of the ergodic average J = T ∞1T∫0T J(u(t),s) to the parameter s can be computed via the Least Squares Shadowing algorithm (LSS). We assume that the sytem is ergodic which means that J depends only on s (not on the initial condition of the hyperbolic system). After discretizing this continuous system using a fixed timestep, the algorithm solves a constrained least squares problem and, from the solution to this problem, computes the desired derivative d J ds. The purpose of this paper is to prove that the value given by the LSS algorithm approaches the exact derivative when the discretization timestep goes to 0 and the timespan used to formulate the least squares problem grows to infinity.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…