A comparison of parallel preconditioners for the sparse generalized eigenvalue problems by Rayleigh-quotient minimization
- Authors
- Ma, Sangback; Jang, Ho-Jong
- Issue Date
- Jun-2006
- Publisher
- Springer Verlag
- Citation
- Applied Parallel Computing State of the Art in Scientific Computing, v.3732, pp 333 - 341
- Pages
- 9
- Indexed
- SCIE
SCOPUS
- Journal Title
- Applied Parallel Computing State of the Art in Scientific Computing
- Volume
- 3732
- Start Page
- 333
- End Page
- 341
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/45373
- DOI
- 10.1007/11558958_39
- Abstract
- In this paper we address Ourselves to the problem of finding efficient parallel preconditioner for the interior generalized eigenvalue problem Ax = lambda 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > SCHOOL OF COMPUTER SCIENCE > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.