On the weighting method for mixed least squares–total least squares problems
Authors:
- 11 April 2017
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 24 (5)
Abstract
Summary: It is well known that the standard algorithm for the mixed least squares–total least squares (MTLS) problem uses the QR factorization to reduce the original problem into a standard total least squares problem with smaller size, which can be solved based on the singular value decomposition (SVD). In this paper, the MTLS problem is proven to be closely related to a weighted total least squares problem with its error‐free columns multiplied by a large weighting factor. A criterion for choosing the weighting factor is given; and for the sake of stability in solving the MTLS problem, the Cholesky factorization‐based inverse (Cho‐INV) iteration and Rayleigh quotient iteration are also considered. For large‐scale MTLS problems, numerical tests show that Cho‐INV is superior to the standard QR‐SVD method, especially for the case with big gap between the desired and undesired singular values and the case when the coefficient matrix has much more error‐contaminated columns. Rayleigh quotient iteration behaves more efficient than QR‐SVD for most cases and fails occasionally, and in some cases, it converges much faster than Cho‐INV but still less efficient due to its higher computation cost.Keywords
Funding Information
- National Natural Science Foundation of China (11001167)
This publication has 12 references indexed in Scilit:
- A note on Constrained Total Least-Squares estimationLinear Algebra and its Applications, 2006
- The solution set of the mixed ls-tls problemInternational Journal of Computer Mathematics, 2001
- Numerical Methods for Least Squares Problems1996
- Analysis of the generalized total least squares problemAX?B when some columns ofA are free of errorNumerische Mathematik, 1993
- Algebraic relations between the total least squares and least squares problems with more than one solutionNumerische Mathematik, 1992
- The Analysis for the Total Least Squares Problem with More Than One SolutionSIAM Journal on Matrix Analysis and Applications, 1992
- The Restricted Total Least Squares Problem: Formulation, Algorithm, and PropertiesSIAM Journal on Matrix Analysis and Applications, 1991
- The Total Least Squares Problem1991
- Analysis and Properties of the Generalized Total Least Squares Problem $AX \approx B$ When Some or All Columns in A are Subject to ErrorSIAM Journal on Matrix Analysis and Applications, 1989
- An Analysis of the Total Least Squares ProblemSIAM Journal on Numerical Analysis, 1980