ACM Home Page
Please provide us with feedback. Feedback
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
Full text PdfPdf (227 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2003 ACM/IEEE conference on Supercomputing table of contents
Page: 1  
Year of Publication: 2003
ISBN:1-58113-695-1
Authors
Kai Wang  University of Kentucky, Lexington
Jun Zhang  University of Kentucky, Lexington
Chi Shen  University of Kentucky, Lexington
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 44,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for solving difficult problems. Forward and backward preconditioning iteration and two Schur complement preconditioning strategies are proposed to improve the performance and to reduce the storage cost of the multilevel preconditioners. One version of the parallel multilevel SAI preconditioner based on the MSP strategy is implemented. Numerical experiments for solving a few sparse matrices on a distributed memory parallel computer are reported.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
[2] M. W. Benson and P. O. Frederickson. Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems. Utilitas Math., 22:127-140, 1982.
 
3
[3] M. W. Benson, J. Krettmann, and M. Wright. Parallel algorithms for the solution of certain large sparse linear systems. Int. J. Comput. Math., 16:245-260, 1984.
 
4
 
5
 
6
 
7
 
8
[8] G. Meurant. A multilevel AINV preconditioner. Numer. Alg., 29(1-3):107-129, 2002.
 
9
 
10
 
11
 
12
 
13
 
14
[14] Y. Saad and J. Zhang. Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems. Numer. Linear Algebra Appl., 6(4):257-280, 1999.
 
15
 
16
 
17
 
18
[18] J. Zhang. On preconditioning Schur complement and Schur complement preconditioning. Electron. Trans. Numer. Anal., 10:115-130, 2000.
 
19
[19] J. Zhang. Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications. Comput. Methods Appl. Mech. Engrg., 189(3):825-840, 2000.
 
20
 
21
[21] J. Zhang. A class of multilevel recursive incomplete LU preconditioning techniques. Korean J. Comput. Appl. Math., 8(2):213-234, 2001.