Skip to Main content Skip to Navigation
Journal articles

A Real QZ Algorithm for Structured Companion Pencils

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01407864
Contributor : Paola Boito <>
Submitted on : Friday, December 2, 2016 - 3:55:09 PM
Last modification on : Thursday, November 21, 2019 - 1:57:55 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 9:30:19 AM

File

RealQZ.pdf
Files produced by the author(s)

Identifiers

Citation

Paola Boito, Yuli Eidelman, Luca Gemignani. A Real QZ Algorithm for Structured Companion Pencils. Calcolo, Springer Verlag, 2017, ⟨10.1007/s10092-017-0231-6⟩. ⟨hal-01407864⟩

Share

Metrics

Record views

749

Files downloads

462