@article {15796,
	title = {Regularization by Truncated Total Least Squares},
	journal = {SIAM Journal on Scientific Computing},
	volume = {18},
	year = {1997},
	month = {1997///},
	pages = {1223 - 1241},
	abstract = {The total least squares (TLS) method is a successful method for noise reduction in linear least squares problems in a number of applications. The TLS method is suited to problems in which both the coefficient matrix and the right-hand side are not precisely known. This paper focuses on the use of TLS for solving problems with very ill-conditioned coefficient matrices whose singular values decay gradually (so-called discrete ill-posed problems), where some regularization is necessary to stabilize the computed solution. We filter the solution by truncating the small singular values of the TLS matrix. We express our results in terms of the singular value decomposition (SVD) of the coefficient matrix rather than the augmented matrix. This leads to insight into the filtering properties of the truncated TLS method as compared to regularized least squares solutions. In addition, we propose and test an iterative algorithm based on Lanczos bidiagonalization for computing truncated TLS solutions.},
	keywords = {bidiagonalization, discrete ill-posed problems, regularization, total least squares},
	doi = {10.1137/S1064827594263837},
	url = {http://link.aip.org/link/?SCE/18/1223/1},
	author = {Fierro,R. D. and Golub, G. H and Hansen,P. C. and O{\textquoteright}Leary, Dianne P.}
}
