A Fast Implicit QR Eigenvalue Algorithm for Companion Matrices

@inproceedings{Bini2008AFI,
  title={A Fast Implicit QR Eigenvalue Algorithm for Companion Matrices},
  author={Dario Bini and Paola Boito and Yuli Eidelman and Luca Gemignani and Israel Gohberg},
  year={2008}
}
An implicit version of the shifted QR eigenvalue algorithm given in [D. A. Bini, Y. Eidelman, I. Gohberg, L. Gemignani, SIAM J. Matrix Anal. Appl. 29 (2007), no. 2, 566–585] is presented for computing the eigenvalues of an n × n companion matrix using O(n2) flops and O(n) memory storage. Numerical experiments and comparisons confirm the effectiveness and the stability of the proposed method. 
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Computing the eigenvalues of a companion matrix. Slides of the talk on the conference Structured Linear Algebra Problems: Analysis, Algorithms, and Applications, Cortona

  • M. Van Barel, P. Van Dooren, R. Vandebril
  • 2008
1 Excerpt

Numerical recipes

  • W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery
  • 2007
1 Excerpt

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

  • Y. Eidelman, L. Gemignani, I. Gohberg
  • Linear Algebra Appl.,
  • 2007

Similar Papers

Loading similar papers…