An algorithm for computing the roots of a complex polynomial

DOI10.1109/TAC.1987.1104534MaRDI QIDQ4725626zbMATH OpenFDO

Authors John F. Aurand

Publication date 1987

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1987.1104534

zbMATH Keywords

deflation techniqueroots of a complex polynomialstopping rule

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Recommendations

• Finding polynomial roots: A fast algorithm convergent on the complex plane
• On zeros of a complex polynomial
• How to be sure of finding a root of a complex polynomial using Newton's method
• scientific article; zbMATH DE number 3909639
• An efficient algorithm for the complex roots problem

Cited in

(3)

• Finding polynomial roots: A fast algorithm convergent on the complex plane
• Finding the roots of polynomial equations: An algorithm with linear command
• Algorithm for computing the truncation of the discriminant of a polynomial

This page was built for publication: An algorithm for computing the roots of a complex polynomial

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