Ordering, anisotropy, and factored sparse approximate inverses

SIAM Journal of Scientific Computing

Volumn 21, Issue 3, 1999, Pages 867-882

  Bridson, Robert ^a   Tang, Wei Pai ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANISOTROPY; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR EQUATIONS; MATRIX ALGEBRA;

APPROXIMATE INVERSE; CONJUGATE GRADIENT METHODS; ORDERING METHODS; PRECONDITIONERS;

INVERSE PROBLEMS;

EID: 0033295138     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827598335842     Document Type: Article

References (24)

1. P. AMESTOY, T. DAVIS, AND I. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. M. BENZI, C. MEYER, AND M. TŮMA, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17 (1996) pp. 1135-1149.
3. M. BENZI AND M. TŮMA, A sparse approximate inverse preconditioner for nonsymmetric linear systems, SIAM J. Sci. Comput., 19 (1998), pp. 968-994.
4. M. BENZI AND M. TŮMA, Numerical experiments with two approximate inverse preconditioners, BIT, 38 (1998), pp. 234-241.
5. M. BENZI AND M. TŮMA, Orderings for factorized sparse approximate inverse preconditioners, revised version of Los Alamos National Laboratory Technical Report LA-UR-98-2175, 1998; SIAM J. Sci. Comput., to appear.
6. M. BENZI, J. MARIN, AND M. TŮMA, A two-level parallel preconditioner based on sparse approximate inverses, in Iterative Methods in Scientific Computation II, D. Kincaid et. al., eds., IMACS Series in Computational and Applied Mathematics, IMACS, New Brunswick, NJ, 1999, in press.
7. R. BRIDSON AND W.-P. TANG; Refined algorithms for a factored approximate inverse. Numerical analysis in the 20th century, J. Comput. Appl. Math, to appear.
8. E. CHOW AND Y. SAAD, Approximate inverse techniques for general sparse matrices, in Colorado Conference on Iterative Methods, 1994.
9. E. CHOW AND Y. SAAD, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
10. S. CLIFT, H. SIMON, AND W.-P. TANG, Spectral ordering techniques for incomplete LU preconditioners for CG methods, manuscript, 1995.
11. S. CLIFT AND W.-P. TANG, Weighted graph based ordering techniques for preconditioned conjugate gradient methods, BIT, 35 (1995), pp. 30-47.
12. E. D'AZEVEDO, P. FORSYTH, AND W.-P. TANG, Towards a cost-effective ILU preconditioner with high level fill, BIT, 32 (1992), pp. 442-463.
13. S. DEMKO, W. MOSS, AND P. SMITH, Decay rates for inverses of band matrices, Math. Comp., 43 (1984), pp. 491-499.
14. I. DUFF AND G. MEURANT, The effect of ordering on preconditioned conjugate gradients, BIT, 29 (1989), pp. 635-637.
15. M. FIEDLER, An algebraic approach to connectivity of graphs, in Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Academia, Prague, 1975. pp. 193-196.
16. M. FIELD, Improving the performance of parallel factorized sparse approximate inverse preconditioners, talk presented at the Copper Mountain Conference on Iterative Methods, CO, 1998.
17. A. GEORGE AND J. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
18. A. GEORGE AND J. LIU, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
19. J. GILBERT, Predicting structure in sparse matrix computations, SIAM J. Matrix. Anal. Appl., 15 (1994), pp. 62-79.
20. M. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
21. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1999), pp. 359-392.
22. L. KOLOTILINA AND A. YEREMIN, Factorized sparse approximate inverse preconditionings I. theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
23. J. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix. Anal. Appl., 11 (1990), pp. 134-172.
24. W.-P. TANG, Toward an effective sparse approximate inverse preconditioner, SIAM J. Matrix. Anal. Appl., 20 (1999), pp. 970-986.