Refining an approximate inverse

Journal of Computational and Applied Mathematics

Volumn 123, Issue 1-2, 2000, Pages 293-306

  Bridson, Robert ^a   Tang, Wei Pai ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximate inverse; Cache; Ordering; Performance; Preconditioner; Symbolic factorization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CACHE MEMORY; COMPUTER WORKSTATIONS; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; POLES AND ZEROS; VECTORS;

APPROXIMATE INVERSE; BLOCK METHODS; CACHE ORDERING; PRECONDITIONERS; SYMBOLIC FACTORIZATION;

INVERSE PROBLEMS;

EID: 0034319945     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00399-X     Document Type: Article

References (17)

1. M. Benzi, J. Cullum, M. Tůma, Robust approximate inverse preconditioning for the conjugate gradient method, SIAM J. Sci. Comput., to appear.
2. Benzi M., Meyer C., Tůma M. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17(5):1996;1135-1149.
3. Benzi M., Tůma M. A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J. Sci. Comput. 19(3):1998;968-994.
4. Benzi M., Tůma M. Orderings for factorized sparse approximate inverse preconditioners. SIAM J. Sci. Comput. 21:2000;1851-1868.
5. Brezina M., Mandel J., Vaněk P. Algebraic multigrid by smoothed aggregation for second and fourth-order elliptic problems. Computing. 56:1996;179-196.
6. R. Bridson, Multi-resolution approximate inverses, Masters Thesis, Department of Computer Science, University of Waterloo, 1999.
7. Bridson R., Tang W.-P. Ordering, anisotropy and factored sparse approximate inverses. SIAM J. Sci. Comput. 21:1999;867-882.
8. J. Dongarra, R. Whaley, Automatically Tuned Linear Algebra Software (ATLAS), SC98: High-Performance Networking and Computing Conference, Electronic Proceedings.
9. Eisenstat S., Liu J. Exploiting structural symmetry in unsymmetric sparse symbolic factorization. SIAM J. Matrix Anal. Appl. 13(1):1992;202-211.
10. George A., Liu J. Computer Solution of Large Sparse Positive Definite Systems. 1981. Prentice-Hall, Englewood Cliffs, NJ.
11. Gilbert J., Liu J. Elimination structures for unsymmetric sparse LU factors. SIAM J. Matrix Anal. Appl. 14(2):1993;334-352.
12. Gilbert J. Predicting structure in sparse matrix computations. SIAM J. Matrix Anal. Appl. 15:1994;62-79.
13. Karypis G., Kumar V. A fast and high-quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. (electronic). 20(1):1999;359-392.
14. Lipton R., Rose D., Tarjan R. Generalized nested dissection. SIAM J. Numer. Anal. 16:1979;346-358.
15. Liu J. A compact row storage scheme for Cholesky factors. ACM Trans. Math. Software. 12(2):1986;127-148.
16. Liu J. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11:1990;134-172.
17. Liu J., Ng E., Peyton B. On finding supernodes for sparse matrix computations. SIAM J. Matrix Anal. Appl. 14:1993;242-252.