By Topic

The singular value decomposition and long and short spaces of noisy matrices

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
$33 $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

1 Author(s)
B. De Moor ; Dept. of Electr. Eng., Katholieke Univ., Leuven, Belgium

Using geometrical, algebraic, and statistical arguments, it is clarified why and when the singular value decomposition is successful in so-called subspace methods. First the concepts of long and short spaces are introduced, and a fundamental asymmetry in the consistency properties of the estimates is discussed. The model, which is associated with the short space, can be estimated consistently, but the estimates of the original data, which follow from the long space, are always inconsistent. An expression is found for the asymptotic bias in terms of canonical angles, which can be estimated from the data. This allows all equivalent reconstructions of the original signals to be described as a matrix ball, the center of which is the minimum variance estimate. Remarkably, the canonical angles also appear in the optimal weighting that is used in weighted subspace fitting approaches. The results are illustrated with a numerical simulation. A number of examples are discussed

Published in:

IEEE Transactions on Signal Processing  (Volume:41 ,  Issue: 9 )