Calculating Topological Entropy

The attempt to find effective algorithms for calculating the topological entropy of piecewise monotone maps of the interval having more than three monotone pieces has proved to be a difficult problem. The algorithm introduced here is motivated by the fact that if f: [0, 1] → [0, 1] is a piecewise monotone map of the unit interval into itself, thenh(f)=limn→∞ (1/n) log Var(fn), where h(f) is the topological entropy off, and Var(fn) is the total variation offn. We show that it is not feasible to use this formula directly to calculate numerically the topological entropy of a piecewise monotone function, because of the slow convergence. However, a close examination of the reasons for this failure leads ultimately to the modified algorithm which is presented in this paper. We 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, and present encouraging experimental evidence for the usefulness of the algorithm in general by applying it to several one-parameter families of test functions.