Author： Amigó José M. Giménez Ángel
Publisher： MDPI
E-ISSN： 1099-4300|16|2|627-644
ISSN： 1099-4300
Source： Entropy, Vol.16, Iss.2, 2014-01, pp. : 627-644
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore, it simplifies a previous algorithm, also based on min-max symbols, which was originally proposed for twice differentiable multimodal maps. The new algorithm has been benchmarked against the old one with a number of multimodal maps, the results being reported in the paper. The comparison is favorable to the new algorithm, except in the unimodal case.
Related content
Computing the Topological Entropy of Multimodal Maps via Min-Max Sequences
By Amigó José María Dilão Rui Giménez Ángel
Entropy, Vol. 14, Iss. 4, 2012-04 ,pp. :
Access to resources
Recommend
On the Topological Entropy of Some Skew-Product Maps
Entropy, Vol. 15, Iss. 8, 2013-07 ,pp. :
Topological Characterization of Complex Systems: Using Persistent Entropy
By Merelli Emanuela Rucco Matteo Sloot Peter Tesei Luca
Entropy, Vol. 17, Iss. 10, 2015-10 ,pp. :