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

complexitypiecewise linear approximationroots of complex polynomial

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)

Related Items

Optimal solution of nonlinear equations, On the efficiency of algorithms of analysis, Rudiments of an average case complexity theory for piecewise-linear path following algorithms, Some computational methods for systems of nonlinear equations and systems of polynomial equations

Cites Work

• Unnamed Item
• Unnamed Item
• The computation of fixed points and applications
• The fundamental theorem of algebra and complexity theory
• The Solution of Systems of Piecewise Linear Equations