Projections and preconditioning for inconsistent least-squares problems
Two iterative algorithms for the numerical solution of linear least-squares problems are described. They are based on extension of the classical projection method of \textit{S. Kaczmarz} [Bull. Int. Acad. Polon. Sci. A 1937, 355-357 (1937; Zbl 0017.31703)] and an approximate orthogonalization technique due to \textit{Z. Kovarik} [SIAM J. Numer. Anal. 7, 286-389 (1970; Zbl 0217.21501)]. It is shown that both new algorithms converge to any solution of an inconsistent and rank deficient least-squares problem, the convergence being much faster than for the classical Kaczmarz-like methods. Some numerical experiments on a first kind integral equation are described.
- Preconditioners for rank deficient least squares problems
- On Least-Squares Approximate Inverse-Based Preconditioners
- Preconditioned iterative methods for solving linear least squares problems
- scientific article; zbMATH DE number 3965396
- Incomplete oblique projections for solving large inconsistent linear systems
- A projection method for general form linear least-squares problems
- Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
- Preconditioning projection methods for solving algebraic linear systems
- On the preconditioned projective iterative methods for the linear complementarity problems
- A note on preconditioned iterative methods for least squares problems
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- Extension of an approximate orthogonalization algorithm to arbitrary rectangular matrices
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
- Projection method for solving a singular system of linear equations and its applications
- Some Iterative Methods for Improving Orthonormality
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- An acceleration scheme for cyclic subgradient projections method
- A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
- Extensions of incomplete oblique projections method for solving rank-deficient least-squares problems
- Incomplete oblique projections for solving large inconsistent linear systems
- Incomplete alternating projection method for large inconsistent linear systems
- Projection algorithms with correction
- A Kaczmarz-Kovarik algorithm for symmetric ill-conditioned matrices
- On Cimmino's reflection algorithm
- scientific article; zbMATH DE number 1271381 (Why is no real title available?)
- scientific article; zbMATH DE number 1497150 (Why is no real title available?)
- Weaker assumptions for convergence of extended block Kaczmarz and Jacobi projection algorithms
- scientific article; zbMATH DE number 1382840 (Why is no real title available?)
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
- In memoriam Constantin Popa
- Iterative methods for linear least-squares problems
- Numerical solution of symmetric least-squares problems with an inversion-free Kovarik-type algorithm
- A projection method for general form linear least-squares problems
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- Computing projections with LSQR
- Kernel-algorithms in frame-approximations
- A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces
- Convergence statements for projection type linear iterative methods with relaxations
This page was built for publication: Projections and preconditioning for inconsistent least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776797)
