DeepAI AI Chat
Log In Sign Up

On pole-swapping algorithms for the eigenvalue problem

by   Daan Camps, et al.
Washington State University
KU Leuven

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.


page 1

page 2

page 3

page 4


Pole-swapping algorithms for alternating and palindromic eigenvalue problems

Pole-swapping algorithms are generalizations of bulge-chasing algorithms...

On the singular two-parameter eigenvalue problem II

In the 1960s, Atkinson introduced an abstract algebraic setting for mult...

One-shot Distributed Algorithm for Generalized Eigenvalue Problem

Nowadays, more and more datasets are stored in a distributed way for the...

H(curl^2) conforming element for Maxwell's transmission eigenvalue problem using fixed-point approach

Using newly developed H(curl^2) conforming elements, we solve the Maxwel...

A visualisation for conveying the dynamics of iterative eigenvalue algorithms over PSD matrices

We propose a new way of visualising the dynamics of iterative eigenvalue...