Convergence of Adaptive, Randomized, Iterative Linear Solvers

04/10/2021
by   Vivak Patel, et al.
0

Deterministic and randomized, row-action and column-action linear solvers have become increasingly popular owing to their simplicity, low computational and memory complexities, and ease of composition with other techniques. Moreover, in order to achieve high-performance, such solvers must often be adapted to the given problem structure and to the hardware platform on which the problem will be solved. Unfortunately, determining whether such adapted solvers will converge to a solution has required equally unique analyses. As a result, adapted, reliable solvers are slow to be developed and deployed. In this work, we provide a general set of assumptions under which such adapted solvers are guaranteed to converge with probability one, and provide worst case rates of convergence. As a result, we can provide practitioners with guidance on how to design highly adapted, randomized or deterministic, row-action or column-action linear solvers that are also guaranteed to converge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2022

Randomized Block Adaptive Linear System Solvers

Randomized linear solvers leverage randomization to structure-blindly co...
research
03/29/2022

On the relaxed greedy deterministic row and column iterative methods

For solving the large-scale linear system by iteration methods, we utili...
research
10/07/2022

On the extended randomized multiple row method for solving linear least-squares problems

The randomized row method is a popular representative of the iterative a...
research
12/13/2022

On the Polyak momentum variants of the greedy deterministic single and multiple row-action methods

For solving a consistent system of linear equations, the classical row-a...
research
10/08/2018

Probabilistic Linear Solvers: A Unifying View

Several recent works have developed a new, probabilistic interpretation ...
research
06/08/2017

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers

Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in ar...
research
03/12/2021

Are NLP Models really able to Solve Simple Math Word Problems?

The problem of designing NLP solvers for math word problems (MWP) has se...

Please sign up or login with your details

Forgot password? Click here to reset