A Simplified Algorithm for the Topological Entropy of Multimodal Maps

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 sy...

Full description

Bibliographic Details
Published in:Entropy
Main Authors: José M. Amigó, Ángel Giménez
Format: Article
Language:English
Published: MDPI AG 2014-01-01
Subjects:
Online Access:http://www.mdpi.com/1099-4300/16/2/627
_version_ 1851940739275030528
author José M. Amigó
Ángel Giménez
author_facet José M. Amigó
Ángel Giménez
author_sort José M. Amigó
collection DOAJ
container_title Entropy
description 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.
format Article
id doaj-art-e1e97265a1114bc38c13d593ff788dad
institution Directory of Open Access Journals
issn 1099-4300
language English
publishDate 2014-01-01
publisher MDPI AG
record_format Article
spelling doaj-art-e1e97265a1114bc38c13d593ff788dad2025-08-19T21:50:33ZengMDPI AGEntropy1099-43002014-01-0116262764410.3390/e16020627e16020627A Simplified Algorithm for the Topological Entropy of Multimodal MapsJosé M. Amigó0Ángel Giménez1Centro de Investigación Operativa, Universidad Miguel Hernández, Avda. de la Universidad s/n, Elche 03202, SpainCentro de Investigación Operativa, Universidad Miguel Hernández, Avda. de la Universidad s/n, Elche 03202, SpainA 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.http://www.mdpi.com/1099-4300/16/2/627topological entropymultimodal mapsmin-max symbols
spellingShingle José M. Amigó
Ángel Giménez
A Simplified Algorithm for the Topological Entropy of Multimodal Maps
topological entropy
multimodal maps
min-max symbols
title A Simplified Algorithm for the Topological Entropy of Multimodal Maps
title_full A Simplified Algorithm for the Topological Entropy of Multimodal Maps
title_fullStr A Simplified Algorithm for the Topological Entropy of Multimodal Maps
title_full_unstemmed A Simplified Algorithm for the Topological Entropy of Multimodal Maps
title_short A Simplified Algorithm for the Topological Entropy of Multimodal Maps
title_sort simplified algorithm for the topological entropy of multimodal maps
topic topological entropy
multimodal maps
min-max symbols
url http://www.mdpi.com/1099-4300/16/2/627
work_keys_str_mv AT josemamigo asimplifiedalgorithmforthetopologicalentropyofmultimodalmaps
AT angelgimenez asimplifiedalgorithmforthetopologicalentropyofmultimodalmaps
AT josemamigo simplifiedalgorithmforthetopologicalentropyofmultimodalmaps
AT angelgimenez simplifiedalgorithmforthetopologicalentropyofmultimodalmaps