Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Iteration number for the conjugate gradient method
Mathematics and Computers in Simulation - MODELLING 2001 - Second IMACS conference on mathematical modelling and computational methods in mechanics, physics, biomechanics and geodynamics
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Global convergence of a two-parameter family of conjugate gradient methods without line search
Journal of Computational and Applied Mathematics - Special issue: Papers presented at the 1st Sino--Japan optimization meeting, 26-28 October 2000, Hong Kong, China
| Hi-index | 0.00 |
We propose a new parallel domain decomposition algorithm to solve symmetric linear systems of equations derived from the discretization of PDEs on general unstructured grids of triangles or tetrahedra. The algorithm is based on a single-level Schwarz alternating procedure and a modified conjugate gradient solver. A single layer of overlap has been adopted in order to simplify the data-structure and minimize the overhead. This approach makes the global convergence rate to vary slightly with the number of domains and the algorithm becomes highly scalable. The algorithm has been implemented in Fortran 90 using MPI and hence portable to different architectures. Numerical experiments have been carried out on a SunFire 15K parallel computer and there have been shown superlinear performance in some cases.