On the stability of computing polynomial roots via confederate linearizations
From MaRDI portal
Publication:2814445
DOI10.1090/mcom3049zbMath1347.65096OpenAlexW2130173851MaRDI QIDQ2814445
Yuji Nakatsukasa, Vanni Noferini
Publication date: 22 June 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: http://repository.essex.ac.uk/15327/1/MIMS_ep2014_49.pdf
eigenvaluelinearizationQR algorithmQZ algorithmJacobi orthogonal polynomialnormwise stabilityroot finding methods for polynomials
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)
Related Items (17)
Block Kronecker linearizations of matrix polynomials and their backward errors ⋮ Structured backward errors in linearizations ⋮ Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems ⋮ Stable polefinding and rational least-squares fitting via eigenvalues ⋮ On the exponential generating function for non-backtracking walks ⋮ Unnamed Item ⋮ Constructing Strong Linearizations of Matrix Polynomials Expressed in Chebyshev Bases ⋮ Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ On generating Sobolev orthogonal polynomials ⋮ Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable? ⋮ Structure-Preserving Function Approximation via Convex Optimization ⋮ Matrices in companion rings, Smith forms, and the homology of 3-dimensional Brieskorn manifolds ⋮ Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization ⋮ A note on generalized companion pencils in the monomial basis ⋮ Fiedler-comrade and Fiedler--Chebyshev pencils ⋮ Rank-Structured QR for Chebyshev Rootfinding
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical computation of polynomial zeros by means of Aberth's method
- Chebyshev interpolation for nonlinear eigenvalue problems
- On orthogonal polynomials with perturbed recurrence relations
- Perturbed recurrence relations
- A note on companion matrices
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Perturbation of the coefficients in the recurrence relation of a class of polynomials
- Backward error and condition of polynomial eigenvalue problems
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Solving secular and polynomial equations: a multiprecision algorithm
- Duality of matrix pencils, Wong chains and linearizations
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Implicit QR for rank-structured matrix pencils
- Stability of rootfinding for barycentric Lagrange interpolants
- Computing real roots of a polynomial in Chebyshev series form through subdivision
- Computing the common zeros of two bivariate functions via Bézout resultants
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Backward stability of polynomial root-finding using Fiedler companion matrices
- Implicit QR for companion-like pencils
- Fast Reduction of Generalized Companion Matrix Pairs for Barycentric Lagrange Interpolants
- Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
- Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
- Fiedler Companion Linearizations and the Recovery of Minimal Indices
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- Algorithm 610: A Portable FORTRAN Subroutine for Derivatives of the Psi Function
- Another Note on the Inclusion L p (μ) ⊂L q (μ)
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving Polynomials with Small Leading Coefficients
- Using Algebraic Geometry
- A fast FFT-based discrete Legendre transform
- Polynomial Roots from Companion Matrix Eigenvalues
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- A CMV-Based Eigensolver for Companion Matrices
- Calculation of Gauss Quadrature Rules
- ON MATRICES DEPENDING ON PARAMETERS
This page was built for publication: On the stability of computing polynomial roots via confederate linearizations
