A Hermitian Lanczos method for normal matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 23, Issue 4, 2002, Pages 1092-1108

  Huhtanen, Marko ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

GMRES; Hermitian Lanczos method; Normal matrix; Toeplitz decomposition

Indexed keywords

EID: 0036400875     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479800398468     Document Type: Article

References (35)

1. M. Arioli, V. Pták, and Z. Strakoš, Krynnlov sequences of maximal length and convergence of GMRES, BIT, 38 (1998), pp. 636-643.
2. P. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 58-78.
3. P. Concus and G.H. Golub, A generalized conjugate gradient method for nonsymmetric systems of linear equations, in Computing Methods in Applied Sciences and Engineering, Lecture Notes in Econ. and Math. Systems 134, R. Glowinski and J.L. Lions, eds., SpringerVerlag, Berlin, New York: 1976, pp. 56-65.
4. J. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997.
5. L. Elsner and Kh.D. Ikramov, Normal matrices: An update, Linear Algebra Appl., 285 (1998), pp. 291-303.
6. L. Elsner and M.H.C. Paardekooper, On measures of nonnormality of matrices, Linear Algebra Appl., 92 (1987), pp. 107-124.
7. V. Faber and T. Manteuffel, Necessary and sufficient conditions for the existence of a conjugate gradient method, SIAM J. Numer. Anal., 21 (1984), pp. 352-362.
8. V. Faber and T. Manteuffel, Orthogonal error methods, SIAM J. Numer. Anal., 24 (1987), pp. 170-187.
9. R.W. Freund and N.M. Nachtigal, QMR: A quasi-minimal residual method for solving non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
10. G.H. Golub and D. Vanderstraeten, On the preconditioning of matrices with dominant skew-symmetric component, Numer. Algorithms, 25 (2000), pp. 223-239.
11. A. Greenbaum, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
12. A. Greenbaum and L. Gurvits, Max-rain properties of matrix factor norms, SIAM J. Sci. Comp., 15 (1994), pp. 348-358.
13. A. Greenbaum and L.N. Trefethen, GMRES/CR and Arnoldi/Lanczos as matrix approximation problems, SIAM J. Sci. Comput., 15 (1994), pp. 359-368.
14. A. Greenbaum and Z. Strakoš, Matrices that generate the same Krylov residual spaces, in Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60, G. Golub, A. Greenbaum, and M. Luskin, eds., Springer-Verlag, New York, 1994, pp. 95-118.
15. R. Grone, C.R. Johnson, E.M. Sa, and H. Wolkowicz, Normal matrices, Linear Algebra Appl., 87 (1987), pp. 213-225.
16. R.A. Horn and C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
17. M. Huhtanen, Ideal GMRES Can Be Bounded from Below by Three Factors, Math. Report A412, Helsinki University of Technology, Espoo, Finland, 1999.
18. M. Huhtanen, A stratification of the set of normal matrices, SIAM J. Matrix. Anal. Appl., 23 (2001), pp. 349-367.
19. M. Huhtanen, Pole Assignment Problems for Error Bounds for GMRES, Math. Report A418, Helsinki University of Technology, Espoo, Finland, 1999.
20. M. Huhtanen, A matrix nearness problem related to iterative methods, SIAM J. Numer. Anal., 39 (2001), pp. 407-422.
21. M. Huhtanen and O. Nevanlinna, Minimal decompositions and iterative methods, Numer. Math., 86 (2000), pp. 257-281.
22. Mathworks, Inc., Matlab, www.mathworks.com/products/matlab.
23. N.M. Nachtigal, S. Reddy, and L.N. Trefethen, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 778-795.
24. O. Nevanlinna, Convergence of Iterations for Linear Equations, Lectures in Mathematics ETH Zürich, Birkhäuser-Verlag, Basel, 1993.
25. B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
26. H. Radjavi, Products of Hermitian matrices and symmetries, Proc. Amer. Math. Soc., 21 (1969), pp. 369-372; Errata, Proc. Amer. Math. Soc., 26 (1970), p. 701.
27. H. Radjavi, Products of Hermitian matrices and symmetries, Proc. Amer. Math. Soc., 21 (1969), pp. 369-372; Errata, Proc. Amer. Math. Soc., 26 (1970), p. 701.
28. M. Rozložnik and Z. Strakoš, Variants of the residual minimizing Krylon space methods, in Proceedings of the XIth Summer School on Software and Algorithms of Numerical Mathematics, I. Marek, ed., Zelezna Ruda, Western Bohemia, 1995, pp. 208-225. Available online at http://deimos.zcu.cz/konference/SANM/SANM.html#SANM'95.
29. A. Ruhe, Closest normal matrix finally found!, BIT, 27 (1987), pp. 585-598.
30. Y. Saad and M.H. Schultz, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comp., 7 (1986), pp. 856-869.
31. M. Saunders, H. Simon, and E. Yip, Two conjugate-gradient-type methods for unsymmetric linear equations, SIAM J. Numer. Anal., 25 (1988), pp. 927-940.
32. Signum Newsletter, 16 (1981), p. 7.
33. V.V. Voevodin, The question of non-self-adjoint extensions of the conjugate gradients methods is closed, USSR Comput. Maths. Phys., 23 (1983), pp. 143-144.
34. H. Van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Comput., 13 (1992), pp. 631-644.
35. O. Widlund, A Lanczos method for a class of nonsymmetric linear equations, SIAM J. Numer. Anal., 15 (1978), pp. 801-812.