New fast and accurate Jacobi SVD algorithm. I

SIAM Journal on Matrix Analysis and Applications

Volumn 29, Issue 4, 2007, Pages 1322-1342

  Drmač, Zlatko ^a   Veselić, Krešimir ^b  

^a UNIVERSITY OF ZAGREB   (Croatia)

^b UNIVERSITY OF HAGEN   (Germany)

Author keywords

Eigenvalues; Jacobi method; Singular value decomposition

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS;

DIVIDE-AND-CONQUER ALGORITHM; EIGENVALUES; JACOBI ALGORITHM; JACOBI METHODS; NUMERICAL ACCURACY; NUMERICAL LINEAR ALGEBRA; ONE-SIDED JACOBI; RUN-TIME EFFICIENCY;

SINGULAR VALUE DECOMPOSITION;

EID: 54849426287     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050639193     Document Type: Article

References (34)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, 2nd ed., SIAM, Philadelphia, 1995.
2. J. BARLOW AND J. DEMMEL, Computing accurate eigensystems of scaled diagonally dominant matrices, SIAM J. Numer. Anal., 27 (1990), pp. 762-791.
3. R. BHATIA, Matrix Analysis, Grad. Texts in Math., Springer-Verlag, New York, 1997.
4. C. H. BISCHOF AND G. QUINTANA-ORTI, Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices, ACM Trans. Math. Software, 24 (1998), pp. 254-257.
5. C. H. BISCHOF AND G. QUINTANA-ORTI, Computing rank-revealing QR factorizations of dense matrices, ACM Trans. Math. Software, 24 (1998), pp. 226-253.
6. P. A. BUSINGER AND G. H. GOLUB, Linear least squares solutions by Householder transformations, Numer. Math., 7 (1965), pp. 269-276.
7. S. CHANDRASEKARAN AND I. C. F. IPSEN, On rank-revealing factorisations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 592-622.
8. S. CHANDRASEKARAN AND I. C. F. IPSEN, Analysis of a QR algorithm for computing singular values, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 520-535.
9. A. J. COX AND N. J. HIGHAM, Stability of Householder QR factorization for weighted least squares problems, in Numerical Analysis 1997, Proceedings of the 17th Dundee Biennial Conference, D. F. Griffiths, D. J. Higham, and G. A. Watson, eds., Pitman Res. Notes in Math. Ser. 380, Longman, Harlow, UK, 1998, pp. 57-73.
10. J. DEMMEL, M. GU, S. EISENSTAT, I. SLAPNIČAR, K. VESELIĆ, AND Z. DRMAČ, Computing the singular value decomposition with high relative accuracy, Linear Algebra Appl., 299 (1999), pp. 21-80.
11. J. DEMMEL AND W. KAHAN, Accurate singular values of bidiagonal matrices, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 873-912.
12. J. DEMMEL AND K. VESELIĆ, Jacobi's method is more accurate than QR, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1204-1245.
13. Z. DRMAČ, Computing the Singular and the Generalized Singular Values, Ph.D. thesis, Lehrgebiet Mathematische Physik, Fernuniversität Hagen, Germany, 1994.
14. Z. DRMAČ, A posteriori computation of the singular vectors in a preconditioned Jacobi SVD algorithm, IMA J. Numer. Anal., 19 (1999), pp. 191-213.
15. Z. DRMAČ, On principal angles between subspaces of Euclidean space, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 173-194.
16. Z. DRMAČ AND Z. BUJANOVIĆ, On the failure of rank revealing QR factorization software - a case study, ACM Trans. Math. Software, to appear.
17. Z. DRMAČ, M. OMLADIČ, AND K. VESELIĆ, On the perturbation of the Cholesky factorization, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 1319-1332.
18. Z. DRMAČ AND K. VESELIĆ, New fast and accurate Jacobi SVD algorithm. II, SIAM J. Matrix Anal. Appl., 29 (2008), pp. 1343-1362.
19. S. C. EISENSTAT AND I. C. F. IPSEN, Relative perturbation techniques for singular value problems, SIAM J. Numer. Anal., 32 (1995), pp. 1972-1988.
20. K. V. FERNANDO AND B. N. PARLETT, Implicit Cholesky algorithms for singular values and vectors of triangular matrices, Numer. Linear Algebra Appl., 2 (1995), pp. 507-531.
21. M. GU AND S. C. EISENSTAT, A divide-and-conquer algorithm for the bidiagonal SVD, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 79-92.
22. V. HARI AND Z. DRMAČ, On scaled almost-diagonal Hermitian matrix pairs, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 1000-1012.
23. M. R. HESTENES, Inversion of matrices by biorthogonalization and related results, J. Soc. Indust. Appl. Math., 6 (1958), pp. 51-90.
24. N. J. HIGHAM, QR factorization with complete pivoting and accurate computation of the SVD, Linear Algebra Appl., 309 (2000), pp. 153-174.
25. C. G. J. JACOBI, Über ein leichtes Verfahren die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen, Crelle's Journal für reine und angew. Math., 30 (1846), pp. 51-95.
26. W. KAHAN, Numerical linear algebra, Canad. Math. Bull., 9 (1965), pp. 757-801.
27. R.-C. LI, Relative perturbation theory: I. Eigenvalue and singular value variations, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 956-982.
28. R.-C. LI, Relative perturbation theory: II. Eigenspace and singular subspace variations, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 471-492.
29. R. MATHIAS AND G. W. STEWART, A block QR algorithm for singular value decomposition, Linear Algebra Appl., 182 (1993), pp. 91-100.
30. M. J. D. POWELL AND J. K. REID, On applying Householder transformations to linear least squares problems, in Information Processing 68 (Proc. IFIP Congress, Edinburgh, 1968), North-Holland, Amsterdam, 1969, pp. 122-126.
31. H. RUTISHAUSER, Vorlesungen über numerische Mathematik, Band 2, Differentialgleichungen und Eigenwertprobleme, Birkhäuser Verlag, Basel, Stuttgart, 1976. Lehrbücher und Monographien aus dem Gebiete der exakten Wissenschaften, Math. Reihe, Band 57.
32. G. W. STEWART, The QLP Approximation to the Singular Value Decomposition, Tech. report TR-97-75, Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 1997.
33. J.-G. SUN, Componentwise perturbation bounds for some matrix decompositions, BIT, 32 (1992), pp. 702-714.
34. K. VESELIĆ AND V. HARI, A note on a one-sided Jacobi algorithm, Numer. Math., 56 (1989), pp. 627-633.