Globally Enumerating Unstable Periodic Orbits For Observed Data Using Symbolic Dynamics

CHAOS(2007)

引用 8|浏览4
暂无评分
摘要
The unstable periodic orbits of a chaotic system provide an important skeleton of the dynamics in a chaotic system, but they can be difficult to find from an observed time series. We present a global method for finding periodic orbits based on their symbolic dynamics, which is made possible by several recent methods to find good partitions for symbolic dynamics from observed time series. The symbolic dynamics are approximated by a Markov chain estimated from the sequence using information-theoretical concepts. The chain has a probabilistic graph representation, and the cycles of the graph may be exhaustively enumerated with a classical deterministic algorithm, providing a global, comprehensive list of symbolic names for its periodic orbits. Once the symbolic codes of the periodic orbits are found, the partition is used to localize the orbits back in the original state space. Using the periodic orbits found, we can estimate several quantities of the attractor such as the Lyapunov exponent and topological entropy.
更多
查看译文
关键词
symbolic dynamics,markov process,markov chain,random process,topological entropy,brownian motion,time series analysis,time series,lyapunov exponent,state space,graph representation,probability theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要