Randomized matrix-vector algorithms need Ω(κ log(1/ε)) products for general linear systems (two-sided) and n products without the transpose, matching CGNE and GMRES.
Clarkson and David P
1 Pith paper cite this work, alongside 235 external citations. Polarity classification is still indexing.
1
Pith paper citing it
235
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The matrix-vector complexity of $Ax=b$
Randomized matrix-vector algorithms need Ω(κ log(1/ε)) products for general linear systems (two-sided) and n products without the transpose, matching CGNE and GMRES.