An Asynchronous Parallel Randomized Kaczmarz Algorithm
From MaRDI portal
Abstract: We describe an asynchronous parallel variant of the randomized Kaczmarz (RK) algorithm for solving the linear system . The analysis shows linear convergence and indicates that nearly linear speedup can be expected if the number of processors is bounded by a multiple of the number of rows in .
This page was built for publication: An Asynchronous Parallel Randomized Kaczmarz Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6248257)