Computing the bidiagonal SVD using multiple relatively robust representations

SIAM Journal on Matrix Analysis and Applications

Volumn 28, Issue 4, 2006, Pages 907-926

  Willems, Paul R ^a,b   Lang, Bruno ^b   Vömel, Christof ^c  

^a FORSCHUNGSZENTRUM JÜLICH   (Germany)

^b UNIVERSITY OF WUPPERTAL   (Germany)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bidiagonal singular value decomposition; Coupling relations; LAPACK library; MRRR algorithm; Tridiagonal symmetric eigenproblem

Indexed keywords

BIDIAGONAL SINGULAR VALUE DECOMPOSITION; COUPLING RELATIONS; TRIDIAGONAL SYMMETRIC EIGENPROBLEM;

ALGORITHMS; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; PROBLEM SOLVING; ROBUST CONTROL;

SINGULAR VALUE DECOMPOSITION;

EID: 34547250699     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050628301     Document Type: Conference Paper

References (21)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSEN, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, 1999.
2. C. DAVIS AND W. M. KAHAN, The rotation of eigenvectors by a perturbation. III, SIAM J. Numer. Anal., 7 (1970), pp. 1-46.
3. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997.
4. J. DEMMEL AND W. KAHAN, Accurate singular values of bidiagonal matrices, SIAM J. Sci. Comput., 11 (1990), pp. 873-912.
5. J. W. DEMMEL, O. A. MARQUES, B. N. PARLETT, AND C. VÖMEL, Performance and Accuracy of the Symmetric Eigensolvers in LAPACK, University of California, Berkeley, 2005, in preparation.
6. 2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem, Ph.D. thesis, University of California, Berkeley, CA, 1997.
7. I. S. DHILLON AND B. N. PARLETT, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Linear Algebra Appl., 387 (2004), pp. 1-28.
8. I. S. DHILLON AND B. N. PARLETT, Orthogonal eigenvectors and relative gaps, SIAM J. Matrix Anal. Appl., 25 (2004), pp. 858-899.
9. I. S. DHILLON, B. N. PARLETT, AND C. VÖMEL, The Design and Implementation of the MRRR Algorithm, Tech. Report UCBCSD-04-1346, University of California, Berkeley, 2004 (also LAPACK Working Note 162).
10. 2) Algorithmus für die Bidiagonale Singulä rwertzerlegung, Ph.D. thesis, Bergische Universität Wuppertal, Fachbereich Mathematik, Wuppertal, Germany, 2001.
11. B. GROßER AND B. LANG, On symmetric eigenproblems induced by the bidiagonal SVD, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 599-620.
12. 2) algorithm for the bidiagonal SVD, Linear Algebra Appl., 358 (2003), pp. 45-70.
13. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
14. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
15. B. N. PARLETT, The new gd algorithms, Cambridge University Press, (1995), pp. 459-491.
16. B. N. PARLETT, Invariant subspaces for tightly clustered eigenvalues of tridiagonals, BIT, 36 (1996), pp. 542-562.
17. B. N. PARLETT AND I. S. DHILLON, Fernando's solution to Wilkinson's problem: An application of double factorization, Linear Algebra Appl., 267 (1997), pp. 247-279.
18. B. N. PARLETT AND I. S. DHILLON, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl., 309 (2000), pp. 121-151.
19. B. N. PARLETT AND O. MARQUES, An implementation of the DQDS algorithm (positive case), Linear Algebra Appl., 309 (2000), pp. 217-259.
20. B. N. PARLETT AND C. VÖMEL, How the MRRR Algorithm Can Fail on Tight Eigenvalue Clusters, Tech. Report UCB-CSD-04-1367, University of California, Berkeley, 2004 (also LAPACK Working Note 163).
21. B. N. PARLETT AND C. VÖMEL, HOW to Improve FP Vectors in the MRRR Algorithm by Twisted Inverse Iteration, University of California, Berkeley, 2005, in preparation.