Multigrid equation solvers for large-scale nonlinear finite element simulations

Abstract : The finite element method has grown, in the past 40 years, to be a popular method for the simulation of physical systems in science and engineering. The finite element method is used in a wide array of industries. In fact just about any enterprise that makes a physical product can, and probably does, use finite element technology. The success of the finite element method is due in large part to its ability to allow the use of accurate formulation of partial differential equations (PDEs), on arbitrarily general physical domains with complex boundary conditions. Additionally, the rapid growth in the computational power available in today's computers -- for an ever more affordable price -- has made finite element technology more accessible to a wider variety of industries and academic disciplines. As computational resources allow people to produce ever more accurate simulation of their systems -- allowing for the more efficient design and safety testing of everything from automobiles to nuclear weapons to artificial knee joints -- all aspects of the finite element simulation process are stressed. The largest bottleneck in the growth in the scale of finite element applications is the linear equation solver used in implicit time integration schemes. This is due to the fact that the direct solution methods -- popular in the finite element community as they are efficient, easy to use, and relatively unaffected by the underlying PDE and discretization -- do not scale well with increasing problem size. The scale of problems that are now becoming feasible demand that iterative methods be used. The performance issues of iterative methods is very different from those of direct methods, as their performance is highly sensitive to the underlying PDE and discretization; the construction of robust iterative methods for finite element matrices is a hard problem which is currently a very active area of research.

[1]  Philippe G. Ciarlet,et al.  The Finite Element Method for Elliptic Problems. , 1981 .

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

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

[4]  Rainald Löhner,et al.  Parallel unstructured grid generation , 1991 .

[5]  J. S. Przemieniecki Matrix Structural Analysis of Substructures , 1963 .

[6]  K. Stanley,et al.  Execution time of symmetric eigensolvers , 1997 .

[7]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[8]  M. P. Ida,et al.  A Semicoarsening Multigrid Algorithm for SIMD Machines , 1992, SIAM J. Sci. Comput..

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

[10]  James Demmel,et al.  An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination , 1997, SIAM J. Matrix Anal. Appl..

[11]  David E. Culler,et al.  Multi Protocol Active Messages on a Cluster of SMP , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[12]  F. Brezzi,et al.  A discourse on the stability conditions for mixed finite element formulations , 1990 .

[13]  G. Golub,et al.  Inexact and preconditioned Uzawa algorithms for saddle point problems , 1994 .

[14]  J. Oden,et al.  Contact problems in elasticity , 1988 .

[15]  Barry F. Smith,et al.  Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions , 1994 .

[16]  J. Dongarra Performance of various computers using standard linear equations software , 1990, CARN.

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

[18]  Kincho H. Law,et al.  A robust incomplete factorization based on value and space constraints , 1995 .

[19]  Eric A. Brewer,et al.  High-level optimization via automated statistical modeling , 1995, PPOPP '95.

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

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

[22]  Michel Fortin,et al.  Mixed and Hybrid Finite Element Methods , 2011, Springer Series in Computational Mathematics.

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

[24]  Gary L. Miller,et al.  Geometric mesh partitioning: implementation and experiments , 1995, Proceedings of 9th International Parallel Processing Symposium.

[25]  D. Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

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

[27]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[28]  J. Peraire,et al.  UNSTRUCTURED TETRAHEDRAL MESH GENERATION FOR THREE-DIMENSIONAL VISCOUS FLOWS , 1996 .

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

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

[31]  C. Farhat,et al.  Optimal convergence properties of the FETI domain decomposition method , 1994 .

[32]  Timothy J. Baker Mesh generation for the computation of flowfields over complex aerodynamic shapes , 1992 .

[33]  J. Mandel Balancing domain decomposition , 1993 .

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

[35]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[36]  J. Cavendish Automatic triangulation of arbitrary planar domains for the finite element method , 1974 .

[37]  Dimitri J. Mavriplis,et al.  Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes , 1997 .

[38]  D. Brandt,et al.  Multi-level adaptive solutions to boundary-value problems math comptr , 1977 .

[39]  Dimitri J. Mavriplis,et al.  Directional Agglomeration Multigrid Techniques for High-Reynolds Number Viscous Flows , 1998 .

[40]  Yousef Saad,et al.  Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.

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

[42]  William Gropp,et al.  PETSc 2.0 users manual , 2000 .

[43]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

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

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

[46]  E. Polak Introduction to linear and nonlinear programming , 1973 .

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

[48]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[49]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

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

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

[52]  J. H. Argyris,et al.  Energy theorems and structural analysis , 1960 .

[53]  David E. Womble,et al.  A Model and Implementation of Multigrid for Massively Parallel Computers , 1990, Int. J. High Speed Comput..

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

[55]  J. C. Simo,et al.  Variational and projection methods for the volume constraint in finite deformation elasto-plasticity , 1985 .

[56]  R. Courant Variational methods for the solution of problems of equilibrium and vibrations , 1943 .

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

[58]  David E. Keyes,et al.  Aerodynamic applications of Newton- Krylov-Schwarz solvers , 1995 .

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

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

[61]  E. K. Buratynski A fully automatic three-dimensional mesh generator for complex geometries , 1990 .

[62]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[63]  Michel Fortin,et al.  An algebraic multilevel parallelizable preconditioner for large-scale CFD problems , 1997 .

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

[65]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .