Global FOM and GMRES algorithms for matrix equations

Applied Numerical Mathematics

Volumn 31, Issue 1, 1999, Pages 49-63

  Jbilou, K ^a   Messaoudi, A ^b   Sadok, H ^a  

^a UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

^b MOHAMMED V UNIVERSITY IN RABAT   (Morocco)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; LYAPUNOV METHODS; PROBLEM SOLVING;

BLOCK METHODS; GLOBAL ARNOLDI; MATRIX KRYLOV SUBSPACE; NONSYMMETRIC LINEAR SYSTEMS;

MATRIX ALGEBRA;

EID: 0033197189     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00094-4     Document Type: Article

References (23)

1. P.N. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput. 12 (1991) 58-78.
2. T. Chan and W. Wang, Analysis of projection methods for solving linear systems with multiple right-hand sides, SIAM J. Sci. Comput., to appear.
3. J. Cullum and W.E. Donath, A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matrices, in: Proc. of IEEE Conf. on Decision and Control, Phoenix (1974).
4. R. Freund and M. Malhotra, A block-QMR algorithm for non-Hermitian linear systems with multiple right-hand sides, Linear Algebra Appl. 254 (1997) 119-157.
5. G.H. Golub and R.R. Underwood, The block Lanczos method for computing eigenvalues, in: J.R. Rice, Ed., Mathematical Software, Vol. 3 (Academic Press, New York, 1977) 364-377.
6. M. Hochbruck and G. Starke, Preconditioned Krylov subspace methods for Lyapunov matrix equations, SIAM J. Matrix Anal. Appl. 16 (1) (1995) 156-171.
7. I.M. Jaimoukha and E.M. Kasenally, Krylov subspace methods for solving large Lyapunov equations, SIAM J. Numer. Anal. 31 (1) (1994) 227-251.
8. K. Jbilou and H. Sadok, Analysis of some vector extrapolation methods for solving systems of linear equations, Numer. Math. 70 (1995) 73-89.
9. M. Malhotra, R. Freund and P.M. Pinsky, Iterative solution of multiple radiation and scattering problems in structural acoustics using a block quasi-minimal residual algorithm, Comput. Methods Appl. Mech. Engrg. 146 (1997) 173-196.
10. N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, A hybrid GMRES algorithm for nonsymmetric matrix iterations, SIAM J. Matrix Anal. Appl. 13 (1992) 796-825.
11. A. Nikishin and A. Yeremin, Variable block CG algorithms for solving large sparse symmetric positive definite linear systems on parallel computers, I: General iterative scheme, SIAM J. Matrix Anal. Appl., to appear.
12. D. O'Leary, The block conjugate gradient algorithm and related methods, Linear Algebra Appl. 29 (1980) 293-322.
13. B. Parlett, A new look at the Lanczos algorithm for solving symmetric systems of linear equations, Linear Algebra Appl. 29 (1980) 323-346.
14. Y. Saad, On the Lanczos method for solving symmetric linear systems with several right-hand sides, Math. Comp. 48 (1987) 651-662.
15. Y. Saad, Numerical solution of large Lyapunov equations, in: M.A. Kaashoek, J.H. Van Schuppen and A.C.M. Ran, Eds., Signal Processing, Scattering, Operator Theory and Numerical Methods (Birkhäuser, Boston, MA, 1990) 503-511.
16. Y. Saad, Iterative Methods for Sparse Linear Systems (PWS Press, New York, 1995).
17. Y. Saad and M.H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7 (1986) 856-869.
18. M. Sadkane, Block Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math. 64 (1993) 687-706.
19. V. Simoncini and E. Gallopoulos, An iterative method for nonsymmetric systems with multiple right-hand sides, SIAM J. Sci. Comput. 16 (1995) 917-933.
20. V. Simoncini and E. Gallopoulos, Convergence properties of block GMRES and matrix polynomial, Linear Algebra Appl., to appear.
21. C. Smith, A. Peterson and R. Mittra, A conjugate gradient algorithm for treatment of multiple incident electromagnetic fields, IEEE Trans. Antennas Propagation 37 (1989) 1490-1493.
22. H. Van Der Vorst, An iterative solution method for solving f(a) = b, using Krylov subspace information obtained for the symmetric positive definite matrix A, J. Comput. Appl. Math. 18 (1987) 249-263.
23. B. Vital, Etude de Quelques Méthodes de Résolution de Problèmes Linéaires de Grande Taille Sur Multiprocesseur, Ph.D. Thesis, Univérsité de Rennes, Rennes, France (1990).