By Topic

Total least squares for affinely structured matrices and the noisy realization problem

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

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

Structured rank-deficient matrices arise in many applications in signal processing, system identification, and control theory. The author discusses the structured total least squares (STLS) problem, which is the problem of approximating affinely structured matrices (i.e., matrices affine in the parameters) by similarly structured rank-deficient ones, while minimizing an L2-error criterion. It is shown that the optimality conditions lead to a nonlinear generalized singular value decomposition, which can be solved via an algorithm that is inspired by inverse iteration. Next the author concentrates on the so-called L2-optimal noisy realization problem, which is equivalent with approximating a given data sequence by the impulse response of a finite dimensional, time invariant linear system of a given order. This can be solved as a structured total least squares problem. It is shown with some simple counter examples that “classical” algorithms such as the Steiglitz-McBride (1965), iterative quadratic maximum likelihood and Cadzow's (1988) iteration do not converge to the optimal L2 solution, despite misleading claims in the literature

Published in:

Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 11 )