Journal
NUMERISCHE MATHEMATIK
Volume 142, Issue 2, Pages 421-463Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s00211-019-01031-z
Keywords
-
Categories
Funding
- Research Training Program scholarship
- Erwin Schrodinger Institute, Vienna
Ask authors/readers for more resources
Markov expanding maps, a class of simple chaotic systems, are commonly used as models for chaotic dynamics, but existing numerical methods to study long-time statistical properties such as invariant measures have a poor trade-off between computational effort and accuracy. We develop a spectral Galerkin method for these maps' transfer operators, estimating statistical quantities using finite submatrices of the transfer operators' infinite Fourier or Chebyshev basis coefficient matrices. Rates of convergence of these estimates are obtained via quantitative bounds on the full transfer operator matrix entries; we find the method furnishes up to exponentially accurate estimates of statistical properties in only a polynomially large computational time. To implement these results we suggest and demonstrate two algorithms: a rigorously-validated algorithm, and a fast, more convenient adaptive algorithm. Using the first algorithm we prove rigorous bounds on some exemplar quantities that are substantially more accurate than previous. We show that the adaptive algorithm can produce double floating-point accuracy estimates in a fraction of a second on a personal computer.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available