On global randomized block Kaczmarz algorithm for solving large-scale matrix equations

by   Yu-Qi Niu, et al.

The randomized Kaczmarz algorithm is one of the most popular approaches for solving large-scale linear systems due to its simplicity and efficiency. In this paper, we propose two classes of global randomized Kaczmarz methods for solving large-scale linear matrix equations AXB=C, the global randomized block Kaczmarz algorithm and global randomized average block Kaczmarz algorithm. The feature of global randomized block Kaczmarz algorithm is the fact that the current iterate is projected onto the solution space of the sketched matrix equation at each iteration, while the global randomized average block Kaczmarz approach is pseudoinverse-free and therefore can be deployed on parallel computing units to achieve significant improvements in the computational time. We prove that these two methods linearly converge in the mean square to the minimum norm solution X_*=A^† CB^† of a given linear matrix equation. The convergence rates depend on the geometric properties of the data matrices and their submatrices and on the size of the blocks. Numerical results reveal that our proposed algorithms are efficient and effective for solving large-scale matrix equations. In particular, they can also achieve satisfying performance when applied to image deblurring problems.


page 24

page 25


Pseudoinverse-free randomized extended block Kaczmarz for solving least squares

Randomized iterative algorithms have recently been proposed to solve lar...

A weighted global GMRES algorithm with deflation for solving large Sylvester matrix equations

The solution of large scale Sylvester matrix equation plays an important...

A highly scalable approach to solving linear systems using two-stage multisplitting

Iterative methods for solving large sparse systems of linear equations a...

Randomized double and triple Kaczmarz for solving extended normal equations

The randomized Kaczmarz algorithm has received considerable attention re...

Randomized Riemannian Preconditioning for Quadratically Constrained Problems

Optimization problem with quadratic equality constraints are prevalent i...

Stability implies robust convergence of a class of diagonalization-based iterative algorithms

Solving wave equations in a time-parallel manner is challenging, and the...

Analysis of parallel Schwarz algorithms for time-harmonic problems using block Toeplitz matrices

In this work we study the convergence properties of the one-level parall...

Please sign up or login with your details

Forgot password? Click here to reset