Paper detail

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

For a parameterized hyperbolic system $u_{i+1} = f(u_i,s)$, the derivative of an ergodic average $\ < J\ > = \underset{n\rightarrow\infty}{\lim} \frac1n \sum_1^n J(u_i,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\ > \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.

preprint2013arXivOpen access

Signal facts

What is known right now

Open access1 author1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Authors

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

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

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.