Calculating topological entropy
This paper deals with the attempt to find effective algorithms for calculating the topological entropy of piecewise monotone maps of the interval having more than three pieces. The original motivation for the algorithms described in this paper is based on the following fact: If \(g\) is a piecewise monotone continuous function on the unit interval, then \(h(g)= \lim_{n\to \infty} \frac 1n \log \operatorname {Var}(g^n)\), where \(h(g)\) denotes the topological entropy of \(g\), and Var denotes the total variation. The authors present a modified algorithm based on the above mentioned result and prove that this algorithm is equivalent to the standard power method for finding eigenvalues of matrices (with shift of origin) in those cases for which the function is Markov. The authors present the numerical results when this algorithm is applied to a number of examples.
- An improved algorithm for computing topological entropy
- Computing the Topological Entropy of General One-Dimensional Maps
- Computing the topological entropy of maps
- Computing the topological entropy of maps of the interval with three monotone pieces
- Entropy of piecewise monotone mappings
- scientific article; zbMATH DE number 3719994 (Why is no real title available?)
- scientific article; zbMATH DE number 486633 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Matrix Analysis
- On the estimation of topological entropy
- Self-dual gravity and the chiral model
- Topological Entropy
- Computing the topological entropy for piecewise monotonic maps on the interval
- On the complexity of economic dynamics: an approach through topological entropy
- A survey on computing the topological entropy of cubic polynomials
- Topological permutation entropy
- On the estimation of topological entropy
- Formulas for the topological entropy of multimodal maps based on min-max symbols
- A note on the periodic orbits and topological entropy of graph maps
- Complexity dynamics of Gumowski-Mira Map
- Computing the topological entropy of multimodal maps via min-max sequences
- Applications of the min-max symbols of multimodal maps
- Topological entropy of one dimensional iterated function systems
- Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox
- Computing the Topological Entropy of General One-Dimensional Maps
- Rigorous computation of topological entropy with respect to a finite partition
- Chaos measure in a discrete SIR epidemic model with constant recovery
- Bifurcations and complexity dynamics of Burgers map
This page was built for publication: Calculating topological entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284953)
