We present the theoretical basis for a novel way of studying and representing the long time behavior of finite dimensional maps. It is based on the sample paths of a Markov chain. Applications of the method to the approximation of attractors of maps and to finding the roots of a polynomial equation are discussed.
Citation: NIST Interagency/Internal Report (NISTIR) - 6182
Issue: No. 1
NIST Pub Series: NIST Interagency/Internal Report (NISTIR)
Pub Type: NIST Pubs
Attractors, chain transitive sets, Conley decomposition