Single projection Kaczmarz extended algorithms
In order 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, so that a consistent system is asymptotically obtained, and applies Kaczmarz iterations for the current...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
02 March 2016
|
| In: |
Numerical algorithms
Year: 2016, Volume: 73, Issue: 3, Pages: 791-806 |
| ISSN: | 1572-9265 |
| DOI: | 10.1007/s11075-016-0118-7 |
| Online Access: | Verlag, Volltext: http://dx.doi.org/10.1007/s11075-016-0118-7 Verlag, Volltext: https://link.springer.com/article/10.1007/s11075-016-0118-7 Verlag, Volltext: https://link.springer.com/content/pdf/10.1007%2Fs11075-016-0118-7.pdf 
|
| Author Notes: | Stefania Petra, Constantin Popa |
| Summary: | In order 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, so that a consistent system is asymptotically obtained, and applies Kaczmarz iterations for the current approximation of this system. It has been shown that for random corrections of the right hand side and Kaczmarz updates selected at random, the algorithm converges to the least squares solution. In this work we consider deterministic strategies like the maximal-residual and the almost-cyclic control, and show convergence to a least squares solution. |
|---|---|
| Item Description: | Gesehen am 15.03.2018 |
| Physical Description: | Online Resource |
| ISSN: | 1572-9265 |
| DOI: | 10.1007/s11075-016-0118-7 |