Solving Polynomials with Small Leading Coefficients

DOI10.1137/S0895479899365720MaRDI QIDQ4651001zbMATH OpenFDO

Authors Gudbjorn F. Jonsson, Stephen A. Vavasis

Publication date 21 February 2005

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

Full work available at URL https://doi.org/10.1137/S0895479899365720

zbMATH Keywords

Bézier polynomialcondition numbergeneralized eigenvaluematrix pencilpolynomial rootsstability

Mathematics Subject Classification ID

Matrix pencils (15A22) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05)

Recommendations

• Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
• Polynomial Roots from Companion Matrix Eigenvalues
• scientific article; zbMATH DE number 741163
• On the stability of computing polynomial roots via confederate linearizations
• Backward stability of polynomial root-finding using Fiedler companion matrices

Cited in

(17)

• Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
• Linearizations of matrix polynomials in Bernstein bases
• Implicit QR for companion-like pencils
• On the stability of computing polynomial roots via confederate linearizations
• The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case
• Spectral equivalence of matrix polynomials and the index sum theorem
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Generalized standard triples for algebraic linearizations of matrix polynomials
• Computational Experience with a Modified Newton Solver for Discrete-Time Algebraic Riccati Equations
• Locating the Eigenvalues of Matrix Polynomials
• New progress in real and complex polynomial root-finding
• Equivalences for linearizations of matrix polynomials
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
• Block \(\mathbf {LU}\) factors of generalized companion matrix pencils

Describes a project that uses

Uses Software

• mctoolbox
• Matlab

This page was built for publication: Solving Polynomials with Small Leading Coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651001)