Deterministic sketching for Krylov subspace methods

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Bergermann, Kai
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908947809566720
author Bergermann, Kai
author_facet Bergermann, Kai
contents Randomized sketching is currently introduced into every area of numerical linear algebra. In Krylov subspace methods, it allows runtime savings at the cost of small accuracy reductions. This work offers a different view on sketching in Krylov methods by analyzing what subspace embeddings are obtained by arbitrary sketching matrices. The analysis gives rise to a deterministic sketching approach leveraging row subset selection techniques that yield subspace embeddings holding with probability 1. We propose deterministically sketched Krylov methods for matrix functions, linear systems, and eigenvalue problems that show a similar performance to their randomly sketched counterparts.
format Preprint
id arxiv_https___arxiv_org_abs_2604_07158
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Deterministic sketching for Krylov subspace methods
Bergermann, Kai
Numerical Analysis
Randomized sketching is currently introduced into every area of numerical linear algebra. In Krylov subspace methods, it allows runtime savings at the cost of small accuracy reductions. This work offers a different view on sketching in Krylov methods by analyzing what subspace embeddings are obtained by arbitrary sketching matrices. The analysis gives rise to a deterministic sketching approach leveraging row subset selection techniques that yield subspace embeddings holding with probability 1. We propose deterministically sketched Krylov methods for matrix functions, linear systems, and eigenvalue problems that show a similar performance to their randomly sketched counterparts.
title Deterministic sketching for Krylov subspace methods
topic Numerical Analysis
url https://arxiv.org/abs/2604.07158