Get started
Work

Restoring Similarity in Randomized Krylov Methods with Applications to Eigenvalue Problems and Matrix Functions

Year: 2026
Type: article
Abstract: . The randomized Arnoldi process has been used in large-scale scientific computing because it produces a well-conditioned basis for the Krylov subspace more quickly than the standard Arnoldi process. However, the resulting Hessenberg matrix is generally not similar to the one produced by the standard Arnoldi process, which can lead to delays or spike-like irregularities in convergence. In this paper, we introduce a modification of the randomized Arnoldi process that restores similarity with the Hessenberg matrix generated by the standard Arnoldi process. This is accomplished by enforcing orthogonality between the last Arnoldi vector and the previously generated subspace, which requires solving only one additional least-squares problem. When applied to eigenvalue problems and matrix function evaluations, the modified randomized Arnoldi process produces approximations that are identical to those obtained with the standard Arnoldi process. Numerical experiments demonstrate that our approach is as fast as the randomized Arnoldi process and as robust as the standard Arnoldi process. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/nShao678/Similarity-restoring-randomized-Arnoldi-code and in the supplementary materials ( Similarity-restoring-randomized-Arnoldi-code-main.zip [759 KB]). [Formula: see text]
DOI: 10.1137/26m1841641
Language: English
Open Access status: green
OpenAlex ID: W7124454472
FWCI:
Cites:
Cited by:
Related to: