On pole-swapping algorithms for the eigenvalue problem

06/20/2019

∙

by   Daan Camps, et al.

∙

Washington State University

∙

KU Leuven

∙

0

∙

share

Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is developed. A key component of all such algorithms is a procedure that swaps two adjacent eigenvalues in a triangular pencil. An improved swapping routine is developed, and its superiority over existing methods is demonstrated by a backward error analysis and numerical tests.