Accurate singular value decompositions of structured matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 2, 1999, Pages 562-580

  Demmel, James ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cauchy matrix; Displacement rank; High accuracy; Singular value decomposition; Vandermonde matrix

Indexed keywords

EID: 0033633262     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0895479897328716     Document Type: Article

References (37)

1. C. BISCHOF AND G. QUINTANA-ORTI, Computing rank-revealing QR factorizations of dense matrices, ACM Trans. Math. Software, 24 (1998), pp. 226-253.
2. D. BLACKSTON, private communication, 1997.
3. T. BOROS, T. KAILATH, AND V. OLSHEVSKY, Pivoting and backward stability of fast algorithms for solving Cauchy linear equations, SIAM J. Matrix Anal. Appl., submitted.
4. T. BOROS, T. KAILATH, AND V. OLSHEVSKY. The Fast Björck-Pereyra-type Algorithm for Parallel Solution of Cauchy Linear Equations, Linear Algebra Appl., to appear.
5. T. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
6. S. CHANDRASEKARAN AND I. IPSEN, On rank-revealing QR factorizations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 592-622.
7. J. DEMMEL AND W. GRAGG, On computing accurate singular values and eigenvalues of acyclic matrices, Linear Algebra Appl., 185 (1993), pp. 203-218.
8. 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., (1997), to appear.
9. J. DEMMEL AND K. VESELIĆ, Jacobi's method is more accurate than QR, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1204-1246.
10. Z. DRMAČ, Accurate computation of the product-induced singular value decomposition with applications, SIAM J. Numer. Anal., 35 (1998), pp. 1969-1994.
11. Z. DRMAČ, On the condition behaviour in the Jacobi method, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 509-514.
12. Z. DRMAČ, Fast and accurate algorithms for canonical correlations, weighted least squares and related generalized eigenvalue and singular value decompositions, SIAM J. Matrix Anal. Appl., to appear.
13. Z. DRMAČ, A posteriori computation of the singular vectors in a preconditioned Jacobi SVD algorithm, IMA J. Numer. Anal., 19 (1998), pp. 191-213.
14. F. GANTMACHER AND M. KREIN, Oszillationsmatrizen, Oszillationskerne, und kleine Schwingungen mechanischer Systeme, Akademie-Verlag, Berlin, 1960.
15. I. GOHBERG, T. KAILATH, AND V. OLSHEVSKY, Fast Gaussian elimination with partial pivoting for matrices with displacement structure, Math. Comp., 64 (1995), pp. 1557-1576.
16. I. GOHBERG AND V. OLSHEVSKY, Fast algorithms with preprocessing for matrix-vector multiplication problems, J. Complexity, 10 (1994), pp. 411-427.
17. I. GOHBERG AND V. OLSHEVSKY, Fast state space methods for matrix Nehari and Nehari-Takagi interpolation problems. Integral Equations Operator Theory, 20 (1994), pp. 44-83.
18. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
19. M. Gu, Some New Rank-Revealing Factorizations, Tech. report CAM Report 98-33, Department of Mathematics, University of California at Los Angeles, Los Angeles, 1998.
20. M. Gu AND S. EISENSTAT, Efficient algorithms for computing a strong rank-revealing QR factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
21. N. J. HIGHAM, Stability analysis of algorithms for solving confluent Vandermonde-like systems, SIAM J. Matrix AnaL Appl., 11 (1990), pp. 23-41.
22. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
23. N. J. HIGHAM, Optimization by direct search in matrix computations, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 317-333.
24. P. HONG AND C. T. PAN, The rank revealing QR and SVD, Math. Comp., 58 (1992), pp. 575-232.
25. W. KAHAN, private communication, 1997.
26. S. KARLIN, Total Positivity, Stanford University Press, Stanford, CA, 1968.
27. A. KHINCHIN, Continued Fractions, The University of Chicago Press, Chicago, IL, 1964.
28. W. MASCARENHAS, A note on Jacobi being more accurate than QR, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 215-218.
29. R. MATHIAS, Accurate eigensystem computations by Jacobi methods, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 977-1003.
30. V. OLSHEVSKY, Pivoting on structured matrices and applications, Linear Algebra Appl., to appear.
31. C. T. PAN, On the existence and computation of rank-revealing LU factorizations, Linear Algebra Appl., (1996), submitted.
32. C. T. PAN AND P. TANG, Bounds on singular values revealed by QR factorization, BIT, 39 (1999), to appear.
33. D. PRIEST, Algorithms for arbitrary precision floating point arithmetic, in Proceedings of the 10th Symposium on Computer Arithmetic, P. Kornerup and D. Matula, eds., Grenoble, France, 1991, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 132-145.
34. G. W. STEWART, Updating a rank-revealing ULV decomposition, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 494-499.
35. P. T. P. TANG, Table-driven implementation of the logarithm function for IEEE floating-point arithmetic, ACM Trans. Math. Software, 16 (1990), pp. 378-400.
36. P. T. P. TANG, Table-driven implementation of the Expml function for IEEE floating-point arithmetic, ACM Trans. Math. Software, 18 (1992), pp. 211-222.
37. S. WOLFRAM, Mathematica: A System for Doing Mathematics by Computer, Addison-Wesley, Reading, MA, 1988.