Convergence of Adaptive, Randomized, Iterative Linear Solvers
From MaRDI portal
Parallel numerical computation (65Y05) Random matrices (algebraic aspects) (15B52) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Randomized algorithms (68W20) Analysis of algorithms (68W40) Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Abstract: 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.
This page was built for publication: Convergence of Adaptive, Randomized, Iterative Linear Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364973)
