A Gauss-Newton iteration for total least squares problems (Q1647655)

The authors propose a Gauss-Newton type iteration method for the total least squares solution of an overdetermined linear system of equations. Their approach does not require the computation of singular values, but rather reduces the problem to the task of solving a sequence of classical least squares problems whose matrix is modified by a rank-one term. Numerical experiments are presented.