Pith. sign in

REVIEW 2 cited by

An Asynchronous Parallel Randomized Kaczmarz Algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.4780 v2 pith:RBW3IHRA submitted 2014-01-20 math.NA cs.NAmath.OC

classification math.NAcs.NAmath.OC
keywords linearalgorithmasynchronouskaczmarznumberparallelrandomizedanalysis
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We describe an asynchronous parallel variant of the randomized Kaczmarz (RK) algorithm for solving the linear system $Ax=b$. 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 $A$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adaptive Row Selection Meets Asynchrony in Randomized Kaczmarz

    cs.DC 2026-07 conditional novelty 6.5 of 10

    Residual-weighted asynchronous Kaczmarz is stable only below a concurrency-dependent sampling-aggressiveness boundary ℓ*(T); threshold-greedy diverges at high thread counts, while under-relaxation and inconsistent res...

  2. Randomized Kaczmarz methods for t-product tensor linear systems with factorized operators

    math.NA 2024-12 conditional novelty 6.0 of 10

    New randomized Kaczmarz variants solve t-product tensor systems with factorized operators, with linear-in-expectation convergence guarantees for consistent outer systems and for inconsistent outer systems when the inn...

Pith tools