Premium
Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
Author(s) -
Basermann Achim
Publication year - 2000
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/1099-1506(200010/12)7:7/8<635::aid-nla216>3.0.co;2-b
Subject(s) - preconditioner , linear system , sparse matrix , block (permutation group theory) , parallel computing , matrix (chemical analysis) , sparse approximation , iterative method , mathematics , scheme (mathematics) , algorithm , computer science , combinatorics , mathematical analysis , physics , materials science , quantum mechanics , composite material , gaussian
In this paper, a combination of parallel computing techniques and incomplete block LU preconditioning methods with threshold (ILUT) are presented to reduce the execution times of iterative solvers for sparse eigenproblems as well as sparse linear systems. The symmetric variant of ILUT, an incomplete block LDL T preconditioner (ILDLT), is investigated in addition. The parallelization of the solvers is based on matrix and vector partitioning with a data distribution and a communication scheme exploiting the sparsity of the matrix. The efficiency of the parallel preconditioned eigenproblem and sparse linear system solvers is demonstrated on the parallel systems NEC Cenju‐4 as well as on a PC cluster. Copyright © 2000 John Wiley & Sons, Ltd.