Krylov subspace recycling with randomized sketching for matrix functions
type: Item
instance of: scholarly article
title: Krylov subspace recycling with randomized sketching for matrix functions
author: Liam Burke
author: Stefan Güttel
published in: SIAM Journal on Matrix Analysis and Applications
publication date: 2025-01-09T00:00:00Z
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 65F99
zbMATH DE Number: 7964150
zbMATH Keywords: matrix function
zbMATH Keywords: Krylov method
zbMATH Keywords: subspace recycling
zbMATH Keywords: randomized sketching
MaRDI profile type: MaRDI publication profile
cites work: Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
cites work: Recycling Krylov Subspaces and Truncating Deflation Subspaces for Solving Sequence of Linear Systems
cites work: Randomized Gram--Schmidt Process with Application to GMRES
cites work: Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
cites work: Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
cites work: Krylov subspace recycling for evolving structures
cites work: BAMPHI: matrix-free and transpose-free action of linear combinations of \(\varphi\)-functions from exponential integrators
cites work: The university of Florida sparse matrix collection
cites work: Near-optimal perfectly matched layers for indefinite Helmholtz problems
cites work: Deflated Restarting for Matrix Functions
cites work: Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
cites work: Efficient and stable Arnoldi restarts for matrix functions based on quadrature
cites work: Block Krylov subspace methods for functions of matrices
cites work: Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
cites work: Recycling Krylov subspace methods for sequences of linear systems. Analysis and applications
cites work: Ritz and harmonic Ritz values and the convergence of FOM and GMRES
cites work: Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
cites work: A sketch-and-select Arnoldi process
cites work: Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
cites work: Lattice quantum chromodynamics. Practical essentials
cites work: Computing a matrix function for exponential integrators.
cites work: Randomized numerical linear algebra: Foundations and algorithms
cites work: A Restarted GMRES Method Augmented with Eigenvectors
cites work: GMRES with Deflated Restarting
cites work: Fast and accurate randomized algorithms for linear systems and eigenvalue problems
cites work: Recycling Krylov Subspaces for Sequences of Linear Systems
cites work: On the generation of Krylov subspace bases
cites work: A fast randomized algorithm for overdetermined linear least-squares regression
cites work: Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
cites work: Q4414854
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: A Krylov--Schur algorithm for large eigenproblems
cites work: Computational Advertising: Techniques for Targeting Relevant Ads
cites work: A fast randomized algorithm for the approximation of matrices
DOI: 10.1137/23M1595904
description: scientific article; zbMATH DE number 7964150