Papers › Accelerating a restarted Krylov method for matrix functions with randomization
Accelerating a restarted Krylov method for matrix functions with randomization
Nicolas L. Guidotti, Per-Gunnar Martinsson, Juan A. Acebrón, José Monteiro
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Many scientific applications require the evaluation of the action of a matrix function on a vector, and Krylov subspace methods are the most common ones for this task. Since the orthogonalization cost and the memory requirements can quickly become overwhelming as the basis grows, the Krylov method is often restarted after a few iterations. This paper proposes a new acceleration technique for restarted Krylov methods based on randomization. The numerical experiments show that the randomized method greatly outperforms the classical approach at the same level of accuracy. In fact, randomization can actually improve the convergence rate of restarted methods in some cases. The paper also compares the performance and stability of several existing randomized methods for solving very large, ill-conditioned problems, complementing the numerical analyses from previous studies.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections