Orderings for factorized sparse approximate inverse preconditioners

SIAM Journal of Scientific Computing

Volumn 21, Issue 5, 2000, Pages 1851-1868

  Benzi, Michele ^a   Tůma, Miroslav ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; HEURISTIC METHODS; INVERSE PROBLEMS; MATRIX ALGEBRA; VECTORS;

DECAY RATES; FACTORIZED SPARSE APPROXIMATE INVERSES; INCOMPLETE BICONJUGATION; ORDERINGS; PRECONDITIONED KRYLOV SUBSPACE METHODS; SPARSE LINEAR SYSTEMS; SPARSE MATRICES;

LINEAR SYSTEMS;

EID: 18844471650     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827598339372     Document Type: Article

References (38)

1. M. BENZI, J. MARÍN, AND M. TŮMA, Parallel preconditioning with factorized sparse approximate inverses, in Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, B. Hendrickson et al., eds., CD-ROM, SIAM, Philadelphia, PA, 1999.
2. M. BENZI, C. D. 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, D. B. SZYLD, AND A. VAN DUIN, Orderings for incomplete factorization preconditioning of nonsymmetric problems, SIAM J. Sci. Comput., 20 (1999), pp. 1652-1670.
4. M. BENZI AND M. TŮMA, A sparse approximate inverse preconditioner for nonsymmetric linear systems, SIAM J. Sci. Comput., 19 (1998), pp. 968-994.
5. M. BENZI AND M. TŮMA, Numerical experiments with two approximate inverse preconditioners, BIT, 38 (1998), pp. 234-241.
6. M. BENZI AND M. TŮMA, A comparative study of sparse approximate inverse preconditioners, Appl. Numer. Math., 30 (1999), pp. 305-340.
7. R. BRIDSON AND W.-P. TANG, Ordering, anisotropy and factored sparse approximate inverses, SIAM J. Sci. Comput., 21 (1999), pp. 867-882.
8. T. CHAN, W.-P. TANG, AND W. WAN, Wavelet sparse approximate inverse preconditioners, BIT, 37 (1997), pp. 644-660.
9. E. CHOW AND Y. SAAD, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
10. T. DAVIS, University of Florida Sparse Matrix Collection, NA Digest, vol. 94, issue 42, October 1994; also available online from http://www.cise.ufl.edu/∼davis/sparse/.
11. S. DEMKO, W. F. MOSS, AND P. W. SMITH, Decay rates for inverses of band matrices, Math. Comp., 43 (1984), pp. 491-499.
12. I. S. DUFF, A. M. ERISMAN, C. W. GEAR, AND J. K. REID, Sparsity structure and Gaussian elimination, SIGNUM Newsletter, 23 (1988), pp. 2-9.
13. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Clarendon Press, Oxford, UK, 1986.
14. I. S. DUFF AND G. A. MEURANT, The effect of ordering on preconditioned conjugate gradients, BIT, 29 (1989), pp. 635-657.
15. V. EIJKHOUT AND B. POLMAN, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices, Linear Algebra Appl., 109 (1988), pp. 247-277.
16. H. C. ELMAN, Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems, BIT, 29 (1989), pp. 890-915.
17. M. R. FIELD, Improving the Performance of Factorised Sparse Approximate Inverse Preconditioner, Hitachi Dublin Laboratory Technical Report HDL-TR-98-199, Dublin, Ireland, 1998.
18. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
19. J. R. GILBERT, Predicting structure in sparse matrix computations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 62-79.
20. J. R. GILBERT AND J. W. H. LIU, Elimination structures for unsymmetric sparse LU factors, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 334-352.
21. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore and London, 1996.
22. M. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
23. H. HAFSTEINSSON, Parallel Sparse Cholesky Factorization, Ph.D. Thesis, Department of Computer Science, Cornell University, 1988.
24. G. KARYPIS AND V. KUMAR, METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices (Version 3.0), University of Minnesota, Department of Computer Science and Army HPC Research Center, Minneapolis, MN, 1997.
25. L. YU. KOLOTILINA AND A. YU. YEREMIN, Factorized sparse approximate inverse preconditioning I: Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
26. J. G. LEWIS, B. W. PEYTON, AND A. POTHEN, A fast algorithm for reordering sparse matrices for parallel factorization, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 1156-1173.
27. R. J. LIPTON, D. J. ROSE, AND R. E. TARJAN, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
28. J. W. H. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
29. J. W. H. LIU, Equivalent sparse matrix reordering by elimination tree rotations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 424-444.
30. J. W. H. LIU, Reordering sparse matrices for parallel elimination, Parallel Comput., 11 (1989), pp. 73-91.
31. F. MANNE, Reducing the Height of an Elimination Tree through Local Reorderings, Technical Report CS-51-91, University of Bergen, Norway, 1991.
32. G. MEURANT, A review of the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 707-728.
33. G. MEURANT, private communication, December 1997.
34. R. NABBEN, Decay rates of the inverse of nonsymmetric tridiagonal and band matrices, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 820-837.
35. A. POTHEN, The Complexity of Optimal Elimination Trees, Technical Report CS-88-13, Pennsylvania State University, University Park, PA, 1988.
36. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Co., Boston, 1996.
37. G. S. SHIRALKAR, R. E. STEPHENSON, W. D. JOUBERT, AND B. VAN BLOEMEN-WAANDERS, FALCON: A production quality distributed memory reservoir simulator, SPE Paper 37975, presented at the SPE Reservoir Simulation Symposium, Dallas, Texas, 8-11 June 1997.
38. H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems, SIAM J. Sci. Statist. Comput., 12 (1992), pp. 631-644.