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
research
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...
research
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...
research
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...
research
06/23/2020

Unexpected convergence of lattice Boltzmann schemes

In this work, we study numerically the convergence of the scalar D2Q9 la...
research
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...
research
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...
research
12/18/2019

On theoretical upper limits for valid timesteps of implicit ODE methods

Implicit methods for the numerical solution of initial-value problems ma...

Please sign up or login with your details

Forgot password? Click here to reset