Krylov Subspace Recycling For Matrix Functions
From MaRDI portal
Publication:6412243
arXiv2209.14163MaRDI QIDQ6412243FDOQ6412243
Authors: Liam Burke, Andreas Frommer, Kirk M. Soodhalter 
Publication date: 28 September 2022
Abstract: We derive an augmented Krylov subspace method with subspace recycling for computing a sequence of matrix function applications on a set of vectors. The matrix is either fixed or changes as the sequence progresses. We assume consecutive matrices are closely related, but make no assumptions on the relationship between the vectors. We present three versions of the method with different practical implementations. We demonstrate the effectiveness of the method using a range of numerical experiments with a selection of functions and matrices. We primarily focus our attention on the sign function arising in the overlap formalism of lattice QCD.
Has companion code repository: https://github.com/burkel8/matrixfunctionrecycling
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
This page was built for publication: Krylov Subspace Recycling For Matrix Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412243)
