By Topic

Tracking a few extreme singular values and vectors in signal processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Comon, P. ; Thomson-Sintra, Cagnes-sur-Mer, France ; Golub, G.H.

In various applications it is necessary to keep track of a low-rank approximation of a covariance matrix, R(t), slowly varying with time. It is convenient to track the left singular vectors associated with the largest singular values of the triangular factor, L(t), of its Cholesky factorization. These algorithms are referred to as square-root. The drawback of the eigenvalue decomposition (EVD) or the singular value decompositions (SVD) is usually the volume of the computations. Various numerical methods for carrying out this task are surveyed, and it is shown why this heavy computational burden is questionable in numerous situations and should be revised. Indeed, the complexity per eigenpair is generally a quadratic function of the problem size, but there exist faster algorithms with linear complexity. Finally, in order to make a choice among the large and fuzzy set of available techniques, comparisons based on computer simulations in a relevant signal processing context are made

Published in:

Proceedings of the IEEE  (Volume:78 ,  Issue: 8 )