On the distance to the zero set of a homogeneous polynomial

DOI10.1016/0885-064X(89)90027-7zbMath0691.12006OpenAlexW2002420170MaRDI QIDQ582323

Michael Shub

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(89)90027-7

zbMATH Keywords

projective spacezero setalgorithms of Renegar, Canny and Kimcomplex homogeneous polynomialquantitative aspectZulehner algorithm

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Related Items

Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems ⋮ Unnamed Item

Cites Work

• Topological complexity of a root finding algorithm
• A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials

This page was built for publication: On the distance to the zero set of a homogeneous polynomial