Empirical generating partitions of driven oscillators using optimized symbolic shadowing

Navendu S. Patil, Joseph Paul Cusumano

Research output: Contribution to journalArticle

Abstract

We present an optimized version of the symbolic shadowing algorithm for coarse graining a continuous state dynamical system, originally due to Hirata and co-workers [Phys. Rev. E 70, 016215 (2004)PLEEE81539-375510.1103/PhysRevE.70.016215]. We validate our algorithm by finding generating partitions presented previously in the literature. We show that, unlike the original, the optimized algorithm can approximate generating partitions for periodically driven continuous-time nonlinear oscillators. We recover known generating partitions for the driven Duffing oscillator and compute generating partitions for the driven van der Pol oscillator. We also examine the problem of how algorithms such as ours can be applied "objectively," that is, by starting from arbitrary initial partition guesses. By applying our algorithm to large ensembles of initial random partitions, we show that symbolic shadowing leads to a multiplicity of candidate generating partitions that localize points in phase space to a high degree, thus making it difficult to select the best choice(s). We thus propose using the Lempel-Ziv complexity to identify partitions from this set of candidates that are, in a specific sense, "minimal," i.e., those with contiguous cells, fewer cell boundaries, and a smaller number of cells compared to their rivals. We also show how our methods can be used to indicate the appropriate number of symbols needed to approximate a generating partition.

Original languageEnglish (US)
Article number032211
JournalPhysical Review E
Volume98
Issue number3
DOIs
StatePublished - Sep 17 2018

Fingerprint

Shadowing
partitions
oscillators
Partition
Cell
Random Partitions
cells
Van Der Pol Oscillator
Coarse-graining
Duffing Oscillator
Nonlinear Oscillator
Guess
Continuous Time
Phase Space
dynamical systems
Multiplicity
Ensemble
Dynamical system
Arbitrary

All Science Journal Classification (ASJC) codes

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Cite this

@article{e3854876138d4462a9f57ac7e2b04a1b,
title = "Empirical generating partitions of driven oscillators using optimized symbolic shadowing",
abstract = "We present an optimized version of the symbolic shadowing algorithm for coarse graining a continuous state dynamical system, originally due to Hirata and co-workers [Phys. Rev. E 70, 016215 (2004)PLEEE81539-375510.1103/PhysRevE.70.016215]. We validate our algorithm by finding generating partitions presented previously in the literature. We show that, unlike the original, the optimized algorithm can approximate generating partitions for periodically driven continuous-time nonlinear oscillators. We recover known generating partitions for the driven Duffing oscillator and compute generating partitions for the driven van der Pol oscillator. We also examine the problem of how algorithms such as ours can be applied {"}objectively,{"} that is, by starting from arbitrary initial partition guesses. By applying our algorithm to large ensembles of initial random partitions, we show that symbolic shadowing leads to a multiplicity of candidate generating partitions that localize points in phase space to a high degree, thus making it difficult to select the best choice(s). We thus propose using the Lempel-Ziv complexity to identify partitions from this set of candidates that are, in a specific sense, {"}minimal,{"} i.e., those with contiguous cells, fewer cell boundaries, and a smaller number of cells compared to their rivals. We also show how our methods can be used to indicate the appropriate number of symbols needed to approximate a generating partition.",
author = "Patil, {Navendu S.} and Cusumano, {Joseph Paul}",
year = "2018",
month = "9",
day = "17",
doi = "10.1103/PhysRevE.98.032211",
language = "English (US)",
volume = "98",
journal = "Physical Review E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "3",

}

Empirical generating partitions of driven oscillators using optimized symbolic shadowing. / Patil, Navendu S.; Cusumano, Joseph Paul.

In: Physical Review E, Vol. 98, No. 3, 032211, 17.09.2018.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Empirical generating partitions of driven oscillators using optimized symbolic shadowing

AU - Patil, Navendu S.

AU - Cusumano, Joseph Paul

PY - 2018/9/17

Y1 - 2018/9/17

N2 - We present an optimized version of the symbolic shadowing algorithm for coarse graining a continuous state dynamical system, originally due to Hirata and co-workers [Phys. Rev. E 70, 016215 (2004)PLEEE81539-375510.1103/PhysRevE.70.016215]. We validate our algorithm by finding generating partitions presented previously in the literature. We show that, unlike the original, the optimized algorithm can approximate generating partitions for periodically driven continuous-time nonlinear oscillators. We recover known generating partitions for the driven Duffing oscillator and compute generating partitions for the driven van der Pol oscillator. We also examine the problem of how algorithms such as ours can be applied "objectively," that is, by starting from arbitrary initial partition guesses. By applying our algorithm to large ensembles of initial random partitions, we show that symbolic shadowing leads to a multiplicity of candidate generating partitions that localize points in phase space to a high degree, thus making it difficult to select the best choice(s). We thus propose using the Lempel-Ziv complexity to identify partitions from this set of candidates that are, in a specific sense, "minimal," i.e., those with contiguous cells, fewer cell boundaries, and a smaller number of cells compared to their rivals. We also show how our methods can be used to indicate the appropriate number of symbols needed to approximate a generating partition.

AB - We present an optimized version of the symbolic shadowing algorithm for coarse graining a continuous state dynamical system, originally due to Hirata and co-workers [Phys. Rev. E 70, 016215 (2004)PLEEE81539-375510.1103/PhysRevE.70.016215]. We validate our algorithm by finding generating partitions presented previously in the literature. We show that, unlike the original, the optimized algorithm can approximate generating partitions for periodically driven continuous-time nonlinear oscillators. We recover known generating partitions for the driven Duffing oscillator and compute generating partitions for the driven van der Pol oscillator. We also examine the problem of how algorithms such as ours can be applied "objectively," that is, by starting from arbitrary initial partition guesses. By applying our algorithm to large ensembles of initial random partitions, we show that symbolic shadowing leads to a multiplicity of candidate generating partitions that localize points in phase space to a high degree, thus making it difficult to select the best choice(s). We thus propose using the Lempel-Ziv complexity to identify partitions from this set of candidates that are, in a specific sense, "minimal," i.e., those with contiguous cells, fewer cell boundaries, and a smaller number of cells compared to their rivals. We also show how our methods can be used to indicate the appropriate number of symbols needed to approximate a generating partition.

UR - http://www.scopus.com/inward/record.url?scp=85053817225&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053817225&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.98.032211

DO - 10.1103/PhysRevE.98.032211

M3 - Article

AN - SCOPUS:85053817225

VL - 98

JO - Physical Review E

JF - Physical Review E

SN - 2470-0045

IS - 3

M1 - 032211

ER -