Least squares shadowing method for sensitivity analysis of differential equations

From MaRDI portal
Publication:4596728




Abstract: For a parameterized hyperbolic system fracdudt=f(u,s) the derivative of the ergodic average langleJangle=limToinftyfrac1Tint0TJ(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 langleJangle 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 fracdlangleJangleds. 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.









This page was built for publication: Least squares shadowing method for sensitivity analysis of differential equations

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