Solving Polynomials with Small Leading Coefficients
From MaRDI portal
Publication:4651001
DOI10.1137/S0895479899365720zbMath1101.12005MaRDI QIDQ4651001
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)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05) Matrix pencils (15A22)
Related Items
Linearizations of matrix polynomials in Bernstein bases, Computational Experience with a Modified Newton Solver for Discrete-Time Algebraic Riccati Equations, Accurate solution of polynomial equations using Macaulay resultant matrices, Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding, Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil, Spectral equivalence of matrix polynomials and the index sum theorem, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Generalized Standard Triples for Algebraic Linearizations of Matrix Polynomials, Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values, The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case, Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials, New progress in real and complex polynomial root-finding, Block \(\mathbf {LU}\) factors of generalized companion matrix pencils, Implicit QR for companion-like pencils, On the stability of computing polynomial roots via confederate linearizations
Uses Software
