A distributed memory unstructured gauss-seidel algorithm for multigrid smoothers
- 10 November 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Gauss-Seidel is a popular multigrid smoother as it is provably optimal on structured grids and exhibits superior performance on unstructured grids. Gauss-Seidel is not used to our knowledge on distributed memory machines as it is not obvious how to parallelize it effectively. We, among others, have found that Krylov solvers preconditioned with Jacobi, block Jacobi or overlapped Schwarz are effective on unstructured problems. Gauss-Seidel does however have some attractive properties, namely: fast convergence, no global communication (ie, no dot products) and fewer flops per iteration as one can incorporate an initial guess naturally. This paper discusses an algorithm for parallelizing Gauss-Seidel for distributed memory computers for use as a multigrid smoother and compares its performance with preconditioned conjugate gradients on unstructured linear elasticity problems with up to 76 million degrees of freedom.Keywords
This publication has 6 references indexed in Scilit:
- Parallel multigrid solvers for 3D unstructured finite element problems in large deformation elasticity and plasticityInternational Journal for Numerical Methods in Engineering, 2000
- A non-nested Galerkin multi-grid method for solving linear and nonlinear solid mechanics problemsComputer Methods in Applied Mechanics and Engineering, 1997
- Parallel multilevel k-way partitioning scheme for irregular graphsPublished by Association for Computing Machinery (ACM) ,1996
- UNSTRUCTURED MULTIGRID METHOD FOR SHELLSInternational Journal for Numerical Methods in Engineering, 1996
- High‐performance multilevel iterative aggregation solver for large finite‐element structural analysis problemsInternational Journal for Numerical Methods in Engineering, 1995
- Is SOR Color-Blind?SIAM Journal on Scientific and Statistical Computing, 1986