Affiliation:
1. School of Mathematics and Statistics, Qinghai University for Nationalities, Xining, P.R. China
Abstract
In this paper, we first get further consideration of the first order
perturbation with normwise condition number of the MTLS problem. For easy
estimation, we show a lower bound for the normwise condition number which is
proved to be optimal. In order to overcome the problems encountered in
calculating the normwise condition number, we give an upper bound for
computing more effectively and nonstandard and unusual perturbation bounds
for the MTLS problem. Both of the two types of the perturbation bounds can
enjoy storage and computational advantages. For getting more insight into
the sensitivity of the MTLS technique with respect to perturbations in all
data, we analyze the corrections applied by MTLS to the data in Ax ? b to
make the set compatible and indicate how closely the data A, b fit the
so-called general errors-in-variables model. On how to estimate the
conditioning of the MTLS problem more effectively, we propose statistical
algorithms by taking advantage of the superiority of small sample
statistical condition estimation (SCE) techniques.
Publisher
National Library of Serbia
Reference28 articles.
1. Q. H. Liu, M. H. Wang, On the weighting method for mixed least squares-total least squares problems, Numer. Linear. Algebra Appl., 2017, 24(5): e2094.
2. F. Cucker, H. Diao, Y. Wei, On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems, Math. Comp., 76(2007)947-963.
3. M. Baboulin, S. Gratton, A contribution to the conditioning of the total least-squares problem, SIAM J. Matrix Anal. Appl., 32(2011)685- 699.
4. G. H. Golub, L. Van, F. Charles, An analysis of the total least squares problem, SIAM J. Numer. Anal., 17( 1980)883-893.
5. G. H. Golub, L. Van, F. Charles, Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences, 4-th, Johns Hopkins University Press, Baltimore, MD, 2013.