Finding polynomial roots: A fast algorithm convergent on the complex plane

DOI10.1002/CNM.1630010606zbMATH Open0596.65029OpenAlexW2023482463MaRDI QIDQ3729924

Vadim K. Polishchuk, Andrey V. Ivanisov

Publication date: 1985

Published in: Communications in Applied Numerical Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1630010606

zbMATH Keywords

global convergencelocal convergencepolynomial rootsroots of entire functions

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)

Cites Work

• Title not available (Why is that?)

Related Items (4)

Finding cactus roots in polynomial time ⋮ Accelerated approximation of the complex roots of a univariate polynomial ⋮ When Newton meets Descartes ⋮ Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm

This page was built for publication: Finding polynomial roots: A fast algorithm convergent on the complex plane

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