Scholarlink

<p>There have been several approaches to measuring the ‘complexity’ of dynamical systems in literature. The entropic chaos degree (ECD) is one of them and its usefulness and applicability have been studied. However, the ECD has been used as a measure of the complexity of the <i>whole</i> system rather than as a measure of the complexity of an <i>individual</i> trajectory. In this paper we will study the ECD as a measure of the complexity of a <i>particular</i> orbit and we compare it with other orbit complexities such as the Brudno’s orbit complexity and Galatolo’s shadowing orbit complexity.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Entropic Chaos Degree and Orbit Complexities

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年2月11日

查看全文
  • Takeo Kamizawa

摘要

There have been several approaches to measuring the ‘complexity’ of dynamical systems in literature. The entropic chaos degree (ECD) is one of them and its usefulness and applicability have been studied. However, the ECD has been used as a measure of the complexity of the whole system rather than as a measure of the complexity of an individual trajectory. In this paper we will study the ECD as a measure of the complexity of a particular orbit and we compare it with other orbit complexities such as the Brudno’s orbit complexity and Galatolo’s shadowing orbit complexity.