A sparse approximate inverse preconditioner for the conjugate gradient method

SIAM Journal on Scientific Computing

Volumn 17, Issue 5, 1996, Pages 1135-1149

  Benzi, Michele ^a,b   Meyer, Carl D ^c   Tůma, Miroslav ^d  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b CERFACS   (France)

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

^d INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

H matrices; Incomplete factorizations; Preconditioned conjugate gradient method; Sparse approximate inverses

Indexed keywords

EID: 0004675411     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594271421     Document Type: Article

References (29)

1. F. L. ALVARADO, A. POTHEN, AND R. SCHREIBER, Highly parallel sparse triangular solution, in Graph Theory and Sparse Matrix Computations, IMA Vol. 56, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer, New York, 1994, pp. 141-157.
2. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.
3. M. BENZI, A Direct Row-Projection Method For Sparse Linear Systems, Ph.D. thesis, Department of Mathematics, North Carolina State University, Raleigh, NC, 1993.
4. M. BENZI AND C. D. MEYER, A direct projection method for sparse linear systems, SIAM J. Sci. Comput., 16 (1995), pp. 1159-1176.
5. _ An explicit preconditioner for the conjugate gradient method, Proceedings of the Cornelius Lanczos International Centenary Conference, J. D. Brown et al., eds., Society of Industrial and Applied Mathematics, Philadelphia, 1994, pp. 294-296.
6. M. BENZI AND M. TŮMA, A comparison of some preconditioning techniques for general sparse matrices, in Proc. of the Second IMACS International Symposium on Iterative Methods in Linear Algebra, S. Margenov and P. Vassilevski, eds., 1995, to appear.
7. E. CHOW AND Y. SAAD, Approximate inverse preconditioned for general sparse matrices, in Proc. of the Colorado Conference on Iterative Methods, April 5-9, 1994.
8. P. CONCUS, G. H. GOLUB, AND G. MEURANT, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statis. Comput., 6 (1985), pp. 220-252.
9. J. D. F. COSGROVE, J. C. DIAZ, AND A. GRIEWANK, Approximate inverse preconditioning for sparse linear systems, Internat. J. Computer Math., 44 (1992), pp. 91-110.
10. S. DEMKO, W. F. MOSS, AND P. W. SMITH, Decay rates for inverses of band matrices, Math. Comp., 43 (1984), pp. 491-499.
11. I. S. DUFF, MA28 - A Set of Fortran Subroutines for Sparse Unsymmetric Linear Equations, Harwell Report AERE - R.8730, Harwell Labortories, 1980.
12. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
13. D. K. FADDEEV AND V. N. FADDEEVA, Computational Methods of Linear Algebra, W. H. Freeman and Co., San Francisco, London, 1963.
14. L. FOX, H. D. HUSKEY, AND J. H. WILKINSON, Notes on the solution of algebraic linear simultaneous equations, Quart. J. Mech. Appl. Math., 1 (1948), pp. 149-173.
15. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
16. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, London, 1981.
17. M. GROTE AND H. SIMON, Parallel preconditioning and approximate inverses on the Connection Machine, in Proc. of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, R. Sincovec et al., eds., Society of Industrial and Applied Mathematics, Philadelphia, 1993, pp. 519-523.
18. A. S. HOUSEHOLDER, The Theory of Matrices in Numerical Analysis, Blaisdell Publishing Co., New York, 1964.
19. T. HUCKLE AND M. GROTE, A new approach to parallel preconditioning with sparse approximate inverses, Manuscript SCCM-94-03, Scientific Computing and Computational Mathematics Program, Stanford University, Stanford, CA, May 1994.
20. L. YU. KOLOTILINA AND A. YU. YEREMIN, Factorized sparse approximate inverse preconditioning I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
21. E. A. LIPITAKIS AND D. J. EVANS, Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors, Math. Comput. Simulation, 29 (1987), pp. 1-17.
22. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
23. T. A. MANTEUFFEL, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 473-497.
24. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
25. G. MEURANT, A review of the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 707-728.
26. Y. SAAD, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math., 24 (1988), pp. 89-105.
27. R. B. SCHNABEL AND E. ESKOW, A new modified Cholesky factorization, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 1136-1158.
28. M. TŮMA, Solving Sparse Unsymmetric Sets of Linear Equations Based on Implicit Gauss Projection, Technical rep. 556, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, April 1993.
29. Z. ZLATEV, Computational Methods for General Sparse Matrices, Kluwer Academic Publishers, Dordrecht, 1991.