8 citations · 34 across the 25 of their papers we have counts for
4 papers · 1 filter
Structured backward errors in linearizations
Vanni Noferini, Leonardo Robol, Raf Vandebril
A standard approach to compute the roots of a univariate polynomial is to compute the eigenvalues of an associated \emph{confederate} matrix instead, such as, for instance the comp…
Pole-swapping algorithms for alternating and palindromic eigenvalue problems
Thomas Mach, Thijs Steel, Raf Vandebril +1
Pole-swapping algorithms are generalizations of bulge-chasing algorithms for the generalized eigenvalue problem. Structure-preserving pole-swapping algorithms for the palindromic a…
On pole-swapping algorithms for the eigenvalue problem
Daan Camps, Thomas Mach, Raf Vandebril +1
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…
A multishift, multipole rational QZ method with aggressive early deflation
Thijs Steel, Daan Camps, Karl Meerbergen +1
The rational QZ method generalizes the QZ method by implicitly supporting rational subspace iteration. In this paper we extend the rational QZ method by introducing shifts and pole…