A Real QZ Algorithm for Structured Companion Pencils
Year: 2016
Type: preprint
Abstract: We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion pencils arising from linearizations of polynomial rootfinding problems. The modified QZ algorithm computes the generalized eigenvalues of an $N\times N$ structured matrix pencil using $O(N)$ flops per iteration and $O(N)$ memory storage. Numerical experiments and comparisons confirm the effectiveness and the stability of the proposed method.
Source: arXiv (Cornell University)
Authors: Boito, Paola, Eidelman, Yuli, Gemignani, Luca
Institutions: Lyon 1 Université, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Université de Lyon, XLIM, Laboratoire de l'Informatique du Parallélisme, Université de Limoges, Tel Aviv University, University of Pisa
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950173318