Lampe, JörgJörgLampeVoß, HeinrichHeinrichVoß2019-09-062019-09-062012-09-01Journal of Computational and Applied Mathematics 1 (238): 95-108 (2013)http://hdl.handle.net/11420/3324The total least squares (TLS) method is a successful approach for linear problems when not only the right-hand side but the system matrix is also contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we present a new approach for computing an approximate solution of the Tikhonov-regularized large-scale total least-squares problem. An iterative method is proposed which solves a convergent sequence of projected linear systems and thereby builds up a highly suitable search space. The focus is on efficient implementation with particular emphasis on the reuse of information.en0377-04272012195108North-HollandGeneral-form Tikhonov regularizationIll-posednessTotal least squaresMathematikJournal Article10.1016/j.cam.2012.08.023Other