Randomized block subsampling Kaczmarz-Motzkin method

DOI10.1016/J.LAA.2023.03.003arXiv2211.16682MaRDI QIDQ6418998

Publication date: 29 November 2022

Abstract: By introducing a subsampling strategy, we propose a randomized block Kaczmarz-Motzkin method for solving linear systems. Such strategy not only determines the block size, but also combines and extends two famous strategies, i.e., randomness and greed, and hence can inherit their advantages. Theoretical analysis shows that the proposed method converges linearly in expectation to the least-Euclidean-norm solution. Several numerical examples are reported to verify the efficiency and feasibility of the new method.

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

This page was built for publication: Randomized block subsampling Kaczmarz-Motzkin method

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