Paperlane

no. 14 · Friday 13 November 2026

A Givens-Based Direct Eigenvalue Swapping Algorithm with Rounding Error Analysis

Meiyue Shao and Rentao Xu

math.NA · v2

Abstract

For a given matrix $ A $ in the real Schur form, the eigenvalue swapping algorithm is used to swap two adjacent diagonal blocks. In LAPACK, this operation is performed by the subroutine xLAEXC, which is based on a direct swapping algorithm proposed by Bai and Demmel in 1993. In this work, we propose a modified direct swapping algorithm for two $ 2 \times 2 $ blocks, replacing Householder QR with a pivoted Givens QR factorization. A thorough error analysis shows that the modified algorithm can achieve an error bound of the form $ O( \boldsymbol{u} \lVert A \rVert ) $ under mild assumptions, where $ \boldsymbol{u} $ is the unit roundoff. We present empirical evidence to illustrate the superior stability of our algorithm over existing approaches.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30795 ↗