Prefer a chat interface with context about you and your work?
Implicit QR for companion-like pencils
A fast implicit QR algorithm for eigenvalue computation of low rank corrections of unitary matrices is adjusted to work with matrix pencils arising from polynomial zero-finding problems. The modified QZ algorithm computes the generalized eigenvalues of certain $N\times N$ rank structured matrix pencils using $O(N^2)$ flops and $O(N)$ memory storage. …