On vectorizing incomplete factorization and SSOR preconditioners
SIAM Journal on Scientific and Statistical Computing - Telecommunication Programs at U.S. Universities
Orderings for Parallel Conjugate Gradient Preconditioners
SIAM Journal on Scientific Computing
Multicoloring with lots of colors
ICS '89 Proceedings of the 3rd international conference on Supercomputing
New Parallel SOR Method by Domain Partitioning
SIAM Journal on Scientific Computing
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Parallel SSOR preconditioning for lattice QCD
Parallel Computing - Special issue on high performance computing in lattice QCD
A New Block Parallel SOR Method and Its Analysis
SIAM Journal on Scientific Computing
| Hi-index | 0.00 |
A new parallel symmetric successive over-relaxation (PSSOR) preconditioner is proposed in this paper by the multi-type partition techniques introduced in SIAM J. Scientific Computing 20, 2006, pp. 1513-1533. In a general matrix expression, it is proved to be symmetric and positive-definite (SPD) if the coefficient matrix of a linear system is SPD. It is also proved to be equivalent to the SSOR preconditioner using the multi-type ordering. Thus, it works for the preconditioned conjugate gradient method (PCG) and can be analysed by the classic SOR theory. Numerical tests on an anisotropic model problem show that the PSSOR preconditioner can make the PCG have a faster rate of convergence and better parallel performance than the red-black SSOR preconditioner. They also confirm that the PSSOR preconditioner can have a rate of convergence that is nearly the same as the classic sequential SSOR preconditioner when the problem has large anisotropy.