Scalable parallel preconditioning with the sparse approximate inverse of triangular matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 4, 1999, Pages 987-1006

  Van Duin, Arno C N ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Iterative methods; Numerical linear algebra; Parallel computation; Preconditioning; Sparse matrices; Sparsity; Triangular matrices

Indexed keywords

EID: 0033242231     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897317788     Document Type: Article

References (28)

1. F. ALVARADO AND H. DAǦ, Sparsified and incomplete sparse factored inverse preconditioners, in Copper Mountain Conference on Iterative Methods, Preliminary Proceedings, Vol. I, April 9-14, 1992.
2. F. L. ALVARADO AND R. SCHREIBER, Optimal parallel solution of sparse triangular systems, SIAM J. Sci. Comput., 14 (1993), pp. 446-460.
3. 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.
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. R. H. BISSELING, Sparse matrix computations on bulk synchronous parallel computers, in Proceedings ICIAM'95, Issue 1. G. Alefeld, O. Mahrenholtz, and R. Mennicken, eds., Numerical Analysis, Scientific Computing, Computer Science, Akademie Verlag, Berlin, 1996, pp. 127-130.
6. E. CHOW AND Y. SAAD, Approximate inverse techniques for block-partitioned matrices, SIAM J. Sci. Comput., 18 (1997), pp. 1657-1675.
7. E. CHOW AND Y. SAAD, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
8. E. CUTHILL AND J. MCKEE, Reducing the bandwidth of sparse symmetric matrices, in Proceedings 24th National Conference, Association for Computing Machinery, Brandon Press, Princeton, NJ, 1969, pp. 157-172.
9. H. DAǦ, Iterative Methods and Parallel Computation for Power Systems, Ph.D. thesis, University of Wisconsin-Madison, December 1995.
10. E. F. D'AZEVEDO, P. A. FORSYTH, AND W. P. TANG, Towards a cost-effective ILU preconditioner with high level fill, BIT, 32 (1992), pp. 442-463.
11. I. S. DUFF, R. G. GRIMES, AND J. C. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
12. R. FREUND AND N. NACHTIGAL, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
13. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, London, 3rd edition, 1996.
14. M. J. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
15. M. T. HEATH, E. NG, AND B. W. PEYTON, Parallel algorithms for sparse linear systems, SIAM Rev., 33 (1991), pp. 420-460.
16. L. YU. KOLOTILINA AND A. YU. YEREMIN, Factorized sparse approximate inverse preconditionings I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
17. 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.
18. J. A. MEIJERINK AND H. A. VAN DER VORST, Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems, J. Comput. Phys., 44 (1981), pp. 134-155.
19. D. J. ROSE, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, London, 1972, pp. 183-217.
20. Y. SAAD, Krylov subspace methods on supercomputers, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 1200-1232.
21. Y. SAAD, SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations, Technical report TR-1029, CSRD, University of Illinois at Urbana-Champaign, Urbana, IL, 1990.
22. Y. SAAD, ILUT: A dual threshold incomplete LU-factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
23. Y. SAAD, Preconditioned Krylov subspace methods for CFD applications, in Solution Techniques for Large-Scale CFD Problems, W. G. Habashi, ed., Wiley, New York, 1995, pp. 139-158.
24. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
25. P. SONNEVELD, CGS, A fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 36-52.
26. R. SUDA, Large scale circuit analysis by preconditioned relaxation methods, in Proc. PCG'94, Keio University, 1994, pp. 189-205.
27. R. SUDA, New Iterative Solvers for Parallel Circuit Simulation, Ph.D. thesis, Department of Information Sciences, University of Tokyo, Tokyo, Japan, 1996.
28. H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.