A Gauss-Newton iteration for total least squares problems
From MaRDI portal
Publication:1647655
DOI10.1007/s10543-017-0678-5zbMath1444.65013arXiv1608.01619OpenAlexW2552332016MaRDI QIDQ1647655
Publication date: 26 June 2018
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01619
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items
Implicit iterative algorithm for solving regularized total least squares problems, On condition numbers of the total least squares problem with linear equality constraint, A Gauss-Newton method for mixed least squares-total least squares problems, An efficient Gauss-Newton algorithm for solving regularized total least squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- Overview of total least-squares methods
- Bibliography on total least squares and related methods
- Scaled total least squares fundamentals
- Methods for Large Scale Total Least Squares Problems
- Extension of the total least square problem using general unitarily invariant norms
- Analysis and Solution of the Nongeneric Total Least Squares Problem
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Block-Toeplitz/Hankel Structured Total Least Squares
- Some Modified Matrix Eigenvalue Problems
