Parallel Multigrid Algorithms for Unstructured 3D Large Deformation Elasticity and Plasticity Finite Element Problems

Multigrid is a popular solution method for the set of linear algebraic equations that arise from PDEs discretized with the nite element method. The application of multigrid to unstructured grid problems, however, is not well developed. We discuss a method that uses many of the same techniques as the nite element method itself, to apply standard multigrid algorithms to unstructured nite element problems. We use maximal independent sets (MISs), like many \algebraic" multigrid methods, as a heuristic to automatically coarsen unstructured grids. The inherent exibility in the selection of an MIS allows for the use of heuristics to improve their e ectiveness for a multigrid solver. We present heuristics and algorithms to optimize the quality of MISs, and the meshes constructed from them, for use in multigrid solvers for unstructured problems in solid mechanics. We also discuss parallel issues of our algorithms, and multigrid solvers in general, and describe a parallel nite element architecture that we have developed to parallelize a state-of-the-art research nite element code in a natural way for the common computer architectures of today. We show that our solver, and parallel nite element architecture, does indeed scale well, with test problems in 3D large deformation elasticity and plasticity, with over 26 million degrees of freedom on a 640 processor Cray T3E (with 55% parallel e ciency), and on 84 IBM 4-way

[1]  Sivan Toledo,et al.  Improving the memory-system performance of sparse-matrix vector multiplication , 1997, IBM J. Res. Dev..

[2]  Jacob Fish,et al.  An efficient multilevel solution scheme for large scale non-linear systems , 1995 .

[3]  Mark T. Jones,et al.  A Parallel Graph Coloring Heuristic , 1993, SIAM J. Sci. Comput..

[4]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

[5]  J. Ruge,et al.  AMG for problems of elasticity , 1986 .

[6]  M. Adams,et al.  A Parallel Maximal Independent Set Algorithm , 1998 .

[7]  Node-Nested Multi-Grid With Delaunay Coarsening , 1993 .

[8]  William L. Briggs,et al.  A multigrid tutorial , 1987 .

[9]  Scott B. Baden,et al.  Software infrastructure for non-uniform scientific computations on parallel processors , 1996, SIAP.

[10]  David R. Owen,et al.  A MULTI-GRID ENHANCED GMRES ALGORITHM FOR ELASTO-PLASTIC PROBLEMS , 1998 .

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

[12]  Guy E. Blelloch,et al.  Design and Implementation of a Practical Parallel Delaunay Algorithm , 1999, Algorithmica.

[13]  D. A. Field,et al.  Implementing Watson's algorithm in three dimensions , 1986, SCG '86.

[14]  M. Adams Heuristics for the Automatic Construction of Coarse Grids in Multigrid Solvers for Finite Element Matrices , 1998 .

[15]  James Demmel,et al.  Multigrid equation solvers for large-scale nonlinear finite element simulations , 1999 .

[16]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[17]  I. D. Parsons,et al.  A parallel multigrid method for history-dependent elastoplasticity computations , 1993 .

[18]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[19]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[20]  Günther Kuhn,et al.  High‐performance multilevel iterative aggregation solver for large finite‐element structural analysis problems , 1995 .

[21]  Katherine A. Yelick,et al.  Titanium: A High-performance Java Dialect , 1998, Concurr. Pract. Exp..