论文标题
一种简化的多模式图拓扑熵的算法
A simplified algorithm for the topological entropy of multimodal maps
论文作者
论文摘要
提出了一种计算多模式图的拓扑熵的数值算法。该算法是由包含所谓的Min-Max符号的封闭公式引起的，该公式与揉捏符号密切相关。此外，它也简化了先前的算法，也基于最小符号，该符号最初是针对两倍可区分的多模式图提出的。新算法已经针对旧算法进行了许多多模式图，并在本文中报告了结果。特别是，除非在单峰情况下，对新算法的比较有利于新算法。
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. In particular, the comparison is favorable to the new algorithm, except in the unimodal case.
