2009
DOI: 10.1137/080734935
|View full text |Cite
|
Sign up to set email alerts
|

A Database Schema for the Analysis of Global Dynamics of Multiparameter Systems

Abstract: Abstract. A generally applicable, automatic method for the efficient computation of a database of global dynamics of a multiparameter dynamical system is introduced. An outer approximation of the dynamics for each subset of the parameter range is computed using rigorous numerical methods and is represented by means of a directed graph. The dynamics is then decomposed into the recurrent and gradient-like parts by fast combinatorial algorithms and is classified via Morse decompositions. These Morse decomposition… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
149
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 93 publications
(153 citation statements)
references
References 22 publications
1
149
0
Order By: Relevance
“…A partial order ≺ between the computed combinatorial Morse sets can be determined by the analysis of paths in G connecting those sets: i ≺ j if i = j and there exists a path in G from any vertex in M j to any vertex in M i . With the use of the graph G, a combinatorial Morse decomposition can be computed by algorithms introduced in [3,5] based on the standard DFS ("Depth-First Search") strategy. The complexity of these algorithms is linear (i.e., they are very fast).…”
Section: Combinatorial Morse Decompositionsmentioning
confidence: 99%
See 3 more Smart Citations
“…A partial order ≺ between the computed combinatorial Morse sets can be determined by the analysis of paths in G connecting those sets: i ≺ j if i = j and there exists a path in G from any vertex in M j to any vertex in M i . With the use of the graph G, a combinatorial Morse decomposition can be computed by algorithms introduced in [3,5] based on the standard DFS ("Depth-First Search") strategy. The complexity of these algorithms is linear (i.e., they are very fast).…”
Section: Combinatorial Morse Decompositionsmentioning
confidence: 99%
“…The practicality of the approach based on the analysis of combinatorial Morse decompositions is illustrated in [3] with the application of this method to the 2-dimensional overcompensatory Leslie population model and f : R 2 × R 4 → R 2 in (6) given by (7) f (x 1 , x 2 ; θ 1 , θ 2 , κ, p) = θ 1 x 1 + θ 2 x 2 e −κ(x1+x2) , px 1…”
Section: 7mentioning
confidence: 99%
See 2 more Smart Citations
“…[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%