A Real QZ Algorithm for Structured Companion Pencils
Résumé
We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion pencils arising from linearizations of polynomial rootfind-ing problems. The modified QZ algorithm computes the generalized eigenvalues of an N × N structured matrix pencil using O(N 2) flops and O(N) memory storage. Numerical experiments and comparisons confirm the effectiveness and the stability of the proposed method.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...