A performance comparison of the parallel preconditioners for iterative methods for large sparse linear systems arising from Partial Differential Equations on structured grids

被引:2
作者
Ma, Sangback [1 ]
机构
[1] Hanyang Univ, Dept Comp Engn, Ansan, Kyungki Do, South Korea
关键词
partial differential equations; sparse linear systems; iterative methods; parallel preconditioners; distributed memory; MPI (message passing interface);
D O I
10.1093/ietfec/e91-a.9.2578
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2578 / 2587
页数:10
相关论文
共 27 条
[1]  
BOLEY D, 1978, 1860 MRC U WISC
[2]  
DUFF IS, 1993, RAL93072
[3]  
ELMAN HC, 1982, THESIS YALE U
[4]   Parallel preconditioning with sparse approximate inverses [J].
Grote, MJ ;
Huckle, T .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1997, 18 (03) :838-853
[5]   2-COLOR FOURIER-ANALYSIS OF ITERATIVE ALGORITHMS FOR ELLIPTIC PROBLEMS WITH RED BLACK ORDERING [J].
KUO, CCJ ;
CHAN, TF .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (04) :767-793
[6]   INDEPENDENT SET ORDERINGS FOR PARALLEL MATRIX FACTORIZATION BY GAUSSIAN-ELIMINATION [J].
LEUZE, MR .
PARALLEL COMPUTING, 1989, 10 (02) :177-191
[7]  
LI Z, 2003, NUMERICAL LINEAR ALG, V10, P4585
[8]   pARMS: a parallel version of the algebraic recursive multilevel solver [J].
Li, ZZ ;
Saad, Y ;
Sosonkina, M .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2003, 10 (5-6) :485-509
[9]   Comparisons of the ILU(0), point-SSOR, and SPAI preconditioners on the CRAY-T3E for nonsymmetric sparse linear systems arising from PDES on structured grids [J].
Ma, S .
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2000, 14 (01) :39-48
[10]   ITERATIVE SOLUTION METHOD FOR LINEAR-SYSTEMS OF WHICH COEFFICIENT MATRIX IS A SYMMETRIC M-MATRIX [J].
MEIJERINK, JA ;
VANDERVORST, HA .
MATHEMATICS OF COMPUTATION, 1977, 31 (137) :148-162