Scalable parallel implementations of the GMRES algorithm via Householder reflections

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 1998, Pages 396-404

  Sosonkina, Maria ^a   Allison, Donald C S ^b   Watson, Layne T ^b  

^a UNIVERSITY OF MINNESOTA DULUTH   (United States)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS; LINEAR TRANSFORMATIONS;

COEFFICIENT MATRIX; GLOBAL COMMUNICATION; HOUSEHOLDER REFLECTIONS; HOUSEHOLDER TRANSFORMATION; ITERATIVE SOLUTION METHODS; ORTHOGONALIZATION; PARALLEL IMPLEMENTATIONS; SPARSE NONSYMMETRIC LINEAR SYSTEMS;

ITERATIVE METHODS;

EID: 0009106897     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1998.708511     Document Type: Conference Paper

References (15)

1. Å. Björck. Solving linear least squares problems by Gram-Schmidt orthogonalization. BIT, 7:1-21, 1967.
2. C. H. Bischof and P. T. P. Tang. Robust incremental condition estimation. Tech. Rep. CS-91-133, LAPACK Working Note 33, Computer Sci. Dept., Univ. of Tennessee, May, 1991.
3. P. N. Brown and H. F. Walker. GMRES on (nearly) singular systems. SIAM J. Matrix Anal. Appl., 18(1):37-51, January 1997.
4. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore MD, 2nd ed., 1989.
5. A. Y. Grama, A. Gupta, and V. Kumar. Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Parallel and Distrib. Technol., 1:12-21, 1993.
6. A. Gupta, and V. Kumar. Performance and scalability of preconditioned conjugate methods on parallel computers. IEEE Trans. Parallel and Distrib. Systems, 6:455-469, 1995.
7. G. Karypis and V. Kumar. MeTiS: Unstructured graph partitioning and sparse matrix ordering system. User's Guide|Version 2.0, Dept. of Computer Sci., Univ. of Minnesota, Minneapolis MN 55455, 1995.
8. G.-C. Lo and Y. Saad. Iterative solution of general sparse linear systems on clusters of workstations. Tech. Report, UMSI 96/117, Supercomputer Institute, Univ. of Minnesota, 1200 S. Washington Ave., Minneapolis MN 55415, August 1996.
9. Y. Saad and M. H. Schultz. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput., 7:856-869, 1986.
10. R. B. Sidje. Alternatives for parallel Krylov subspace basis computation. Numer. Linear Algebra Appl., 4:305-331, 1997.
11. J. P. Singh, J. L. Hennessy, and A. Gupta. Scaling parallel programs for multiprocessors: methodology and examples. Computer, 7:42-50, 1993.
12. M. Sosonkina. Parallel sparse linear algebra for homotopy methods. Ph.D. Thesis, Computer Sci. Dept., Virginia Tech, Blacksburg VA 24061, September 1997.
13. M. Sosonkina, L. T. Watson, R. K. Kapania, and H. F. Walker. A new adaptive GMRES algorithm for achieving high accuracy. Numer. Linear Algebra Appl., accepted.
14. H. A. van der Vorst and C. Vuik. The superlinear convergence behaviour of GMRES. J. Comp. Appl. Math., 48:327-341, 1993.
15. H. F. Walker. Implementation of the GMRES method using Householder Transformations. SIAM J. Sci. Stat. Comput., 9:152-163, 1988.