Convergence properties of block GMRES and matrix polynomials

Linear Algebra and Its Applications

Volumn 247, Issue , 1996, Pages 97-119

  Simoncini, V ^a   Gallopoulos, E ^b  

^a CNR   (Italy)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041540457     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(95)00093-3     Document Type: Article

References (40)

1. D. L. Boley and G. H. Golub, The Lanczos-Arnoldi algorithm and controllability, Systems Control Lett. 4:317-324 (1984).
2. P. N. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput. 12(1):58-78 (Jan. 1991).
3. C. G. Broyden, Block conjugate gradient methods, Optim. Methods and Software 2:1-17 (1993).
4. F. Chatelin, Spectral Approximation of Linear Operators, Academic, New York, 1983.
5. D. C. Chatfield, M. S. Reeves, D. G. Truhlar, C. Duneczky, and D. W. Schwenke, Complex Generalized Minimal Residual Algorithm for Iterative Solution of Quantum Mechanical Reactive Scattering Equations, Technical report, Univ. of Minnesota Supercomputer Inst., Minneapolis, MN 55415, Aug. 1992.
6. D. G. Feingold and R. S. Varga, Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem, Pacific J. Math. 12:1241-1250 (1962).
7. B. Fischer and R. W. Freund, Optimal Chebyshev polynomials on ellipses in the complex plane, in Approximation Theory VI (C. K. Chui, L. L. Schumaker, and J. D. Ward, Eds.), Academic, New York, 1989, pp. 251-254.
8. R. W. Freund, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, J. Comput. Appl. Math. 43:135-158 (1992).
9. R. W. Freund and B. Fischer, Chebyshev polynomials are not always optimal, J. Approx. Theory 65:261-272 (1991).
10. G. H. Golub and R. Underwood, The block Lanczos method for computing eigenvalues, in Mathematical Software III (J. R. Rice, Ed.), Academic, New York, 1977, pp. 364-377.
11. I. M. Jaimoukha and E. M. Kasenally, Krylov subspace methods for solving large Lyapunov equations, SIAM J. Numer. Anal. 31(1):227-251 (Feb. 1994).
12. Z. Jia, Generalized block Lanczos methods for large unsymmetric eigenproblems, submitted for publication.
13. W. D. Joubert, On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems, J. Numer. Linear Algebra Appl., submitted for publication.
14. M. D. Kent, Chebyshev, Krylov, Lanczos: Matrix Relationships and Computations, Ph.D. Thesis, Dept. of Computer Science, Stanford Univ., 1989.
15. S. Kharchenko, P. Kolesnikov, A. Nikishin, A. Yeremin, M. Heroux, and Q. Seikh, Iterative solution methods on the Cray YMP/C90. Part II: Dense linear systems, presented at 1993 Simulation Conference: High Performance Computing Symposium, Washington, D.C.
16. T. A. Manteuffel, The Tchebychev iteration for nonsymmetric linear systems, Numer. Math. 28:307-327 (1977).
17. T. A. Manteuffel and J. Otto, On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method, J. Numer. Linear Algebra, to appear.
18. N. M. Nachtigal, S. C. Reddy, and L. N. Trefethen, How fast are nonsymmetric matrix iterations? SIAM J. Matrix Anal. Appl. 13(3):778-795 (July 1992).
19. N. M. Nachtigal, L. Reichel, and L. N. Trefethen, A hybrid GMRES algorithm for nonsymmetric matrix iterations, SIAM J. Matrix Anal. Appl. 13(3):796-825 (July 1992).
20. A. A. Nikishin and A. Y. Yeremin, Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Systems on Parallel Computers, I: General Iterative Scheme, Technical Report EE-RR 1/92, Elegant Mathematics, Inc., 1992, Rev. Jan. 1993.
21. D. P. O'Leary, The block conjugate gradient algorithm and related methods, Linear Algebra Appl. 29:293-322 (1980).
22. D. P. O'Leary, Parallel implementation of the block conjugate gradient algorithm, Parallel Comput. 5:127-139 (1987).
23. C. C. Paige, B. N. Parlett, and H. A. van der Vorst, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl., to appear.
24. M. Papadrakakis and S. Smerou, A new implementation of the Lanczos method in linear problems, Internat. J. Numer. Methods Engrg. 29:141-159 (1990).
25. L. Reichel and L. N. Trefethen, Eigenvalues and pseudo-eigenvalues of Toeplitz matrices, Linear Algebra Appl. 162-164:153-185 (1992).
26. Y. Saad, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp. 37(155):105-125 (1981).
27. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Halstead Press, New York, 1992.
28. Y. Saad, On the rates of convergence of the Lanczos and the block-Lanczos methods, SIAM J. Numer. Anal. 17(5):687-706 (Oct. 1980).
29. Y. Saad and M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7(3):856-869 (July 1986).
30. M. Sadkane, Block Arnoldi and Davidson methods for nonsymmetric large eigenvalue problems, Numer. Math. 64:195-211, (1993).
31. M. Sadkane and B. Vital, Davidson's Method for Linear Systems of Equations. Implementation of a Block Algorithm on a Multi-processor, Technical Report TR/PA 91/60, CERFACS, Toulouse, Sept. 1991.
32. P. E. Saylor and D. C. Smolarski, Implementation of an adaptive algorithm, for Richardson's method, Linear Algebra Appl. 154-156:615-646 (1991).
33. H. D. Simon and A. Yeremin, A new approach to construction of efficient iterative schemes for massively parallel algorithms: Variable block CG and BiCG methods and variable block Arnoldi procedure, in Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, (R. F. Sincovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, and D. A. Reed, Eds.), Philadelphia, Mar. 1993, pp. 57-60.
34. V. Simoncini and E. Gallopoulos, Iterative Methods for Complex Symmetric Systems with Multiple Right-Hand Sides, Technical Report 1322, Center for Supercomputing Research and Development, Univ. of Illinois at Urbana-Champaign, Dec. 1993.
35. V. Simoncini and E. Gallopoulos, A Hybrid Block GMRES Method for Nonsymmetric Systems with Multiple Right-Hand Sides, J. Comput. Appl. Math., 66:457-469 (1996).
36. V. Simoncini and E. Gallopoulos, An iterative method for nonsymmetric systems with multiple right-hand sides, SIAM J. Sci. Statist. Comput., 16(4):917-933 (1995).
37. D. C. Smolarski and P. E. Saylor, Computing the roots of complex orthogonal and kernel polynomials, SIAM J. Sci. Statist. Comput. 9(1):1-13 (1988).
38. L. N. Trefethen, Approximation theory and numerical linear algebra, in Algorithms for Approximation II (J. C. Mason and M. G. Cox, Eds.), Chapman and Hall, 1990, pp. 336-360.
39. R. Underwood, An Iterative Block Lanczos Method for the Solution of Large Sparse Symmetric Eigenproblems, Technical Report STAN-CS-75-496, Computer Science, Stanford Univ., 1975.
40. B. Vital, Etude de quelques Méthodes de Résolution de Problèmes Linéaires de Grande Taille sur Multiprocesseur, Ph.D. Thesis, Univ. de Rennes I, Rennes, Nov. 1990.