A matrix nearness problem related to iterative methods

SIAM Journal on Numerical Analysis

Volumn 39, Issue 2, 2002, Pages 407-422

  Huhtanen, Marko ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Iterative methods; Nearness problem; Short term recurrence

Indexed keywords

EID: 0035322471     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142999363620     Document Type: Article

References (24)

1. I. DUFF, R. GRIMES, AND J. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
2. M. EIERMANN, Field of values and iterative methods, Linear Algebra Appl., 180 (1993), pp. 167-198.
3. 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.
4. R. FREUND AND N. NACHTIGAL, QMR: A quasi-minimal residual method for solving non-Hermitian linear systems, Numer. Math., 60 (1991), pp. 315-339.
5. G.H. GOLUB AND C.F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, London, 1996.
6. A. GREENBAUM AND Z. STRAKOS, Matrices that generate same Krylov residual spaces, in Recent Advances in Iterative Methods, G. Golub, A. Greenbaum, and M. Luskin, eds., IMA Vol. Math. Appl. 60, Springer-Verlag, New York, 1994.
7. A. GREENBAUM, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
8. N.J. HIGHAM, Matrix Nearness Problems and Applications, Inst. Math. Appl. Conf. Ser. New Ser. 22, Oxford University Press, New York, 1989.
9. S. HOLMGREN AND K. OTTO, A Framework for Polynomial Preconditioners Based on Fast Transforms II: PDE Applications, Tech. Report 168, Department of Scientific Computing, Uppsala University, Uppsala, Sweden, 1995.
10. S. HOLMGREN AND K. OTTO, A framework for polynomial preconditioners based on fast transforms II: PDE applications, BIT, 38 (1998), pp. 721-736.
11. R.A. HORN AND C.R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
12. R.A. HORN AND C.R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
13. M. HUHTANEN, Ideal GMRES Can Be Bounded from Below by Three Factors, Helsinki Univ. Tech Math. Report A412, Helsinki University of Technology, Espoo, Finland, 1999.
14. M. HUHTANEN, A stratification of the set of normal matrices, SIAM J. Matrix Anal. Appl., to appear.
15. M. HUHTANEN, Pole Assignment Problems for Error Bounds for GMRES, Helsinki Univ. Tech. Math Report A418, Helsinki University of Technology, Espoo, Finland, 1999.
16. M. HUHTANEN AND O. NEVANLINNA, Minimal decompositions and iterative methods, Numer. Math., 86 (2000), pp. 257-281.
17. MATHWORKS, Matlab, www.mathworks.com/products/matlab.
18. N.M. NACHTIGAL, S.C. REDDY, AND L.N. TREFETHEN, How fast are nonsymmetric matrix iterations?, SIAM J. Matrix Anal. Appl. 13 (1992), pp. 778-795.
19. O. NEVANLINNA, Convergence of Iterations for Linear Equations, Lectures Math. ETH Zürich, Birkhäuser Verlag, Basel, 1993.
20. A. RUHE, Closest normal matrix finally found!, BIT, 27 (1987), pp. 585-598.
21. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
22. H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.
23. V.V. VOEVODIN, The question of non-self-adjoint extensions of the conjugate gradients methods is closed, USSR Comput. Math. and Math. Phys., 23 (1983), pp. 143-144.
24. W.M. WONHAM, Linear Multivariable Control: A Geometric Approach, Springer-Verlag, New York, 1979.