Mesh partitioning algorithms for the parallel solution of partial differential equations

Abstract Most of the recently proposed computational methods for solving partial differential equations on multiprocessor architectures stem from the “divide and conquer” paradigm and involve some form of domain decomposition. For those methods which also require grids of points or patches of elements, it is often necessary to explicitly partition the underlying mesh, especially when working with local memory parallel processors. In this paper, a family of cost-effective algorithms for the automatic partitioning of arbitrary two- and three-dimensional finite element and finite difference meshes are presented and discussed in view of a domain-decomposed solution procedure and parallel processing.

[1]  Charbel Farhat.  On the mapping of massively parallel processors onto finite element graphs , 1989 .

[2]  K. Park,et al.  Solving structural mechanics problems on the CalTech Hypercube machine , 1987 .

[3]  Shahid H. Bokhari,et al.  Complete exchange on the iPSC-860 , 1991 .

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

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

[6]  Alan George,et al.  A linear time implementation of the reverse Cuthill-McKee algorithm , 1980, BIT.

[7]  Charbel Farhat,et al.  Parallel/vector improvements of the frontal method , 1991 .

[8]  I. Fried.  Condition of finite element matrices generated from nonuniform meshes. , 1972 .

[9]  Steve W. Otto,et al.  Optimal mapping of irregular finite element domains to parallel processors , 1987 .

[10]  Dirk Roose,et al.  Benchmarking the iPSC/2 , 1988 .

[11]  J. G. Malone.  Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers , 1988 .

[12]  K. C. Park,et al.  Dynamic Finite Element Simulations on the Connection Machine , 1989, Int. J. High Speed Comput..

[13]  Charbel Farhat,et al.  Transient finite element computations on 65536 processors: The connection machine , 1990 .

[14]  Iain S. Duff,et al.  Concurrent Multifrontal Methods: Shared Memory, Cache, and Frontwidth Issues , 1987 .

[15]  Charbel Farhat,et al.  Solving Navier- Stokes Equations On a Massively Parallel Processor: Beyond the 1 Gflop Performance , 1990, Int. J. High Perform. Comput. Appl..

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

[17]  Charbel Farhat,et al.  A general approach to nonlinear FE computations on shared-memory multiprocessors , 1989 .

[18]  Stéphane Lanteri,et al.  Mixed finite volume/finite element massively parallel computations: Euler flows, unstructured grids, and upwind approximations , 1992 .

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Steve L. Karman,et al.  Benchmark calculations with an unstructured grid flow solver on a SIMD computer , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[21]  François-Xavier Roux,et al.  Acceleration of the outer conjugate gradient by reorthogonalization for a domain decomposition method for structural analysis problems , 1989, ICS '89.

[22]  C. Farhat,et al.  A method of finite element tearing and interconnecting and its parallel solution algorithm , 1991 .