Sparse approximate-inverse preconditioners using norm-minimization techniques

SIAM Journal on Scientific Computing

Volumn 19, Issue 2, 1998, Pages 605-625

  Gould, Nicholas I M ^a   Scott, Jennifer A ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Iterative methods; Preconditioners; Sparse approximate inverses; Unsymmetric systems

Indexed keywords

EID: 0000478318     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595288425     Document Type: Article

References (22)

1. R. BARRETT, M. BERRY, T. CHAN, J. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. VAN DER VORST, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, PA, 1994.
2. M. W. BENSON AND P. O. FREDERICKSON, Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems, Utilitas Math., 22 (1982), pp. 127-140.
3. M. BENZI AND M. TŮMA, A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems, Tech. report 653, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 1995.
4. A. BJÖRCK, Least squares methods, in Handbook of Numerical Analysis 1, P. G. Ciarlet and J. L. Lions, eds., Elsevier-North Holland, Amsterdam, 1989.
5. E. CHOW AND Y. SAAD, Approximate Inverse Preconditioned for General Sparse Matrices, Research report UMSI 94/101, University of Minnesota Supercomputer Institute, Minneapolis, MN, 1994.
6. J. D. F. COSGROVE, J. C. DIAZ, AND A. GRIEWANK, Approximate inverse preconditionings for sparse linear systems, Internat. J. Comput. Math., 44 (1992), pp. 91-110.
7. J. W. DANIEL, W. B. GRAGG, L. C. KAUFMAN, AND G. W. STEWART, Reorthogonalization, and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comput., 30 (1976), pp. 772-795.
8. T. DAVIS, Sparse matrix collection, NA Digest, Vol. 94, Issue 42, October 1994.
9. E. DE DONCKER AND A. K. GUPTA, Coarse grain preconditioned conjugate gradient solver for large sparse systems, in Proc. Seventh SIAM Conference on Parallel Processing for Scientific Computing, D. H. Bailey, ed., SIAM, Philadelphia, PA, 1995, pp. 472-477.
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. J. J. DONGARRA, I. S. DUFF, D. C. SORENSEN, AND H. A. VAN DER VORST, Solving Linear Systems on Vector and Shared Memory Computers, SIAM, Philadelphia, PA, 1991.
12. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, 1986.
13. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release 1), Tech. report RAL-92-086, Rutherford Appleton Laboratory, Chilton, UK, 1992.
14. I. S. DUFF AND J. K. REID, The design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations, ACM Trans. Math. Software, 22 (1996), pp. 187-226.
15. P. E. GILL, G. H. GOLUB, W. MURRAY, AND M. A. SAUNDERS, Methods for modifying matrix factorizations, Math. Comp., 28 (1974), pp. 505-535.
16. M. GROTE AND T. HUCKLE, Effective parallel preconditioning with sparse approximate inverses, in Proc. Seventh SIAM Conference on Parallel Processing for Scientific Computing, D. H. Bailey, ed., SIAM, Philadelphia, PA, 1995, pp. 466-471.
17. HARWELL SUBROUTINE LIBRARY, A Catalogue of Subroutines (Release 12), Advanced Computing Department, Harwell Laboratory, Harwell, UK, 1995.
18. T. HUCKLE AND M. GROTE, A New Approach to Parallel Preconditioning with Sparse Approximate Inverses, Tech. report SCCM-94-03, School of Engineering, Stanford University, Stanford, CA, 1994.
19. L. Y. KOLOTILINA AND A. Y. YEREMIN, Factorized sparse approximate inverse preconditionings I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
20. C. L. LAWSON AND R. J. HANSON, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
21. Y. SAAD, ILUT: A dual threshold incomplete LU factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
22. R. E. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.