A fast algorithm for solving regularized total least squares problems
Electronic transactions on numerical analysis, Tome 31 (2008), pp. 12-24
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.
Classification :
15A18, 65F15, 65F20, 65F22
Keywords: total least squares, regularization, ill-posedness, nonlinear arnoldi method
Keywords: total least squares, regularization, ill-posedness, nonlinear arnoldi method
@article{ETNA_2008__31__a22,
author = {Lampe, J\"org and Voss, Heinrich},
title = {A fast algorithm for solving regularized total least squares problems},
journal = {Electronic transactions on numerical analysis},
pages = {12--24},
year = {2008},
volume = {31},
zbl = {1171.15305},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_2008__31__a22/}
}
TY - JOUR AU - Lampe, Jörg AU - Voss, Heinrich TI - A fast algorithm for solving regularized total least squares problems JO - Electronic transactions on numerical analysis PY - 2008 SP - 12 EP - 24 VL - 31 UR - http://geodesic.mathdoc.fr/item/ETNA_2008__31__a22/ LA - en ID - ETNA_2008__31__a22 ER -
Lampe, Jörg; Voss, Heinrich. A fast algorithm for solving regularized total least squares problems. Electronic transactions on numerical analysis, Tome 31 (2008), pp. 12-24. http://geodesic.mathdoc.fr/item/ETNA_2008__31__a22/