Deterministic sketching via row subset selection produces subspace embeddings with probability 1 for Krylov methods and yields performance comparable to randomized sketching for matrix functions, linear systems, and eigenvalue problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic sketching for Krylov subspace methods
Deterministic sketching via row subset selection produces subspace embeddings with probability 1 for Krylov methods and yields performance comparable to randomized sketching for matrix functions, linear systems, and eigenvalue problems.