DeepAI AI Chat
Log In Sign Up

Accelerating the Distributed Kaczmarz Algorithm by Strong Over-relaxation

06/02/2020
by   Riley Borgard, et al.
0

The distributed Kaczmarz algorithm is an adaptation of the standard Kaczmarz algorithm to the situation in which data is distributed throughout a network represented by a tree. We isolate substructures of the network and study convergence of the distributed Kazmarz algorithm for relatively large relaxation parameters associated to these substructures. If the system is consistent, then the algorithm converges to the solution of minimal norm; however, if the system is inconsistent, then the algorithm converges to an approximated least-squares solution that is dependent on the parameters and the network topology. We show that the relaxation parameters may be larger than the standard upper-bound in literature in this context and provide numerical experiments to support our results.

READ FULL TEXT
04/11/2019

A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations

The Kaczmarz algorithm is an iterative method for solving systems of lin...
05/20/2023

The standard form and convergence theory of the relaxation Kaczmarz-Tanabe method for solving linear systems

The Kaczmarz method is a popular iterative method for solving consistent...
01/19/2021

A doubly relaxed minimal-norm Gauss-Newton method for nonlinear least-squares

When a physical system is modeled by a nonlinear function, the unknown p...
06/23/2020

Unexpected convergence of lattice Boltzmann schemes

In this work, we study numerically the convergence of the scalar D2Q9 la...
10/30/2021

Convergence and Semi-convergence of a class of constrained block iterative methods

In this paper, we analyze the convergence projected non-stationary bloc...
11/24/2020

Acceleration of Cooperative Least Mean Square via Chebyshev Periodical Successive Over-Relaxation

A distributed algorithm for least mean square (LMS) can be used in distr...
03/12/2023

A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data

In this work, we present the Bregman Alternating Projected Gradient (BAP...