A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm

DOI10.48550/arXiv.2610.12228MaRDI QIDQ7374657arXivFDO

Authors Jared Lee Aurentz, Giovanni Barbarino, María C. Quintana, Mónica Esquivel-Rosado, Jared L. Aurentz

Publication date 8 October 2026

Published in arXiv

Tldr We present a fast, stable, and square-root-free algorithm for computing eigenvalues of unitary matrices using core chasing; it exploits symmetries to reduce computational work while maintaining backward stability.

Full work available at URL https://doi.org/10.48550/arXiv.2610.12228

arXiv classification

math.NA

Cites work

• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• A Procedure for the Diagonalization of Normal Matrices
• Accuracy and Stability of Numerical Algorithms
• An Error Analysis of a Unitary Hessenberg QR Algorithm
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• Core-Chasing Algorithms for the Eigenvalue Problem
• Fast and stable unitary QR algorithm
• Matrix Computations
• The implicit QL algorithm
• The LLT and QR methods for symmetric tridiagonal matrices
• The QR algorithm for unitary Hessenberg matrices
• The Symmetric Eigenvalue Problem

This page was built for publication: A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7374657)