A fast implicit QR eigenvalue algorithm for companion matrices

Dario A. Bini, Paola Boito, Y. Eidelman, Luca Gemignani, Israel Gohberg

Type: Article

Publication Date: 2009-09-05

Citations: 38

DOI: https://doi.org/10.1016/j.laa.2009.08.003

View Publication

Locations

Linear Algebra and its Applications - View
UnipiEprints Open Archive (Università di Pisa) - View - PDF
HAL (Le Centre pour la Communication Scientifique Directe) - View
CINECA IRIS Institutial research information system (University of Pisa) - View - PDF

Similar Works

Action	Title	Year	Authors
+	A Fast QR Algorithm for Companion Matrices	2007	S. Chandrasekaran Ming Gu Jianlin Xia Jiang Zhu
+	Implicit QR for Companion-like Pencils	2014	Paola Boito Yuli Eidelman Luca Gemignani
+	Implicit QR for Companion-like Pencils	2014	Paola Boito Yuli Eidelman Luca Gemignani
+ PDF Chat	Implicit QR for companion-like pencils	2015	Paola Boito Y. Eidelman Luca Gemignani
+ PDF Chat	Implicit double shift QR-algorithm for companion matrices	2010	Marc Van Barel Raf Vandebril Paul Van Dooren Katrijn Frederix
+	Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials	2017	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+	Fast and backward stable computation of the eigenvalues of matrix polynomials	2016	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+	Fast and backward stable computation of the eigenvalues and eigenvectors of matrix polynomials	2016	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+	Fast and backward stable computation of the eigenvalues and eigenvectors of matrix polynomials	2016	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+	Implicit QR for rank-structured matrix pencils	2014	Paola Boito Yuli Eidelman Luca Gemignani
+	Fast and backward stable computation of roots of polynomials, Part II: backward error analysis; companion matrix and companion pencil	2016	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+ PDF Chat	Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix	2013	Jared L. Aurentz Raf Vandebril David S. Watkins
+	Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices	2007	Dario A. Bini Yuli Eidelman Luca Gemignani Israel Gohberg
+ PDF Chat	Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil	2018	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+	Roots of Polynomials: on twisted QR methods for companion matrices and pencils	2016	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+	ON THE SHIFTED QR ITERATION APPLIED TO COMPANION MATRICES	2004	Dario A. Bini Francesco Daddi Luca Gemignani
+	An implicit QR algorithm for semiseparable matrices to compute the eigendecomposition of symmetric matrices.	2003	Raf Vandebril Marc Van Barel Nicola Mastronardi
+	The Implicit QR Iteration Method for Eigenvalues of Upper Hessenberg Matrices	2013	Yuli Eidelman Israel Gohberg Iulian Haimovici
+	Fast QR iterations for unitary plus low rank matrices	2018	Roberto Bevilacqua Gianna M. Del Corso Luca Gemignani
+	Fast QR iterations for unitary plus low rank matrices	2018	Roberto Bevilacqua Gianna M. Del Corso Luca Gemignani

Works That Cite This (25)

Action	Title	Year	Authors
+	Efficient polynomial root-refiners: A survey and new record efficiency estimates	2011	John McNamee Victor Y. Pan
+	Computing the Zeros of Polynomials using the Divide and Conquer Approach	2014	Michael Farmer
+ PDF Chat	Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix	2013	Jared L. Aurentz Raf Vandebril David S. Watkins
+ PDF Chat	Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil	2018	Jared L. Aurentz Thomas Mach Leonardo Robol Raf Vandebril David S. Watkins
+ PDF Chat	Implicit double shift QR-algorithm for companion matrices	2010	Marc Van Barel Raf Vandebril Paul Van Dooren Katrijn Frederix
+ PDF Chat	Pentadiagonal Companion Matrices	2015	Brydon Eastman Kevin N. Vander Meulen
+	The polynomial eigenvalue problem is well conditioned for random inputs	2017	Carlos Beltrán Diego Armentano
+	Implicit QR with compression	2012	Paola Boito Y. Eidelman Luca Gemignani I. Gohberg
+	Differential qd algorithm with shifts for rank-structured matrices	2011	Pavel Zhlobich
+	AN ITERATIVE METHOD FOR DIAGONALIZATION OF THE FROBENIUS COMPANION MATRIX	2021	Gyurhan H. Nedzhibov

Works Cited by This (6)

Action	Title	Year	Authors
+	Recent Advances in Matrix and Operator Theory	2007	Joseph A. Ball
+ PDF Chat	The unitary completion and QR iterations for a class of structured matrices	2007	Dario A. Bini Yuli Eidelman Luca Gemignani I. Gohberg
+	On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms	2006	Yuli Eidelman Israel Gohberg Luca Gemignani
+	Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices	2007	Dario A. Bini Yuli Eidelman Luca Gemignani Israel Gohberg
+	The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order	2005	Yuli Eidelman Israel Gohberg Vadim Olshevsky
+	A Fast QR Algorithm for Companion Matrices	2007	S. Chandrasekaran Ming Gu Jianlin Xia Jiang Zhu