Overlapping domain decomposition algorithms for general sparse matrices

Numerical Linear Algebra with Applications

Volumn 3, Issue 3, 1996, Pages 221-237

  Cai, Xiao Chuan ^a   Saad, Yousef ^b  

^a UCB 450   (United States)

^b University of Minnesota   (United States)

Author keywords

Domain decomposition; Graph partitioning; Iterative methods; Preconditioning; Sparse matrix

Indexed keywords

EID: 21344470841     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199605/06)3:3<221::AID-NLA80>3.0.CO;2-7     Document Type: Article

References (17)

1. L. Adams and J. Ortega. A multi-color SOR method for parallel computers. In Proceedings of Int. Conf. Par. Proc., 1982. pp. 53-56.
2. X.- C. Cai, W. D. Gropp and D. E. Keyes. A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems. Numer. Lin. Alg. Applies., 1, 477-504, 1993.
3. X.-C. Cai and O. B. Widlund. Domain decomposition algorithms for indefinite elliptic problems. SIAM J. Sci. Stat. Comp., 13, 243-258, 1992.
4. X.-C. Cai and O. B. Widlund. Multiplicative Schwarz algorithms for nonsymmetric and indefinite elliptic problems. SIAM J. Numer. Anal., 30, 936-952, 1993.
5. M. Dryja and O. B. Widlund. Towards a unified theory o domain decomposition algorithms for elliptic problems. T. F. Chan, R. Glowinski, J. Périaux, and O. B. Widlund, editors., In Proceedings of Third International Symposium on Domain Decomposition Methods for Partial Differential Equations. SIAM, Philadelphia, 1990.
6. H. C. Elman and E. Agron. Ordering techniques for the preconditioning conjugate gradient method on parallel computers. UMIACS-TR-88-53, UMIACS, University of Maryland, 1988.
7. R. W. Freund, G. H. Golub and N. M. Nachtigal. Iterative solution of linear systems, Acta Numerica, 57-100, 1991.
8. T. Goehring and Y. Saad. Heuristic algorithms for automatic graph partitioning. Technical Report UMSI 94-29, University of Minnesota Supercomputer Institute, Minneapolis, MN 55415, Feb. 1994. Submitted.
9. W. Gropp and B. Smith. Experiences with domain decomposition in three dimensions: over-lapping Schwarz methods. A. Quarteroni, et al. editors. In Proceedings of Sixth International Symposium on Domain Decomposition Methods for Partial Differential Equations. AMS, 1993.
10. W. Gropp and B. Smith. Simplified linear equation solvers: User's manual. ANL-93/8, Mathematics and Computer Science Division, Argonne National Laboratory, 1993.
11. J. W. H. Liu. A graph partitioning algorithm by node separators. ACM Transactions on Mathematical Software, 15, 198-219, 1989.
12. A. Pothen, H. D. Simon and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl, 11, 430-452, 1990.
13. Y. Saad. SPARSKIT: a basic tool kit for sparse matrix computations. TR 90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA, 1990.
14. Y. Saad. Highly parallel preconditioners for general sparse matrices. In G. Golub, M. Luskin and A. Greenbaum, editors. Recent Advances in Iterative Methods, IMA Volumes in Mathematics and its Applications, volume 60, pages 165-199. Springer Verlag, 1994.
15. Y. Saad. Krylov subspace methods in distributed computing environments. Preprint 92-126, Army High Performance Computing Research Center, University of Minnesota, 1992.
16. Y. Saad and M. H. Schultz. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comp., 7, 865-869, 1986.
17. H. A. Van der Vorst. Bi-CGSTAB: a more smoothly converging variant of CG-S for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comp., 13, 631-644, 1992.