Mathematics > Numerical Analysis
[Submitted on 3 Aug 2022 (v1), last revised 29 Aug 2023 (this version, v2)]
Title:A new deflation criterion for the QZ algorithm
View PDFAbstract:The QZ algorithm computes the Schur form of a matrix pencil. It is an iterative algorithm and at some point, it must decide that an eigenvalue has converged and move on with another one. Choosing a criterion that makes this decision is nontrivial. If it is too strict, the algorithm might waste iterations on already converged eigenvalues. If it is not strict enough, the computed eigenvalues might be inaccurate. Additionally, the criterion should not be computationally expensive to evaluate. This paper introduces a new criterion based on the size of and the gap between the eigenvalues. This is similar to the work of Ahues and Tissuer for the QR algorithm. Theoretical arguments and numerical experiments suggest that it outperforms the most popular criteria in terms of accuracy. Additionally, this paper evaluates some commonly used criteria for infinite eigenvalues.
Submission history
From: Thijs Steel [view email][v1] Wed, 3 Aug 2022 13:26:00 UTC (12 KB)
[v2] Tue, 29 Aug 2023 10:13:56 UTC (139 KB)
Current browse context:
math.NA
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.