Next Article in Journal
Previous Article in Journal
Entropy 2014, 16(2), 627-644; doi:10.3390/e16020627
Article

A Simplified Algorithm for the Topological Entropy of Multimodal Maps

*  and
Received: 5 December 2013; in revised form: 14 January 2014 / Accepted: 14 January 2014 / Published: 23 January 2014
View Full-Text   |   Download PDF [944 KB, uploaded 23 January 2014]
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.
Keywords: topological entropy; multimodal maps; min-max symbols topological entropy; multimodal maps; min-max symbols
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Amigó, J.M.; Giménez, Á. A Simplified Algorithm for the Topological Entropy of Multimodal Maps. Entropy 2014, 16, 627-644.

AMA Style

Amigó JM, Giménez Á. A Simplified Algorithm for the Topological Entropy of Multimodal Maps. Entropy. 2014; 16(2):627-644.

Chicago/Turabian Style

Amigó, José M.; Giménez, Ángel. 2014. "A Simplified Algorithm for the Topological Entropy of Multimodal Maps." Entropy 16, no. 2: 627-644.


Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert