This paper discusses an easy to implement procedure for approximating the long time behavior of iterates of maps. Applications include to finding the roots of a complex polynomial and approximating attractors. The method uses the theory of Markov chains.
Proceedings Title: Proceedings of the Equadiff '99 Conference on Differential Equations
Conference Dates: August 1-7, 1999
Conference Location: Berlin, GE
Conference Title: Equadiff Conference on Differential Equations
Pub Type: Conferences
attractors, conley decomposition, invariant measure