A hybrid graph-genetic method for domain decomposition

A new method is developed for finite element (FE) domain decomposition. This method employs a hybrid graph-genetic algorithm for graph partitioning and correspondingly bisects finite element (FE) meshes.A weighted incidence graph is first constructed for the FE mesh, denoted by G0. A coarsening process is then performed using heavy-edge matching. A sequence of such operations is employed in "n" steps, which leads to the formation of Gn with a size suitable for genetic algorithm applications.Hereafter, Gn is bisected using conventional genetic algorithm. The shortest route tree algorithm is used for the formation of the initial population in genetic algorithm. Then an uncoarsening process is performed and the results are transferred to the graph Gn-1. The initial population for genetic algorithm on Gn-1 is constructed from the results of Gn. This process is repeated until G0 is obtained in the uncoarsening operation. Employing the properties of G1, the graph G0 is bisected by the genetic algorithm.

[1]  Charbel Farhat,et al.  A simple and efficient automatic fem domain decomposer , 1988 .

[2]  Laurence A. Wolsey,et al.  Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations , 1993, PPSC.

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[5]  Ali Kaveh,et al.  Spectral bisection of adaptive finite element meshes for parallel processing , 1999 .

[6]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[7]  Jaroslav Mackerle,et al.  Parallel finite element and boundary element analysis: theory and applications - a bibliography (1997-1999) , 2000 .

[8]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[9]  Barry Hilary Valentine Topping,et al.  Parallel adaptive mesh generation , 1991 .

[10]  Duc T. Nguyen,et al.  An algorithm for domain decomposition in finite element analysis , 1991 .

[11]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[12]  Ali Kaveh,et al.  Optimal Structural Analysis , 1997 .

[13]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[14]  Asad I. Khan,et al.  Parallel Finite Element Computations , 1999 .

[15]  Charbel Farhat,et al.  Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics , 1993 .

[16]  Denis Vanderstraeten,et al.  Optimized partitioning of unstructured finite element meshes , 1995 .

[17]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..