International audienceA 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
International audienceAn implicit version of the shifted QR eigenvalue algorithm given in Bini et al...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
International audienceA fast implicit QR algorithm for eigenvalue computation of low rank correction...
International audienceA fast implicit QR algorithm for eigenvalue computation of low rank correction...
International audienceWe design a fast implicit real QZ algorithm for eigenvalue computation of stru...
We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion penci...
Recently an extension of the class of matrices admitting a Francis type of multishift QR algorithm w...
Hermitian plus possibly unhermitian low rank matrices can be efficiently reduced into Hessenberg for...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
© 2018 American Mathematical Society. In the last decade matrix polynomials have been investigated w...
In the last decade matrix polynomials have been investigated with the primary focus on adequate line...
AbstractAn implicit version of the shifted QR eigenvalue algorithm given in Bini et al. [D.A. Bini, ...
An implicit version of the QR eigenvalue algorithm given in [D. A. Bini, Y. Eidelman
International audienceAn implicit version of the shifted QR eigenvalue algorithm given in Bini et al...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
International audienceA fast implicit QR algorithm for eigenvalue computation of low rank correction...
International audienceA fast implicit QR algorithm for eigenvalue computation of low rank correction...
International audienceWe design a fast implicit real QZ algorithm for eigenvalue computation of stru...
We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion penci...
Recently an extension of the class of matrices admitting a Francis type of multishift QR algorithm w...
Hermitian plus possibly unhermitian low rank matrices can be efficiently reduced into Hessenberg for...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
© 2018 American Mathematical Society. In the last decade matrix polynomials have been investigated w...
In the last decade matrix polynomials have been investigated with the primary focus on adequate line...
AbstractAn implicit version of the shifted QR eigenvalue algorithm given in Bini et al. [D.A. Bini, ...
An implicit version of the QR eigenvalue algorithm given in [D. A. Bini, Y. Eidelman
International audienceAn implicit version of the shifted QR eigenvalue algorithm given in Bini et al...
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg f...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...