On the cost of approximating all roots of a complex polynomial
From MaRDI portal
Publication:3698169
DOI10.1007/BF01582052zbMath0577.65040MaRDI QIDQ3698169
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
computational complexity; Newton's method; zeros of polynomials; homotopy algorithm; complex polynomial
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
Related Items
On the geometry of Graeffe iteration, Some computational methods for systems of nonlinear equations and systems of polynomial equations, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], On the complexity of a PL homotopy algorithm for zeros of polynomials, Specified precision polynomial root isolation is in NC