The randomized Krylov-Schur algorithm computes a few eigenpairs of large nonsymmetric matrices with consistent 2-4x speedups over deterministic eigensolvers and adds a deflation step with backward error bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Randomized Krylov-Schur eigensolver with deflation
The randomized Krylov-Schur algorithm computes a few eigenpairs of large nonsymmetric matrices with consistent 2-4x speedups over deterministic eigensolvers and adds a deflation step with backward error bounds.