Decomposition and Clustering for the Visualization of Dynamical Systems

Part of the Mathematics for Industry book series (MFI, volume 4)


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.


Dynamical systems Strongly connected components Conley-Morse decomposition Graph clustering Peer pressure clustering 


  1. 1.
    Arai Z, Kalies W, Kokubu H, Mischaikow K, Oka H, Pilarczyk P (2009) A database schema for the analysis of global dynamics of multiparameter systems. SIAM J Appl Dyn Syst 8(3):757–789CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Arai Z, Kokubu H, Pilarczyk P (2009) Recent development in rigorous computational methods in dynamical systems. Japan J Ind Appl Math 26(2–3):393–417CrossRefMATHMathSciNetGoogle Scholar
  3. 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. 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. 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. 6.
    Mischaikow K, Mrozek M (2002) Conley index. Handbook of dynamical systems, vol 2. North-Holland, pp 393–460Google Scholar
  7. 7.
    Szymczak A, Zhang E (2012) Robust Morse decompositions of piecewise constant vector fields. IEEE Trans Vis Comput Graph 18(6):938–951CrossRefGoogle Scholar
  8. 8.
    Szymczak A (2013) Morse connection graphs for piecewise constant vector fields on surfaces. Comput Aided Geom Des 30(6):529–541CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    The CREST Project Toward a paradigm shift created by mathematics of vortex-boundary interactions (2014).

Copyright information

© Springer Japan 2014

Authors and Affiliations

  1. 1.Department of MathematicsHokkaido University/JST CRESTSapporoJapan

Personalised recommendations