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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Golub, G., Van Loan, C.: An analysis of the total least squares problem. SIAM J. Numer. Anal. 17, 883–893 (1980)
Van Huffel, S., Vandewalle, J.: The total least squares problem: Computational aspects and analysis. SIAM, Philadelphia (1991)
Markovsky, I., Van Huffel, S.: High-performance numerical algorithms and software for structured total least squares. J. of Comput. and Appl. Math. 180(2), 311–331 (2005)
Markovsky, I., Van Huffel, S., Pintelon, R.: Block-Toeplitz/Hankel structured total least squares. SIAM J. Matrix Anal. Appl. 26(4), 1083–1099 (2005)
Markovsky, I., Rastello, M.L., Premoli, A., Kukush, A., Van Huffel, S.: The elementwise weighted total least squares problem. Comp. Stat. & Data Anal. 51(1), 181–209 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Markovsky, I., Van Huffel, S. (2006). On Weighted Structured Total Least Squares. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_80
Download citation
DOI: https://doi.org/10.1007/11666806_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)