Decomposition and Clustering for the Visualization of Dynamical Systems
We discuss recently developed methods for the visualization of dynamical systems which are based on the decomposition of the phase space of the system. The information of the system is represented by a directed graph and then the graph will be decomposed into smaller subsets which eventually defines a partition of the phase space. Depending on the purpose of visualization and the nature of the system, two different decompositions are introduced. The first decomposition algorithm is called Conley-Morse decomposition, which decompose the system according to the gradient-like structure of the system. On the other hand, the latter algorithm, an application of the peer pressure clustering algorithm for directed graphs, decompose each recurrent components of the system into further smaller non-invariant subsets according to the similarity of the dynamical behavior.
KeywordsDynamical systems Strongly connected components Conley-Morse decomposition Graph clustering Peer pressure clustering
- 3.Conley C (1978) Isolated invariant sets and the Morse index, CBMS Regional Conference Series in Mathematics, vol 38. American Mathematical Society, Providence, RIGoogle Scholar
- 4.Dellnitz M, Junge O (2002) Set oriented numerical methods for dynamical systems? Handbook of dynamical systems, vol 2. North-Holland, pp. 221–264Google Scholar
- 5.Kepner J, Gilbert J (eds) (2011) Graph algorithms in the language of linear algebra. Society for Industrial and Applied Mathematics, Philadelphia, PAGoogle Scholar
- 6.Mischaikow K, Mrozek M (2002) Conley index. Handbook of dynamical systems, vol 2. North-Holland, pp 393–460Google Scholar
- 9.The CREST Project Toward a paradigm shift created by mathematics of vortex-boundary interactions (2014). http://www.math.sci.hokudai.ac.jp/crest/