Single projection Kaczmarz extended algorithms

From MaRDI portal
Publication:342879

DOI10.1007/S11075-016-0118-7zbMATH Open1376.65062arXiv1504.00231OpenAlexW2288570682MaRDI QIDQ342879FDOQ342879


Authors: Stefania Petra, Constantin Popa Edit this on Wikidata


Publication date: 18 November 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: To find the least squares solution of a very large and inconsistent system of equations, one can employ the extended Kaczmarz algorithm. This method simultaneously removes the error term, such that a consistent system is asymptotically obtained, and applies Kaczmarz iterations for the current approximation of this system. For random corrections of the right hand side and Kaczmarz updates selected at random, convergence to the least squares solution has been shown. We consider the deterministic control strategies, and show convergence to a least squares solution when row and column updates are chosen according to the almost-cyclic or maximal-residual choice.


Full work available at URL: https://arxiv.org/abs/1504.00231




Recommendations




Cites Work


Cited In (27)





This page was built for publication: Single projection Kaczmarz extended algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342879)