2012
DOI: 10.1063/1.4767672
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial-topological framework for the analysis of global dynamics

Abstract: We discuss an algorithmic framework based on efficient graph algorithms and algebraic-topological computational tools. The framework is aimed at automatic computation of a database of global dynamics of a given m-parameter semidynamical system with discrete time on a bounded subset of the n-dimensional phase space. We introduce the mathematical background, which is based upon Conley's topological approach to dynamics, describe the algorithms for the analysis of the dynamics using rectangular grids both in phas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
55
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3
1

Relationship

4
5

Authors

Journals

citations
Cited by 52 publications
(56 citation statements)
references
References 24 publications
1
55
0
Order By: Relevance
“…Finally, these maps are robust with respect to either numerical or experimental perturbation. This strongly suggests that this approach provides a framework in which to develop a new computational theory of nonlinear dynamics, and the first steps in this direction have been taken [2,5,4,12]. For any given dynamical system ϕ, Att(ϕ) has at most countable elements while ANbhd(ϕ) typically contains uncountably many elements.…”
Section: Throughout This Paper We Make the Following Assumptionmentioning
confidence: 99%
“…Finally, these maps are robust with respect to either numerical or experimental perturbation. This strongly suggests that this approach provides a framework in which to develop a new computational theory of nonlinear dynamics, and the first steps in this direction have been taken [2,5,4,12]. For any given dynamical system ϕ, Att(ϕ) has at most countable elements while ANbhd(ϕ) typically contains uncountably many elements.…”
Section: Throughout This Paper We Make the Following Assumptionmentioning
confidence: 99%
“…Thus it allows us to vary the methods used to obtain an outer approximation. In particular we are no longer bound to use interval vectors [2]. We also began to study the feasibility of constructing outer approximations based on time series data and obtained probabilistic results concerning the ability to reconstruct the homotopy of a map from random data points [3].…”
Section: Approximation Of Mapsmentioning
confidence: 99%
“…To do this we developed and implemented clutching records which gives information about how the dynamics changes between the regions [2]. More explicitly, for each region of parameter space a Morse Graph is computed.…”
Section: Approximation Of Mapsmentioning
confidence: 99%
“…[37]), and also in an automatized method for the computation of the Conley index from index pairs constructed as cubical sets in R n [41,48], used e.g. in a method for editing vector fields and extraction of periodic orbits [8], and also very helpful in an automatic method for classification of dynamics in multi-parameter systems [4,7], which found applications e.g. in population biology [38] and in physics of plasmas [49].…”
Section: Introductionmentioning
confidence: 99%