Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Finite Precision Representation of the Conley Decomposition

Published

Author(s)

Fern Y. Hunt

Abstract

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
- 6182
Report Number
6182
Volume
13
Issue
No. 1

Keywords

Attractors, chain transitive sets, Conley decomposition

Citation

Hunt, F. (1998), Finite Precision Representation of the Conley Decomposition, - 6182, National Institute of Standards and Technology, Gaithersburg, MD (Accessed December 21, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created December 1, 1998, Updated June 2, 2021