A performance comparison of the parallel preconditioners for iterative methods for large sparse linear systems arising from Partial Differential Equations on structured grids
- Authors
- Ma, Sangback
- Issue Date
- Sep-2008
- Publisher
- Oxford University Press
- Keywords
- partial differential equations; sparse linear systems; iterative methods; parallel preconditioners; distributed memory; MPI (message passing interface)
- Citation
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E91A, no.9, pp 2578 - 2587
- Pages
- 10
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Volume
- E91A
- Number
- 9
- Start Page
- 2578
- End Page
- 2587
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/42226
- DOI
- 10.1093/ietfec/e91-a.9.2578
- ISSN
- 0916-8508
- Abstract
- In this paper we compare various parallel preconditioners such as Point-SSOR (Symmetric Successive OverRelaxation), ILU(0) (Incomplete LU) in the Wavefront ordering, ILU(0) in the Multi-color ordering, Multi-Color Block SOR (Successive OverRelaxation), SPAI (Sparse Approximate Inverse) and pARMS (Parallel Algebraic Recursive Multilevel Solver) for solving large sparse linear systems arising from two-dimensional PDE (Partial Differential Equation)s on structured grids. Point-SSOR is well-known, and ILU(0) is one of the most popular preconditioner, but it is inherently serial. ILU(0) in the Wavefront ordering maximizes the parallelism in the natural order, but the lengths of the wavefronts are often nonuniform. ILU(0) in the Multi-color ordering is a simple way of achieving a parallelism of the order N, where N is the order of the matrix, but its convergence rate often deteriorates as compared to that of natural ordering. We have chosen the Multi-Color Block SOR preconditioner combined with direct sparse matrix solver, since for the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with the Multi-Color ordering. By using block version we expect to minimize the interprocessor communications. SPAI computes the sparse approximate inverse directly by least squares method. Finally, ARMS is a preconditioner recursively exploiting the concept of independent sets and pARMS is the parallel version of ARMS. Experiments were conducted for the Finite Difference and Finite Element discretizations of five two-dimensional PDEs with large meshsizes up to a million on an IBM p595 machine with distributed memory. Our matrices are real positive, i.e., their real parts of the eigenvalues are positive. We have used GMRES(m) as our outer iterative method, so that the convergence of GMRES(m) for our test matrices are mathematically guaranteed. Interprocessor communications were done using MPI (Message Passing Interface) primitives. The results show that in general ILU(0) in the Multi-Color ordering and ILU(0) in the Wavefront ordering outperform the other methods but for symmetric and nearly symmetric 5-point matrices Multi-Color Block SOR gives the best performance, except for a few cases with a small number of processors.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > SCHOOL OF COMPUTER SCIENCE > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/42226)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.