Regularization Total Least Squares and Randomized Algorithms

Abstract

In order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O’Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is considered to deal with computational aspects. In this paper, the generalized singular value decomposition (GSVD) technique is used for computational aspects, and then Tikhonov regularized total least squares based on the generalized singular value decomposition (GTRTLS) algorithm is proposed, whose time complexity is better than TRTLS. For medium- and large-scale problems, the randomized GSVD method is adopted to establish the randomized GTRTLS (RGTRTLS) algorithm, which reduced the storage requirement, and accelerated the convergence speed of the GTRTLS algorithm.

Keywords

• Tikhonov regularization
• total least squares
• generalized singular value decomposition
• randomized algorithms