A comparison of parallel preconditioners for the sparse generalized eigenvalue problems by rayleigh-quotient minimization

Authors:
Sangback Ma;Ho-Jong Jang
Affiliations:
School of Electrical Engineering and Computer Science, Hanyang University, Ansan, Korea;Department of Mathematics, Hanyang University, Seoul, Korea
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 7
Cited 0

Accelerated simultaneous iterations for large finite element eigenproblems

Journal of Computational Physics
Krylov subspace methods on supercomputers

SIAM Journal on Scientific and Statistical Computing
Two-color fourier analysis of iterative algorithms for elliptic problems with red/black ordering

SIAM Journal on Scientific and Statistical Computing
An orthogonal accelerated deflation technique for large symmetric eigenproblems

Computer Methods in Applied Mechanics and Engineering
Nested iterations for symmetric eigenproblems

SIAM Journal on Scientific Computing
The symmetric eigenvalue problem

The symmetric eigenvalue problem
Iterative methods for large, sparse, nonsymmetric systems of linear equations

Iterative methods for large, sparse, nonsymmetric systems of linear equations

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address ourselves to the problem of finding efficient parallel preconditioner for the interior generalized eigenvalue problem Ax = λBx, where A and B are large sparse symmetric positive definite matrices. We consider incomplete LU(ILU)(0) in two variants, Multi-Color block successive over-relaxation(SOR), and Point-symmetric SOR(SSOR). Our results show that for small number of processors the Multi-Color ILU(0) gives the best performance, while for large number of processors the Multi-Color Block SOR does.