A neural network graph partitioning procedure for grid-based domain decomposition

This paper describes a neural network graph partitioning algorithm which partitions unstructured finite element/volume meshes as a precursor to a parallel domain decomposition solution method. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialize an optimization of the graph partition problem. In practice, a hierarchy of (usually more than two) graphs are used to help obtain the final graph partition. A mean field theorem neural network is used to perform all partition optimization. The partitioning method is applied to graphs derived from unstructured finite element meshes and in this context it can be viewed as a multi-grid partitioning method. Copyright © 1999 John Wiley & Sons, Ltd.

[1]  David E. van den Bout,et al.  Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

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

[3]  Bruce Hendrickson,et al.  The Chaco user`s guide. Version 1.0 , 1993 .

[4]  Emile H. L. Aarts,et al.  Simulated annealing: A pedestrian review of the theory and some applications , 1987 .

[5]  Carsten Peterson,et al.  Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem , 1988, Complex Syst..

[6]  William Gropp,et al.  A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation , 1985, PP.

[7]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Simon Parsons,et al.  Soft computing: fuzzy logic, neural networks and distributed artificial intelligence by F. Aminzadeh and M. Jamshidi (Eds.), PTR Prentice Hall, Englewood Cliffs, NJ, pp 301, ISBN 0-13-146234-2 , 1996, Knowl. Eng. Rev..

[9]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[10]  Rf Fowler,et al.  Partitioning methods for unstructured finite element meshes , 1994 .

[11]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[12]  R. Webster.  An algebraic multigrid solver for Navier‐Stokes problems , 1994 .

[13]  L. Darrell Whitley,et al.  Genetic algorithms and neural networks: optimizing connections and connectivity , 1990, Parallel Comput..

[14]  B. Nour-Omid,et al.  Solving finite element equations on concurrent computers , 1987 .

[15]  Ardeshir Bahreininejad,et al.  Finite element mesh partitioning using neural networks , 1996 .

[16]  S. Arunkumar,et al.  A randomized heuristics for the mapping problem: The genetic approach , 1992, Parallel Comput..

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

[18]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[19]  Lie Wang,et al.  Towards a fast implementation of spectral nested dissection , 1992, Proceedings Supercomputing '92.

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

[21]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[22]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..