• Corpus ID: 17062866

Discretization of transfer operators using a sparse hierarchical tensor basis - the Sparse Ulam method

@article{Junge2008DiscretizationOT,
  title={Discretization of transfer operators using a sparse hierarchical tensor basis - the Sparse Ulam method},
  author={Oliver Junge and P{\'e}ter Koltai},
  journal={arXiv: Numerical Analysis},
  year={2008}
}
  • O. Junge, P. Koltai
  • Published 27 February 2008
  • Computer Science
  • arXiv: Numerical Analysis
The global macroscopic behaviour of a dynamical system is encoded in the eigenfunctions of a certain transfer operator associated to it. For systems with low dimensional long term dynamics, efficient techniques exist for a numerical approximation of the most important eigenfunctions, cf. DeJu99a. They are based on a projection of the operator onto a space of piecewise constant functions supported on a neighborhood of the attractor - Ulam's method. In this paper we develop a numerical technique… 
1 Citations

Figures from this paper

Computing the invariant measure and the Lyapunov exponent for one-dimensional maps using a measure-preserving polynomial basis
TLDR
A generalisation of Ulam's method for approximating invariant densities of one-dimensional maps uses polynomials of degree n which are defined by the requirement that they preserve the measure on neighbouring subintervals to approximate the density.

References

SHOWING 1-10 OF 39 REFERENCES
On the Approximation of Complicated Dynamical Behavior
We present efficient techniques for the numerical approximation of complicated dynamical behavior. In particular, we develop numerical methods which allow us to approximate Sinai--Ruelle--Bowen
Approximating Physical Invariant Measures of Mixing Dynamical Systems
A subdivision algorithm for the computation of unstable manifolds and global attractors
Summary.Each invariant set of a given dynamical system is part of the global attractor. Therefore the global attractor contains all the potentially interesting dynamics, and, in particular, it
Sparse grids
TLDR
The basic features of sparse grids are described and the results of various numerical experiments for the solution of elliptic PDEs as well as for other selected problems such as numerical quadrature and data mining are reported.
An adaptive method for the approximation of the generalized cell mapping
An adaptive subdivision technique for the approximation of attractors and invariant measures
TLDR
This article intertwine the subdivision process with the computation of invariant measures and proposes an adaptive scheme for the box refinement which is based on the combination of these methods.
High order approximation of the Frobenius-Perron operator
An adaptive subdivision technique for the approximation of attractors and invariant measures: proof of convergence
  • O. Junge
  • Mathematics, Computer Science
  • 2001
We prove convergence of a recently introduced adaptive multilevel algorithm for the efficient computation of invariant measures and attractors of dynamical systems. The proof works in the context of
...
...