On the Condition Number of the Total Least Squares Problem

Abstract

This paper concerns singular value decomposition (SVD)-based computable formulas and bounds for the condition number of the Total Least Squares (TLS) problem. For the TLS problem with the coefficient matrix $A$ and the right-hand side $b$, a new closed formula is presented for the condition number. Unlike an important result in the literature that uses the SVDs of both $A$ and $[A,b]$, our formula only requires the SVD of $[A,b]$. Based on the closed formula, both lower and upper bounds for the condition number are derived. It is proved that they are always sharp and estimate the condition number accurately. A few lower and upper bounds are further established that involve at most the smallest two singular values of $A$ and of $[A,b]$. Tightness of these bounds is discussed, and numerical experiments are presented to confirm our theory and to demonstrate the improvement of our upper bounds over the two upper bounds due to Golub and Van Loan as well as Baboulin and Gratton. Such lower and upper bounds are particularly useful for large scale TLS problems since they require the computation of only a few singular values of $A$ and $[A,b]$ other than all the singular values of them.

27 pages, 2 figures. arXiv admin note: text overlap with arXiv:1101.2342

Cited by in corpus (8)

• A note on the condition number of the scaled total least squares problem
• Perturbation Analysis and Randomized Algorithms for Large-Scale Total Least Squares Problems
• Condition numbers for the truncated total least squares problem and their estimations
• A contribution to condition numbers of the multidimensional total least squares problem with linear equality constraint
• On the condition number theory of the equality constrained indefinite least squares problem
• On the partial condition numbers for the indefinite least squares problem
• Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem
• Structured condition numbers for the total least squares problem with linear equality constraint and their statistical estimation