Relative perturbation results for matrix eigenvalues and singular values

Acta Numerica

Volumn 7, Issue , 1998, Pages 151-201

  Ipsen, Ilse C F ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85011525782     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492900002828     Document Type: Article

References (53)

1. Barlow J. and Demmel J. (1990), ‘Computing accurate eigensystems of scaled diagonally dominant matrices’, SIAM J. Numer. Anal. 27, 762–91.
2. Bauer F. and Fike C. (1960), ‘Norms and exclusion theorems’, Numer. Math. 2, 137–41.
3. Bhatia R. (1997), Matrix Analysis, Springer, New York.
4. Chan T. (1982), ‘An improved algorithm for computing the singular value decomposition’, ACM Trans. Math. Software 8, 72–83.
5. Chandrasekaran S. and Ipsen I. (1995), ‘Analysis of a QR algorithm for computing singular values’, SIAM J. Matrix Anal. Appl. 16, 520–35.
6. Deift P., Demmel J., Li L. and Tomei C. (1991), ‘The bidiagonal singular value decomposition and Hamiltonian mechanics’, SIAM J. Numer. Anal. 28, 1463–1516.
7. Demmel J. (1997), Applied Numerical Linear Algebra, SIAM, Philadelphia.
8. Demmel J. and Gragg W. (1993), ‘On computing accurate singular values and eigenvalues of matrices with acyclic graphs’, Linear Algebra Appl. 185, 203–17.
9. Demmel J. and Kahan W. (1990), ‘Accurate singular values ofbidiagonal matrices’, SIAM J. Sci. Statist. Comput. 11, 873–912.
10. Demmel J. and Veselić K. (1992), ‘Jacobi's method is more accurate than QR’ SIAM J. Matrix Anal. Appl. 13, 1204–45.
11. Demmel J., Gu M., Eisenstat S., Slapničar I., Veselić K. and Drmač Z. (1997), Computing the singular value decomposition with high relative accuracy, Technical report, Computer Science Division, University of California, Berkeley, CA.
12. 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem, PhD thesis, University of California, Berkeley, California.
13. Dhillon I., Fann G. and Parlett B. (1997), Application of a new algorithm for the symmetric eigenproblem to computational quantum chemistry, in Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia.
14. Di Lena G., Peluso R. and Piazza G. (1993), ‘Results on the relative perturbation of the singular values of a matrix’, BIT 33, 647–53.
15. Drmač Z. (1994), Computing the singular and the generalized singular values, PhD thesis, Fachbereich Mathematik, Fernuniversität Gesamthochschule Hagen, Germany.
16. Drmač Z. (1996a), ‘On relative residual bounds for the eigenvalues of a Hermitian matrix’, Linear Algebra Appl. 244, 155–64.
17. Drmač Z. (1996b), ‘On the condition behaviour in the Jacobi method’, SIAM J. Matrix Anal. Appl. 17, 509–14.
18. Drmač Z. and Hari V. (1997), ‘Relative residual bounds for the eigenvalues of a Hermitian semidefinite matrix’, SIAM J. Matrix Anal. Appl. 18, 21–9.
19. Eisenstat S. and Ipsen I. (1994), Relative perturbation bounds for eigenspaces and singular vector subspaces, in Applied Linear Algebra, SIAM, Philadelphia, pp. 62–5.
20. Eisenstat S. and Ipsen I. (1995), ‘Relative perturbation techniques for singular value problems’, SIAM J. Numer. Anal. 32, 1972–88.
21. Eisenstat S. and Ipsen I. (1996), Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices, Technical Report CRSC-TR96-6, Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.
22. Eisenstat S. and Ipsen I. (1997), Three absolute perturbation bounds for matrix eigenvalues imply relative bounds, Technical Report CRSC-TR97-16, Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University. Under review for SIAM J. Matrix Anal. Appl.
23. Eisner L. and Friedland S. (1995), ‘Singular values, doubly stochastic matrices, and applications’, Linear Algebra Appl. 220, 161–9.
24. Fernando K. and Parlett B. (1994), ‘Accurate singular values and differential qd algorithms’, Numer. Math. 67, 191–229.
25. Gu M. and Eisenstat S. (1993), Relative perturbation theory for eigenproblems, Research Report YALEU/DCS/RR-934, Department of Computer Science, Yale University.
26. Hari V. and Drmač Z. (1997), ‘On scaled almost diagonal Hermitian matrix pairs’, SIAM J. Matrix Anal. Appl. 18, 1000–1012.
27. Horn R. and Johnson C. (1985), Matrix Analysis, Cambridge University Press.
28. Horn R. and Johnson C. (1991), Topics in Matrix Analysis, Cambridge University Press.
29. Kahan W. (1966), Accurate eigenvalues of a symmetric tri–diagonal matrix, Technical Report CS41, Computer Science Department, Stanford University. Revised June 1968.
30. Li C. and Mathias R. (1997), On the Lidskii–Mirsky–Wielandt theorem, Technical report, Department of Mathematics, College of William and Mary, Williamsburg, VA.
31. Li R. (1994a), Relative perturbation theory: (I) eigenvalue variations, LAPACK working note 84, Computer Science Department, University of Tennessee, Knoxville. Revised May 1997.
32. Li R. (1994b), Relative perturbation theory: (II) eigenspace variations, LAPACK working note 85, Computer Science Department, University of Tennessee, Knoxville. Revised May 1997.
33. Li R. (1997), ‘Relative perturbation theory: (III) more bounds on eigenvalue variation’, Linear Algebra Appl. 266, 337–45.
34. Löwner K. (1934), ‘Über monotone Matrix Funktionen’, Math. Z. 38, 177–216.
35. Matejaš J. and Hari V. (1998), ‘Scaled almost diagonal matrices with multiple singular values’, Z. Angew. Math. Mech. 78, 121–31.
36. Mathias R. (1995), ‘Accurate eigensystem computations by Jacobi methods’, SIAM J. Matrix Anal. Appl. 16, 977–1003.
37. Mathias R. (1996), ‘Fast accurate eigenvalue methods for graded positive–definite matrices’, Numer. Math. 74, 85–103.
38. Mathias R. (1997a), ‘A bound for matrix square root with application to eigenvector perturbation’, SIAM J. Matrix Anal. Appl. 18, 861–7.
39. Mathias R. (1997b), ‘Spectral perturbation bounds for positive definite matrices’, SIAM J. Matrix Anal. Appl. 18, 959–80.
40. Mathias R. and Stewart G. (1993), ‘A block QR algorithm and the singular value decomposition’, Linear Algebra Appl. 182, 91–100.
41. Mathias R. and Veselić K. (1995), A relative perturbation bound for positive–definite matrices, revised December 1996.
42. Ostrowski A. (1959), ‘A quantitative formulation of Sylvester's law of inertia’, Proc. Nat. Acad. Sci. 45, 740–4.
43. Parlett B. (1980), The Symmetric Eigenvalue Problem, Prentice Hall.
44. Parlett B. (1995), ‘The new qd algorithms’, in Acta Numerica, Vol. 4, Cambridge University Press, pp. 459–91.
45. Parlett B. (1997), Spectral sensitivity of products of bidiagonals. Unpublished manuscript.
46. Pietzsch E. (1993), Genaue Eigenwertberechnung nichtsingulärer schiefsymme–trischer Matrizen, PhD thesis, Fachbereich Mathematik, Fernuniversität Gesamthochschule Hagen, Germany.
47. Rosanoff R., Glouderman J. and Levy S. (1968), Numerical conditions of stiffness matrix formulations for frame structures, in Proceedings of the Conference on Matrix Methods in Structural Mechanics, AFFDL–TR-68-150, Wright-Patterson Air Force Base, Ohio, pp. 1029–60.
48. Slapničar I. (1992), Accurate symmetric eigenreduction by a Jacobi method, PhD thesis, Fernuniversität Gesamthochschule Hagen, Germany.
49. Slapničar I. and Veselić K. (1995), ‘Perturbations of the eigenprojections of a factorised Hermitian matrix’, Linear Algebra Appl. 218, 273–80.
50. Truhar N. and Slapničar I. (1997), Relative perturbation bounds for invariant subspaces of indefinite Hermitian matrices. Unpublished manuscript.
51. van der Sluis A. (1969), ‘Condition, equilibration, and pivoting in linear algebraic systems’, Numer. Math. 15, 74–86.
52. Veselić K. and Hari V. (1989), A note on a one-sided Jacobi algorithm, Numer. Math. 56, 627–33.
53. Veselić K. and Slapničar I. (1993), ‘Floating–point perturbations of Hermitian matrices’, Linear Algebra Appl. 195, 81–116.