Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
From MaRDI portal
Recommendations
- Approximate computation of eigenvalues with Chebyshev collocation method
- scientific article; zbMATH DE number 2217743
- Computing the pth roots of a matrix with repeated eigenvalues
- A Chebyshev collocation method for computing the eigenvalues of the Laplacian
- Computing stable eigendecompositions of matrices
- scientific article; zbMATH DE number 1102835
- Stable iterations for the matrix square root
- Computing stable eigendecompositions of matrix pencils
- scientific article; zbMATH DE number 7564157
- Stability of Chebyshev collocation methods
Cites work
- Approximation theory and approximation practice
- Backward error analysis of polynomial eigenvalue problems solved by linearization
- Backward stability of polynomial root-finding using Fiedler companion matrices
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Chebyshev interpolation for nonlinear eigenvalue problems
- Duality of matrix pencils, Wong chains and linearizations
- Fiedler companion linearizations and the recovery of minimal indices
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Leverrier's algorithm for orthogonal polynomial bases
- Linearization of matrix polynomials expressed in polynomial bases
- ON MATRICES DEPENDING ON PARAMETERS
- On the stability of computing polynomial roots via confederate linearizations
- Polynomial Roots from Companion Matrix Eigenvalues
- Polynomials with respect to a general basis. I: Theory
- Practical Problems Arising in the Solution of Polynomial Equations
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Stability of rootfinding for barycentric Lagrange interpolants
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
Cited in
(17)- Block Kronecker linearizations of matrix polynomials and their backward errors
- Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems
- A boundary integral equation approach to computing eigenvalues of the Stokes operator
- Backward error analysis of polynomial eigenvalue problems solved by linearization
- On the stability of computing polynomial roots via confederate linearizations
- Fiedler-comrade and Fiedler-Chebyshev pencils
- A class of quasi-sparse companion pencils
- Rank-Structured QR for Chebyshev Rootfinding
- Van Dooren's index sum theorem and rational matrices with prescribed structural data
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
- Revisiting the computation of the critical points of the Keplerian distance
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Finding roots of complex analytic functions via generalized colleague matrices
- Numerical instability of algebraic rootfinders
- Chebyshev varieties
- Parameterizing intersecting surfaces via invariants
- Structured backward errors in linearizations
This page was built for publication: Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970098)
