The Topological Entropy of One-dimensional Maps: Approximations and Bounds
classification
chao-dyn
nlin.CD
keywords
boundsentropymapsone-dimensionaltopologicalalgorithmapproximationapproximations
read the original abstract
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.