A survey on computing the topological entropy of cubic polynomials (Q2040151): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Katarina Janková / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Katarina Janková / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3171450133 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2006.13795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating topological entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the topological entropy of maps of the interval with three monotone pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing topological entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of isentropes of polynomial maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of entropy for real multimodal maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Topological Entropy of General One-Dimensional Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive transversality via transfer operators and holomorphic motions with applications to monotonicity for interval maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3814426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On entropy and monotonicity for real cubic maps (with an appendix by Adrien Douady and Pierrette Sentenac) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneading sequences of skew tent maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing topological entropy in a space of quartic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density of hyperbolicity for classes of real transcendental entire functions and circle maps / rank
 
Normal rank

Latest revision as of 05:27, 26 July 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
    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

    Identifiers