Fast and Backward Stable Computation of Roots of Polynomials
From MaRDI portal
Publication:5265003
Recommendations
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Revisiting the stability of computing the roots of a quadratic polynomial
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- Fast computation of the roots of polynomials over the ring of power series
- On the stability of computing polynomial roots via confederate linearizations
- Accelerated approximation of the complex roots of a univariate polynomial
- scientific article; zbMATH DE number 1421708
- scientific article; zbMATH DE number 3928208
- ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
Cites work
- scientific article; zbMATH DE number 5734462 (Why is no real title available?)
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- A CMV-Based Eigensolver for Companion Matrices
- A fast QR algorithm for companion matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- An algorithm for computing the eigenvalues of block companion matrices
- An implicit multishift \(QR\)-algorithm for Hermitian plus low rank matrices
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Differential qd algorithm with shifts for rank-structured matrices
- Effective fast algorithms for polynomial spectral factorization
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Fast computation of the zeros of a polynomial via factorization of the companion matrix
- Francis’s Algorithm
- Implicit QR for rank-structured matrix pencils
- Implicit QR with compression
- Implicit double shift \(QR\)-algorithm for companion matrices
- Low rank perturbation of regular matrix polynomials
- Numerical computation of polynomial zeros by means of Aberth's method
- On deflations in extended QR algorithms
- On the shifted QR iteration applied to companion matrices
- Polynomial Roots from Companion Matrix Eigenvalues
- Principles for Testing Polynomial Zerofinding Programs
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- The Matrix Eigenvalue Problem
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- The uniqueness in the inverse problem for transmission eigenvalues for the spherically symmetric variable-speed wave equation
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
Cited in
(36)- Accelerated approximation of the complex roots of a univariate polynomial
- SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- Orthogonal iterations on companion-like pencils
- Fast QR iterations for unitary plus low rank matrices
- Backward error measures for roots of polynomials
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Structured backward errors in linearizations
- A note on generalized companion pencils in the monomial basis
- Numerical methods for spectral theory
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Finding roots of complex analytic functions via generalized colleague matrices
- Structured condition numbers for Sylvester matrix equation with parameterized quasiseparable matrices
- Spectra of Jacobi operators via connection coefficient matrices
- Backward stability of polynomial root-finding using Fiedler companion matrices
- On the stability of computing polynomial roots via confederate linearizations
- A fast QR algorithm for companion matrices
- A note on the backward error of the roots of polynomials
- Factoring block Fiedler companion matrices
- Revisiting the stability of computing the roots of a quadratic polynomial
- Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
- Rank-Structured QR for Chebyshev Rootfinding
- On the description and stability of orthogonal transformations of rank structured matrices
- Min-max elementwise backward error for roots of polynomials and a corresponding backward stable root finder
- Fast computation of the zeros of a polynomial via factorization of the companion matrix
- On pole-swapping algorithms for the eigenvalue problem
- Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- Data driven Koopman spectral analysis in Vandermonde-Cauchy form via the DFT: numerical method and theoretical insights
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- scientific article; zbMATH DE number 1421708 (Why is no real title available?)
- Extension of Chebfun to periodic functions
This page was built for publication: Fast and Backward Stable Computation of Roots of Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265003)
