3 papers
math.NA2026
A general framework for Krylov ODE residuals with applications to randomized Krylov methods
Emil Krieger, Marcel Schweitzer
Randomized Krylov subspace methods that employ the sketch-and-solve paradigm to substantially reduce orthogonalization cost have recently shown great promise in speeding up computa…
math.NA2025
Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
Marcel Schweitzer
Polynomial Krylov subspace methods are among the most widely used methods for approximating , the action of a matrix function on a vector, in particular when is large an…
math.NA2024
Sketched and Truncated Polynomial Krylov Subspace Methods: Matrix Sylvester Equations
Davide Palitta, Marcel Schweitzer, Valeria Simoncini
Thanks to its great potential in reducing both computational cost and memory requirements, combining sketching and Krylov subspace techniques has attracted a lot of attention in th…