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-reluxation(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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ma, S., & Jang, H. J. (2006). A comparison of parallel preconditioners for the sparse generalized eigenvalue problems by rayleigh-quotient minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 333–341). Springer Verlag. https://doi.org/10.1007/11558958_39
Mendeley helps you to discover research relevant for your work.