arXiv · 1608.01619
A Gauss--Newton iteration for Total Least Squares problems
Abstract
The Total Least Squares solution of an overdetermined, approximate linear equation $Ax \approx b$ minimizes a nonlinear function which characterizes the backward error. We show that a globally convergent variant of the Gauss--Newton iteration can be tailored to compute that solution. At each iteration, the proposed method requires the solution of an ordinary least squares problem where the matrix $A$ is perturbed by a rank-one term.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dario Fasino, Antonio Fazzi. 2017-07-28. A Gauss--Newton iteration for Total Least Squares problems. https://doi.org/10.1007/s10543-017-0678-5
Cite the original work for its findings. Save a collection to share your selection of sources.