Abstract
For large-scale problems, how to establish an algorithm with high accuracy and stability is particularly important. In this paper, the Householder bidiagonalization total least squares (HBITLS) algorithm and nonlinear iterative partial least squares for total least squares (NIPALS-TLS) algorithm were established, by which the same approximate TLS solutions was obtained. In addition, the propagation of the roundoff error for the process of the HBITLS algorithm was analyzed, and the mixed forward-backward stability of these two algorithms was proved. Furthermore, an upper bound of roundoff error was derived, which presents a more detailed and clearer approximation of the computed solution.
Funder
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference20 articles.
1. Matrix Computations;Golub,2013
2. The total least squares problem, computational aspects and analysis;Huffel,1991
3. Stability of two direct methods for bidiagonalization and partial least squares;Björck;SIAM J. Matrix Anal. Appl.,2014
4. Accuracy and Stability of Numerical Algorithms;Higham,2002