Cover Image

Accelerating a restarted Krylov method for matrix functions with randomization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guidotti, Nicolas L., Martinsson, Per-Gunnar, Acebrón, Juan A., Monteiro, José
Format:	Preprint
Published:	2025
Subjects:	Numerical Analysis 68W20, 65F60, 65F50, 65M20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions
by: Palitta, Davide, et al.
Published: (2023)

GMRES with randomized sketching and deflated restarting
by: Burke, Liam, et al.
Published: (2023)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
by: Persson, David, et al.
Published: (2025)

A general framework for Krylov ODE residuals with applications to randomized Krylov methods
by: Krieger, Emil, et al.
Published: (2025)

Sketched and Truncated Polynomial Krylov Subspace Methods: Matrix Sylvester Equations
by: Palitta, Davide, et al.
Published: (2023)

On a randomized small-block Lanczos method for large-scale null space computations
by: Kressner, Daniel, et al.
Published: (2024)

Fast and forward stable randomized algorithms for linear least-squares problems
by: Epperly, Ethan N.
Published: (2023)

Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
by: Epperly, Ethan N., et al.
Published: (2024)

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
by: Dereziński, Michał, et al.
Published: (2026)

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
by: Yeon, Kingsley, et al.
Published: (2025)

Survey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
by: Ferreira, Inês A., et al.
Published: (2024)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
by: Guidotti, Nicolas L., et al.
Published: (2023)

Acceleration and restart for the randomized Bregman-Kaczmarz method
by: Tondji, Lionel, et al.
Published: (2023)

Randomized flexible Krylov methods for $\ell_p$ regularization
by: Landman, Malena Sabaté, et al.
Published: (2025)

Sharp analysis of sketched least squares and randomized low-rank approximation
by: Epperly, Ethan N., et al.
Published: (2026)

BOLT: Block-Orthonormal Lanczos for Trace estimation of matrix functions
by: Yeon, Kingsley, et al.
Published: (2025)

Relaxed Greedy Randomized Kaczmarz with Signal Averaging for Solving Doubly-Noisy Linear Systems
by: Zhang, Lu, et al.
Published: (2026)

Fast randomized numerical rank estimation for numerically low-rank matrices
by: Meier, Maike, et al.
Published: (2021)

A low-memory Lanczos method with rational Krylov compression for matrix functions
by: Casulli, Angelo A., et al.
Published: (2024)

The Detection and Correction of Silent Errors in Pipelined Krylov Subspace Methods
by: Carson, Erin Claire, et al.
Published: (2024)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
by: Lok, Jackie, et al.
Published: (2025)

Parallelization Strategies for the Randomized Kaczmarz Algorithm on Large-Scale Dense Systems
by: Ferreira, Inês, et al.
Published: (2024)

Efficient Sketching-Based Summation of Tucker Tensors
by: Smith, Rudi, et al.
Published: (2026)

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
by: Epperly, Ethan N.
Published: (2025)

Optimal Krylov On Average
by: Luo, Qi, et al.
Published: (2025)

Accelerating Newton-Schulz Iteration for Orthogonalization via Chebyshev-type Polynomials
by: Grishina, Ekaterina, et al.
Published: (2025)

Coarse grid corrections in Krylov subspace evaluations of the matrix exponential
by: Botchev, Mike A.
Published: (2021)

On Subsample Size of Quantile-Based Randomized Kaczmarz
by: Cai, Jian-Feng, et al.
Published: (2025)

Fast Rank Adaptive CUR via a Recycled Small Sketch
by: Pritchard, Nathaniel, et al.
Published: (2025)

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
by: Cortinovis, Alice, et al.
Published: (2024)

Robust, randomized preconditioning for kernel ridge regression
by: Díaz, Mateo, et al.
Published: (2023)

Hybrid hierarchical matrices with adaptive mixed precision storage
by: Khan, Ritesh, et al.
Published: (2026)

Randomized low-rank Runge-Kutta methods
by: Lam, Hei Yin, et al.
Published: (2024)

Preconditioning via Randomized Range Deflation (RandRAND)
by: Balabanov, Oleg, et al.
Published: (2025)

Randomized Nyström approximation of non-negative self-adjoint operators
by: Persson, David, et al.
Published: (2024)

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
by: Chen, Guan-Yu, et al.
Published: (2025)

A time-frequency method for acoustic scattering with trapping
by: Wilber, Heather, et al.
Published: (2025)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Detecting when one probe vector is enough for preconditioned log-determinant approximation
by: Cortinovis, Alice, et al.
Published: (2026)

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
by: Dong, Yijun, et al.
Published: (2022)