On weighted structured total least squares

  • Authors:
  • Ivan Markovsky;Sabine Van Huffel

  • Affiliations:
  • ESAT-SCD, K.U. Leuven, Leuven, Belgium;ESAT-SCD, K.U. Leuven, Leuven, Belgium

  • Venue:
  • LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complexity of the proposed algorithm is preserved linear in the sample size when the weight matrix is banded with bandwidth that is independent of the sample size.