Finding the roots of polynomial equations: An algorithm with linear command

DOI10.5209/REV_REMA.2000.V13.N2.17074MaRDI QIDQ5933889zbMATH OpenFDO

Authors Bernard Beauzamy

Publication date 2 January 2002

Published in Revista Matemática Complutense (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/44480

zbMATH Keywords

algorithmlinear commandroots of polynomials

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Polynomials in number theory (11C08)

Recommendations

• Finding polynomial roots: A fast algorithm convergent on the complex plane
• On zeros of a complex polynomial
• A parallel algorithm for finding roots of a complex polynomial
• On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
• An algorithm for computing the roots of a complex polynomial

Cited in

(4)

• Probabilistic algorithm for finding roots of linearized polynomials
• Perturbation bounds for polynomials
• Perturbation results on the zero-locus of a polynomial
• On complex Lee and Yang polynomials

This page was built for publication: Finding the roots of polynomial equations: An algorithm with linear command

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