A survey on computing the topological entropy of cubic polynomials (Q2040151): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q587947 |
||
Property / reviewed by | |||
Property / reviewed by: Katarina Janková / rank | |||
Revision as of 12:30, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A survey on computing the topological entropy of cubic polynomials |
scientific article |
Statements
A survey on computing the topological entropy of cubic polynomials (English)
0 references
12 July 2021
0 references
Two algorithms for computing the topological entropy of interval maps are presented and discussed. The algorithm by \textit{A. Radulescu} [J. Stat. Phys. 130, No. 2, 373--385 (2008; Zbl 1131.37024)] computes the topological entropy by approximating it with sawtooth maps. Here this algorithm is used to compute the topological entropy of quartic polynomials, e.g., compositions of two logistic maps. The second algorithm, proposed by \textit{J. M. Amigó} and \textit{Á. Giménez} [Entropy, No. 16, 2, 627--644 (2014)] computes the lap number. It is here implemented to calculate the topological entropy and to get the isontropes for a parametric class of boundary anchored cubic polynomials. Further a comparison between these two algorithms is given.
0 references
topological entropy
0 references
logistic map
0 references