Remark on Algorithms to Find Roots of Polynomials

DOI10.1137/0915064zbMath0813.65084OpenAlexW2086527157WikidataQ56474085 ScholiaQ56474085MaRDI QIDQ4310891

Stefan Goedecker

Publication date: 21 November 1994

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluesQR algorithmHessenberg matrixroots of a polynomial

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)

Related Items

Finite-temperature evaluation of the Fermi density operator, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗, Polynomial zerofinders based on Szegő polynomials, Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves, On the geometry of Graeffe iteration, Computing real roots of a polynomial in Chebyshev series form through subdivision, Hyman's method revisited, Continuation methods for the computation of zeros of Szegő polynomials, An effective implementation of a modified Laguerre method for the roots of a polynomial