Exclusion and inclusion regions for the eigenvalues of a normal matrix

SIAM Journal on Matrix Analysis and Applications

Volumn 23, Issue 4, 2002, Pages 1070-1091

  Huhtanen, Marko ^a   Larsen, Rasmus Munk ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algebraic subvariety of 2; B zout's theorem; Eigenvalue localization; Normal matrix; Polyanalytic polynomial; Ritz value; Slowly growing length of the recurrence

Indexed keywords

EID: 0036400874     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801384561     Document Type: Article

References (30)

1. E. Allgower and K. Georg, Continuation and path following, Acta Numer., 1993, pp. 1-64.
2. W.E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
3. M.B. Balk, Polyanalytic Functions, Akademie-Verlag, Berlin, 1991.
4. P. Borwein, The arc length of the lemniscate {|p(z)| = 1}, Proc. Amer. Math. Soc., 123 (1995), pp. 797-799.
5. R. Brent, An algorithm with guaranteed convergence for finding a zero of a function, Comput. J., 14 (1971), pp. 422-425.
6. R. Brualdi and S. Mellendorf, Regions in the complex plane containing the eigenvalues of a matrix, Amer. Math. Monthly, 101 (1994), pp. 975-985.
7. J. Bus and T. Dekker, Two efficient algorithms with guaranteed convergence for finding a zero of a function, ACM Trans. Math. Software, 1 (1975), pp. 330-345.
8. J.W. Daniel, W.B. Gragg, L. Kaufman, and G.W. Stewart, Reorthogonalization and stable algorithms updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
9. J. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997.
10. L. Elsner and Kh.D. Ikramov, On a condensed form for normal matrices under finite sequence of elementary similarities, Linear Algebra Appl., 254 (1997), pp. 79-98.
11. R. Grone, C.R. Johnson, E.M. Sa, and H. Wolkowicz, Normal matrices, Linear Algebra Appl., 87 (1987), pp. 213-225.
12. N.J. Higham, Estimating the matrix p-norm, Numer. Math., 62 (1992), pp. 511-538.
13. R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1987.
14. A.S. Householder, Lectures on Numerical Algebra, Mathematical Association of America, Buffalo, NY, 1972.
15. A.S. Householder, Principles of Numerical Analysis, Dover, New York, 1974.
16. M. Huhtanen, A stratification of the set of normal matrices, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 349-367.
17. M. Huhtanen, Splitting Matrices into a Sum of Two Normal Matrices, manuscript.
18. M. Huhtanen, Orthogonal polyanalytic polynomials and normal matrices, Math. Comp., to appear.
19. M. Huhtanen and O. Nevanlinna, Minimal decompositions and iterative methods, Numer. Math., 86 (2000), pp. 257-281.
20. O. Knüppel, PROFIL/BIAS-A Fast Interval Library, Computing, 53 (1994), pp. 277-287.
21. T. Manteuffel and G. Starke On hybrid iterative methods for nonsymmetric systems of linear equations, Numer. Math, 73 (1996), pp. 489-506.
22. Mathworks, Matlab, available online from www.mathworks.com/products/matlab.
23. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
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, SIAM, Philadelphia, 1998.
26. V. Pták and J. Zemánek, Continuité lipschitzienne du spectre comme fonction d'un opérateur normal, Comment. Math. Univ. Carolin., 17 (1976), pp. 507-512.
27. L. Reichel and W.B. Gragg, Algorithm 686: FORTRAN subroutines for updating the QR decomposition, ACM Trans. Math. Software, 16 (1990), pp. 369-377.
28. S.M. Hump, INTLAB-INTerval LABoratory, in Developments in Reliable Computing, T. Csendes, ed., Kluwer Academic, Dordrecht, The Netherlands, 2000, pp. 77-105.
29. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Halstead Press, New York, 1992.
30. L.N. Trefethen and D. Bau, Numerical Linear Algebra, SIAM, Philadelphia, 1997.