Accelerated Kaczmarz methods via randomized sketch techniques for solving consistent linear systems

Abstract

Motivated by the randomized sketch to solve a variety of problems in scientific computation, we improve both the maximal weighted residual Kaczmarz method and the randomized block average Kaczmarz method using two new randomized sketch techniques. Besides, convergence analyses of the proposed methods are provided. Furthermore, we establish an upper bound for the discrepancy between the numerical solutions obtained via the proposed methods and those derived from the original approaches. Numerical experiments demonstrate that the new methods perform better than the existing ones in terms of the running time with the same accuracy.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…