Volume 31, pp. 12-24, 2008.

A fast algorithm for solving regularized total least squares problems

Jörg Lampe and Heinrich Voss

Abstract

The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457–476] suggested an iterative method based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we accelerate it substantially by solving the linear eigenproblems by the Nonlinear Arnoldi method (which reuses information from the previous iteration step considerably) and by a modified root finding method based on rational interpolation.

Full Text (PDF) [170 KB]

Key words

Total least squares, regularization, ill-posedness, Nonlinear Arnoldi method.

AMS subject classifications

15A18, 65F15, 65F20, 65F22.

ETNA articles which cite this article

Vol. 42 (2014), pp. 13-40 Jörg Lampe and Heinrich Voss: Large-scale dual regularized total least squares

< Back