Remark on Algorithms to Find Roots of Polynomials

DOI10.1137/0915064MaRDI QIDQ4310891zbMATH OpenOpenAlexWikidataFDO

Authors 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

eigenvaluesHessenberg matrixQR algorithmroots of a polynomial

Mathematics Subject Classification ID

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

Recommendations

• Polynomial root finding by means of continuation
• Structured matrix methods for polynomial root-finding
• An Algorithm for Solving Polynomial Equations
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• scientific article; zbMATH DE number 842862

Cited in

(18)

• scientific article; zbMATH DE number 1545023 (Why is no real title available?)
• Polynomial zerofinders based on Szegő polynomials
• An effective implementation of a modified Laguerre method for the roots of a polynomial
• Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• Finite-temperature evaluation of the Fermi density operator
• On the geometry of Graeffe iteration
• Continuation methods for the computation of zeros of Szegő polynomials
• On complexity of Boolean matrix polynomials solving
• On K nig's root-finding algorithms*
• The exact root algorithm for computing the real roots of an nth degree polynomial
• scientific article; zbMATH DE number 3881772 (Why is no real title available?)
• Hyman's method revisited
• General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• Polynomial Root-Finding Algorithms and Branched Covers
• Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm

This page was built for publication: Remark on Algorithms to Find Roots of Polynomials

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