arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.02180nlin.CD
收藏

通过嵌入的递归模式对高维混沌吸引子进行极小覆盖

Minimal cover of high-dimensional chaotic attractors by embedded recurrent patterns

Daniel L. Crane, Ruslan L. Davidchack, Alexander N. Gorban

AI总结:

提出一种通过嵌入不稳定递归模式构建高维混沌吸引子极小覆盖的通用方法,证明在低维子空间定义邻近度也能忠实构建极小覆盖,可用于简化描述吸引子结构与动力学。

摘要:

我们提出了一种通过嵌入不稳定递归模式构建高维混沌吸引子极小覆盖的通用方法。所谓极小覆盖,是指从可用模式中选取一个子集,使得在预定义邻近度阈值下,用该极小覆盖对混沌动力学的近似效果,与用全部可用集合进行近似的效果一样好。基于有向Hausdorff距离概念的邻近度测度可以相当自由地选择,并适应于给定混沌系统的特性。在周期域上Kuramoto--Sivashinsky系统的时空混沌吸引子背景下,我们证明,即使邻近度测度是在维数远小于包含吸引子的空间维数的子空间内定义的,也能忠实地构建极小覆盖。我们讨论了如何使用极小覆盖来提供对吸引子结构及其上动力学的简化描述。

英文摘要:

We propose a general method for constructing a minimal cover of high-dimensional chaotic attractors by embedded unstable recurrent patterns. By minimal cover we mean a subset of available patterns such that the approximation of chaotic dynamics by a minimal cover with a predefined proximity threshold is as good as the approximation by the full available set. The proximity measure, based on the concept of a directed Hausdorff distance, can be chosen with considerable freedom and adapted to the properties of a given chaotic system. In the context of a spatiotemporally chaotic attractor of the Kuramoto--Sivashinsky system on a periodic domain, we demonstrate that the minimal cover can be faithfully constructed even when the proximity measure is defined within a subspace of dimension much smaller than the dimension of space containing the attractor. We discuss how the minimal cover can be used to provide a reduced description of the attractor structure and the dynamics on it.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑