On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials

DOI10.1007/BF01582051zbMath0577.65039MaRDI QIDQ3698168

James Renegar

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

complexity; piecewise linear approximation; roots of complex polynomial

Mathematics Subject Classification ID

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

Some computational methods for systems of nonlinear equations and systems of polynomial equations