Least squares shadowing method for sensitivity analysis of differential equations
From MaRDI portal
Structural stability and analogous concepts of solutions to ordinary differential equations (34D30) Ergodicity, mixing, rates of mixing (37A25) Approximate trajectories (pseudotrajectories, shadowing, etc.) in smooth dynamics (37C50) Uniformly hyperbolic systems (expanding, Anosov, Axiom A, etc.) (37D20) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)
Abstract: For a parameterized hyperbolic system the derivative of the ergodic average to the parameter can be computed via the Least Squares Shadowing algorithm (LSS). We assume that the sytem is ergodic which means that depends only on (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 . 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 and the timespan used to formulate the least squares problem grows to infinity.
Recommendations
- Convergence of the least squares shadowing method for computing derivative of ergodic averages
- Periodic shadowing sensitivity analysis of chaotic systems
- Least squares shadowing sensitivity analysis of chaotic limit cycle oscillations
- Sensitivity analysis on chaotic dynamical systems by non-intrusive least squares shadowing (NILSS)
- Sensitivity analysis on chaotic dynamical systems by finite difference non-intrusive least squares shadowing (FD-NILSS)
Cites work
- Aerodynamic shape optimization of supersonic aircraft configurations via an adjoint formulation on distributed memory parallel computers
- Blended response algorithms for linear fluctuation-dissipation for complex nonlinear dynamical systems
- Convergence of the least squares shadowing method for computing derivative of ergodic averages
- Differentiation of SRB states
- Dynamics beyond uniform hyperbolicity. A global geometric and probabilistic perspective
- Entropy, thermostats, and chaotic hypothesis
- scientific article; zbMATH DE number 3744787 (Why is no real title available?)
- Hyperbolic chaos. A physicist's view
- Least squares shadowing sensitivity analysis of chaotic limit cycle oscillations
- Ruelle's linear response formula, ensemble adjoint schemes and Lévy flights
Cited in
(15)- Simplified least squares shadowing sensitivity analysis for chaotic ODEs and PDEs
- Periodic shadowing sensitivity analysis of chaotic systems
- Sensitivity analysis on chaotic dynamical systems by finite difference non-intrusive least squares shadowing (FD-NILSS)
- Adjoint sensitivity analysis on chaotic dynamical systems by non-intrusive least squares adjoint shadowing (NILSAS)
- Computation of sensitivity of periodically excited dynamical systems
- Least squares shadowing sensitivity analysis of a modified Kuramoto-Sivashinsky equation
- A Sensitivity Analysis for Least-Squares Ill-Posed Problems Using the Haar Basis
- Efficient computation of linear response of chaotic attractors with one-dimensional unstable manifolds
- Approximating linear response by nonintrusive shadowing algorithms
- Convergence of the least squares shadowing method for computing derivative of ergodic averages
- On the Application of Optimal Control Techniques to the Shadowing Approach for Time Averaged Sensitivity Analysis of Chaotic Systems
- Sensitivity analysis on chaotic dynamical systems by non-intrusive least squares shadowing (NILSS)
- Fast differentiation of hyperbolic chaos
- Adjoint of least squares shadowing: existence, uniqueness and coarse domain discretization
- Mitigating adjoint chaos in wall turbulence
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)