PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 19, 2026BIT Numerical Mathematics0 citationsOpen Access

Robust bounds for Krylov methods revisited

ONOlavi Nevanlinna

Key Points

  • The aim is to derive robust bounds for Krylov methods without utilizing special growth functions.
  • Analyzed convergence in generic hermitean and non-normal problems.
  • Used spectral polynomials to represent the resolvent.
  • Avoided special techniques previously required for robustness.
  • Showed that conditioning of eigenvector bases does not affect bounds.
  • Demonstrated that typical perturbations do not significantly impact robustness of Krylov methods.

Abstract

Abstract The paper deals with bounds for Krylov methods which are insensitive in low rank perturbations. In finite dimensional cases resolvents are meromorphic in the whole plane and robust bounds have been constructed using special growth functions created for operator valued meromorphic functions. In this paper such bounds are derived without use of those special tools. In particular, convergence in generic hermitean problems and highly non-normal problems are effectively analysed with the same technique based on representing the resolvent using spectral polynomials and thus for example the conditioning of eigenvector bases does not show up at all.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Olavi Nevanlinna (2026) studied this question.

synapsesocial.com/papers/6996a7b5ecb39a600b3edb06https://doi.org/10.1007/s10543-026-01112-0
Ask AI
Helpful
Bookmark
Share
View Full Paper