For solving large-scale systems of linear equations by iteration methods, we introduce an
effective probability criterion for selecting the working rows from the coefficient matrix and …

Randomized iterative algorithms have recently been proposed to solve large-scale linear
systems. In this paper, we present a simple randomized extended average block Kaczmarz …

The randomized version of the Kaczmarz method for the solution of consistent linear
systems is known to converge linearly in expectation. And even in the possibly inconsistent …

Inverse problems consist of recovering a signal from a collection of noisy measurements.
These problems can often be cast as feasibility problems; however, additional regularization …

Following the philosophy of the block Kaczmarz methods, we propose a randomized block
Kaczmarz method with the blocks determined by the k-means clustering (RBK (k)). It can be …

The standard randomized sparse Kaczmarz (RSK) method is an algorithm to compute
sparse solutions of linear systems of equations and uses sequential updates, and thus, does …

Abstract The Extended Randomized Kaczmarz method is a well known iterative scheme
which can find the Moore-Penrose inverse solution of a possibly inconsistent linear system …

Magnetic particle imaging (MPI) is an imaging modality exploiting the nonlinear
magnetization behavior of (super-) paramagnetic nanoparticles to obtain a space-and often …

We consider the block Bregman–Kaczmarz method for finite dimensional linear inverse
problems. The block Bregman–Kaczmarz method uses blocks of the linear system and …

Abstract Randomized Kaczmarz, Motzkin Method and Sampling Kaczmarz Motzkin (SKM)
algorithms are commonly used iterative techniques for solving a system of linear inequalities …