On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
From MaRDI portal
Publication:4728110
DOI10.1287/moor.12.1.121zbMath0618.65038OpenAlexW2124521536MaRDI QIDQ4728110
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.12.1.121
Newton's methodcomplex polynomialsefficiencyquadratic convergencesystem of polynomialshomotopy algorithms
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)
Related Items
On the existence of generally convergent algorithms, Shifted varieties and discrete neighborhoods around varieties, Smooth analysis of the condition number and the least singular value, Optimal solution of nonlinear equations, Average errors for zero finding: Lower bounds for smooth or monotone functions, Computational experience with a dual affine variant of Karmarkar's method for linear programming, The geometry of ill-conditioning, A fully polynomial time projective method, Rudiments of an average case complexity theory for piecewise-linear path following algorithms, Smoothed analysis of complex conic condition numbers, Linear programming, complexity theory and elementary functional analysis, Condition numbers for the cube. I: Univariate polynomials and hypersurfaces, Smale's fundamental theorem of algebra reconsidered, A continuation method to solve polynomial systems and its complexity, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra, The probability that a slightly perturbed numerical analysis problem is difficult, Fast and efficient linear programming and linear least-squares computations, On the volume of tubular neighborhoods of real algebraic varieties, On the distance to the zero set of a homogeneous polynomial, The steepest descent gravitational method for linear programming, Newton's method for overdetermined systems of equations, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions, Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems, On the asymptotic behavior of the projective rescaling algorithm for linear programming, Complexity of Bezout's theorem. VII: Distance estimates in the condition metric, The Probability That a Numerical Analysis Problem is Difficult, Applications of Algebra for Some Game Theoretic Problems, Average case optimality
