Integrating Multilevel Graph Partitioning with Hierarchical Set Oriented Methods for the Analysis of Dynamical Systems

@inproceedings{citeulike:665908, abstract = {Dynamical systems from real applications are usually very complex and difficult to handle. Re- cently, the combination of hierarchical set oriented methods and of multilevel graph partitioning methods has been used for the analysis of the almost invariant sets of the system which are a key characteristic of dynamical systems. Both approaches include their own multilevel mechanisms. In this paper we interlock these multilevel approaches by integrating graph partitioning techniques di- rectly in the hierarchical set oriented paradigm. Our experimental results show that this interlocked approach leads us to a robust and successful method for analyzing the almost invariant sets. It is important to mention that the work in this direction not only incorporates the handling of contin- uous and discrete structures but also requires the interlock between numerical, algebraic and graph theoretic concepts.}, author = {Padberg, Kathrin and Preis, Robert }, booktitle = {Second International Workshop on Combinatorial Scientific Computing (CSC05)}, citeulike-article-id = {665908}, comment = {Paper at http://www.cerfacs.fr/algor/CSC05/Abstracts/25\_Preis.pdf}, keywords = {graph, hierarchical, multilevel, partitioning}, month = {June}, posted-at = {2006-05-23 04:11:59}, priority = {0}, title = {Integrating Multilevel Graph Partitioning with Hierarchical Set Oriented Methods for the Analysis of Dynamical Systems}, year = {2005} }

TY - CONF ID - citeulike:665908 L3 - citeulike-article-id:665908 TI - Integrating Multilevel Graph Partitioning with Hierarchical Set Oriented Methods for the Analysis of Dynamical Systems T2 - Second International Workshop on Combinatorial Scientific Computing (CSC05) N2 - Dynamical systems from real applications are usually very complex and difficult to handle. Re- cently, the combination of hierarchical set oriented methods and of multilevel graph partitioning methods has been used for the analysis of the almost invariant sets of the system which are a key characteristic of dynamical systems. Both approaches include their own multilevel mechanisms. In this paper we interlock these multilevel approaches by integrating graph partitioning techniques di- rectly in the hierarchical set oriented paradigm. Our experimental results show that this interlocked approach leads us to a robust and successful method for analyzing the almost invariant sets. It is important to mention that the work in this direction not only incorporates the handling of contin- uous and discrete structures but also requires the interlock between numerical, algebraic and graph theoretic concepts. KW - graph KW - hierarchical KW - multilevel KW - partitioning N1 - Paper at http://www.cerfacs.fr/algor/CSC05/Abstracts/25_Preis.pdf AU - Padberg, Kathrin AU - Preis, Robert PY - 2005/06// ER -