Abstract
A UTV decomposition of an m × n matrix is a product of an orthogonal matrix, a middle triangular matrix, and another orthogonal matrix. In this paper we present and analyze algorithms for computing updatable rank-revealing UTV decompositions that are efficient whenever the numerical rank of the matrix is much less than its dimensions.
Similar content being viewed by others
References
H. Barkhuijsen, R. De Beer and D. Van Ormondt, Improved algorithm for noniterative time-domain model fitting to exponentially damped magnetic resonance signals, J. Magnetic Resonance 30 (1987) 553–557.
C.H. Bischof and G.M. Shroff, On updating signal subspaces, IEEE Trans. Signal Proc. 40 (1992) 96–105.
M.W. Berry and R.D. Fierro, Low-rank orthogonal decompositions for information retrieval applications, Num. Lin. Alg. Appl. 3 (1996) 301–327.
A.W. Bojanczyk, R.P. Brent and F.R. de Hoog, QR factorization of Toeplitz matrices, Numer. Math. 49 (1986) 81–94.
T.F. Chan and P.C. Hansen, Low-rank revealing QR factorizations, Num. Lin. Alg. Appl. 1 (1994) 33–44.
P. Comon and G.H. Golub, Tracking a few extreme singular values and vectors in signal processing, Proc. IEEE 78 (1990) 1337–1343.
L. Eldén and E. Sjöström, Fast computation of the principal singular vectors of Toeplitz matrices arising in exponential data modelling, Signal Processing 50 (1996) 151–164.
R.D. Fierro, Perturbation analysis for two-sided (or complete) orthogonal decompositions, SIAM J. Matrix Anal. Appl. 17 (1996) 383–400.
R.D. Fierro and J.R. Bunch, Bounding the subspaces from rank-revealing two-sided orthogonal decompositions, SIAM J. Matrix Anal. Appl. 16 (1995) 743–759.
R.D. Fierro and P.C. Hansen, Accuracy of TSVD solutions computed from rank revealing decompositions, Numer. Math. 70 (1995) 453–471.
R.D. Fierro and S. Qiao, Low-rank GSVD approximations, in preparation.
G.H. Golub and W. Kahan, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal. 2 (Series B) (1965) 205–224.
G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd ed. (John Hopkins Univ. Press, 1989).
P.C. Hansen, Rank-deficient and discrete ill-posed problems, Doctoral dissertation, Report UNIC–95–07, UNI●C (July 1995), 150 pages.
S.H. Jensen, P.C. Hansen, S.D. Hansen and J.Aa. Sørensen, Reduction of broad-band noise in speech by truncated QSVD, IEEE Trans. Audio Speech Proc. 3 (1995) 439–448. [16] F. Lorenzelli, P.C. Hansen, T.F. Chan and K. Yao, A systolic implementation of the Chan/Foster RRQR algorithm, IEEE Trans. Signal Processing 42 (1994) 2205–2208. [17] C.L. Lawson and R.J. Hanson, Solving Least Squares Problems (Prentice-Hall, Englewood Cliffs, NJ, 1974). [18] R. Mathias, Fast accurate eigenvalue computations using the Cholesky factorization, Numer. Math. 74 (1996) 85–103. [19] R. Mathias and G.W. Stewart, A block QR algorithm and the singular value decomposition, Lin. Alg. Appl. 182 (1993) 91–100. [20] H. Park and L. Eldén, Downdating the rank revealing URV decomposition, SIAM J. Matrix Anal. Appl. 16 (1995) 138–155. [21] H. Park and L. Eldén, Stability analysis and fast algorithms for triangularization of Toeplitz matrices, Technical report LiTH-MAT-R–95–16, University of Linköping, Dept. of Mathematics (April 1995), Numer Math., to appear. [22] B.N. Parlett, The Symmetric Eigenvalue Problem (Prentice-Hall, Englewood Cliffs, NJ, 1980). [23] M. Moonen, G.H. Golub and B.L.R. De Moor, eds., Linear Algebra for Large Scale and Real-Time Applications, NATO ASI Series (Kluwer, Dordrecht, 1993). [24] M.A. Rahman and K. Yu, Total least squares approach for frequency estimation using linear prediction, IEEE Trans. on Acoustics, Speech, and Signal Processing 35 (1987) 1442–1454. [25] G.W. Stewart, An updating algorithm for subspace tracking, IEEE Trans. on Signal Processing 40 (1992) 1535–1541. [26] G.W. Stewart, Updating a rank revealing ULV decomposition, SIAM J. Matrix Anal. Appl. 14 (1993) 494–499. [27] G.W. Stewart, Determinating rank in the presence of error, in: Linear Algebra for Large Scale and Real-Time Applications, NATO ASI Series, eds. M.S. Moonen, G.H. Golub and B.L.R. De Moor (Kluwer, Dordrecht, 1993) pp. 275–291. [28] D.W. Tufts and R. Kumaresan, Estimation of frequencies of multiple sinusoids: making linear prediction perform like maximum likelihood, Proc. IEEE 70 (1982) 975–989. [29] S. Van Huffel, P. Lemmerling and L. Vanhamme, Fast algorithms for signal subspace fitting with Toeplitz matrices and applications to exponential data modeling, in: SVD and Signal Processing, III: Algorithms, Architectures, and Applications, eds. M. Moonen and B. De Moor (Elsevier, 1995) pp. 191–198. [30] S. Van Huffel and H. Zha, An efficient total least squares algorithm based on a rank revealing two-sided orthogonal decomposition, Numer. Algorithms 4 (1993) 101–133.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fierro, R.D., Hansen, P.C. Low-rank revealing UTV decompositions. Numerical Algorithms 15, 37–55 (1997). https://doi.org/10.1023/A:1019254318361
Issue Date:
DOI: https://doi.org/10.1023/A:1019254318361