Fast and Backward Stable Computation of Roots of Polynomials
From MaRDI portal
Publication:5265003
DOI10.1137/140983434zbMATH Open1319.65034OpenAlexW1524943583MaRDI QIDQ5265003FDOQ5265003
David S. Watkins, Raf Vandebril, Thomas Mach, Jared Lee Aurentz
Publication date: 21 July 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://nur.nu.edu.kz/handle/123456789/2225
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
eigenvaluenumerical experimentcompanion matrixHessenberg matrixQR algorithmroots of polynomialsFrancis's algorithmGivens rotators
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Numerical computation of polynomial zeros by means of Aberth's method
- An algorithm for computing the eigenvalues of block companion matrices
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- Title not available (Why is that?)
- The Matrix Eigenvalue Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The uniqueness in the inverse problem for transmission eigenvalues for the spherically symmetric variable-speed wave equation
- Polynomial Roots from Companion Matrix Eigenvalues
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Effective fast algorithms for polynomial spectral factorization
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
- Implicit double shift \(QR\)-algorithm for companion matrices
- On the shifted QR iteration applied to companion matrices
- Title not available (Why is that?)
- A fast implicit QR eigenvalue algorithm for companion matrices
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Implicit QR with compression
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix
- Principles for Testing Polynomial Zerofinding Programs
- A CMV-Based Eigensolver for Companion Matrices
- Low rank perturbation of regular matrix polynomials
- On deflations in extended QR algorithms
- Francis’s Algorithm
- Implicit QR for rank-structured matrix pencils
- Differential qd Algorithm with Shifts for Rank-Structured Matrices
Cited In (33)
- Accelerated approximation of the complex roots of a univariate polynomial
- 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
- Structured backward errors in linearizations
- Numerical methods for spectral theory
- A note on generalized companion pencils in the monomial basis
- Extension of Chebfun to Periodic Functions
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Finding roots of complex analytic functions via generalized colleague matrices
- A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
- Structured condition numbers for Sylvester matrix equation with parameterized quasiseparable matrices
- Data Driven Koopman Spectral Analysis in Vandermonde--Cauchy Form via the DFT: Numerical Method and Theoretical Insights
- Spectra of Jacobi operators via connection coefficient matrices
- On the stability of computing polynomial roots via confederate linearizations
- A note on the backward error of the roots of polynomials
- 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 and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- On pole-swapping algorithms for the eigenvalue problem
- Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Factoring Block Fiedler Companion Matrices
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- Title not available (Why is that?)
- SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
Uses Software
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)
