Revisiting Asynchronous Linear Solvers
From MaRDI portal
Publication:3177757
DOI10.1145/2814566zbMath1426.65047arXiv1304.6475OpenAlexW2963750012MaRDI QIDQ3177757
Anshul Gupta, Alex Druinsky, Haim Avron
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6475
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Randomized algorithms (68W20) Linear equations (linear algebraic aspects) (15A06)
Related Items (15)
Randomized numerical linear algebra: Foundations and algorithms ⋮ On unbounded delays in asynchronous parallel fixed-point algorithms ⋮ Performance analysis of asynchronous parallel Jacobi ⋮ Red light green light method for solving large Markov chains ⋮ Perturbed Iterate Analysis for Asynchronous Stochastic Optimization ⋮ Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties ⋮ On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations ⋮ Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory ⋮ Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup ⋮ Asynchronous Richardson iterations: theory and practice ⋮ ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ Distributed Stochastic Optimization with Large Delays
This page was built for publication: Revisiting Asynchronous Linear Solvers
