Pith. sign in

REVIEW 1 cited by

Krylov Subspace Recycling For Matrix Functions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.14163 v2 pith:H66R24VV submitted 2022-09-28 math.NA cs.NA

Liam Burke , Andreas Frommer , Gustavo Ramirez-Hidalgo , Kirk M. Soodhalter This is my paper · ORCID
classification math.NAcs.NA
keywords matrixmethodsubspacefunctionfunctionskrylovmatricesrecycling
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Integral-Based Framework for Preconditioning $f(A)b$

    math.NA 2026-08 conditional novelty 6.0 of 10

    A Cauchy-integral framework that decouples preconditioner construction from Krylov iteration for f(A)b, with rational and polynomial branches, but the reported gains omit deflation eigensolver costs.

Pith tools