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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cho, Y., Yong, Y.K.: Amulti-mesh, preconditioned conjugate gradient solver for eigenvalue problems in finite element models. Computers and Structures 58, 575–583 (1996)
Elman, H.: Iterative methods for large, sparse, nonsymmetric systems of linear equations. Ph. D Thesis, Yale University (1982)
Gambolati, G., Pini, G., Putti, M.: Nested iterations for symmetric eigenproblems. SIAM Journal of Scientific Computing 16, 173–191 (1995)
Gambolati, G., Sartoretto, F., Florian, P.: An orthogonal accelerated deflation technique for large symmetric eigenproblems. Computer Methods in Applied Mechanical Engineering 94, 13–23 (1992)
Jay Kuo, C.-C., Chan, T.: Tow-color Fourier analysis of iterative algorithms for elliptic problems with red/black ordering. SIAM Journal of Scientific Computing 11, 767–793 (1990)
Ma, S.: Comparisons of the parallel preconditioners on the CRAY-T3E for large nonsymmetric linear systems. International Journal of High Speed Computing 10, 285–300 (1999)
Parlett, B.N.: The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs (1980)
Ruhe, A.: Computation of eigenvalues and eigenvectors. In: Baker, V.A. (ed.) Sparse Matrix Techniques, pp. 130–184. Springer, Berlin (1977)
Saad, Y.: Highly parallel preconditioner for general sparse matrices. In: Golub, G., Luskin, M., Greenbaum, A. (eds.) Recent Advances in Iterative Methods. IMA Volumes in Mathematics and its Applications, vol. 60, pp. 165–199. Springer, Berlin (1994)
Saad, Y.: Krylov subspace methods on supercomputers. SIAM Journal of Scientific Computing 10, 1200–1232 (1989)
Sartoretto, F., Pini, G., Gambolati, G.: Accelerated simultaneous iterations for large finite element eigenproblems. Journal of Computational Physics 81, 53–69 (1989)
Schwarz, H.R.: Eigenvalue problems and preconditioning. International Series of Numerical Mathematics 96, 191–208 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, S., Jang, HJ. (2006). A Comparison of Parallel Preconditioners for the Sparse Generalized Eigenvalue Problems by Rayleigh-Quotient Minimization. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_39
Download citation
DOI: https://doi.org/10.1007/11558958_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29067-4
Online ISBN: 978-3-540-33498-9
eBook Packages: Computer ScienceComputer Science (R0)