Rank-Structured QR for Chebyshev Rootfinding

Publication date: 16 August 2021

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.11416

zbMATH Keywords

QR Chebyshev polynomials rootfinding backward error rank-structure

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

Revisiting the computation of the critical points of the Keplerian distance

Uses Software

LAPACK
mctoolbox
Chebfun
Chebfun2

Cites Work

Unnamed Item
A fast implicit QR eigenvalue algorithm for companion matrices
Block Kronecker linearizations of matrix polynomials and their backward errors
On the shifted QR iteration applied to companion matrices
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
Implicit QR for rank-structured matrix pencils
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
The Multishift QR Algorithm. Part II: Aggressive Early Deflation
Backward stability of polynomial root-finding using Fiedler companion matrices
On the stability of computing polynomial roots via confederate linearizations
Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices
THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
LAPACK Users' Guide
Core-Chasing Algorithms for the Eigenvalue Problem
Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil
An Extension of MATLAB to Continuous Functions and Operators
Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
Accuracy and Stability of Numerical Algorithms
Polynomial Roots from Companion Matrix Eigenvalues
Fast and Backward Stable Computation of Roots of Polynomials
Fast Hessenberg Reduction of Some Rank Structured Matrices
An Extension of Chebfun to Two Dimensions
The Matrix Eigenvalue Problem
Optimally packed chains of bulges in multishift QR algorithms

This page was built for publication: Rank-Structured QR for Chebyshev Rootfinding