@article{5d0f49ff0efa4d5db3a28b33e0eadaaf,
title = "Implicit QR for rank-structured matrix pencils",
abstract = "A fast implicit QR algorithm for eigenvalue computation of low rank corrections of Hermitian matrices is adjusted to work with matrix pencils arising from zerofinding problems for polynomials expressed in Chebyshev-like bases. The modified QZ algorithm computes the generalized eigenvalues of certain N × N rank structured matrix pencils using O(N2) flops and O(N) memory storage. Numerical experiments and comparisons confirm the effectiveness and the stability of the proposed method.",
keywords = "Chebyshev approximation, Complexity, Eigenvalue computation, QZ algorithm, Quasiseparable matrix, Rank-structured matrix",
author = "P. Boito and Y. Eidelman and L. Gemignani",
note = "Funding Information: This work was partially supported by MIUR, grant number 20083KLJEZ.",
year = "2014",
month = mar,
doi = "10.1007/s10543-014-0478-0",
language = "אנגלית",
volume = "54",
pages = "85--111",
journal = "BIT Numerical Mathematics",
issn = "0006-3835",
publisher = "Springer Netherlands",
number = "1",
}