On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials

DOI10.1287/MOOR.12.1.121zbMATH Open0618.65038OpenAlexW2124521536MaRDI QIDQ4728110FDOQ4728110

Authors: James Renegar

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

Recommendations

On the efficiency of some combined methods for polynomial complex zeros
On the efficient global dynamics of Newton’s method for complex polynomials
On the number of iterations of Newton's method for complex polynomials
On the speed of convergence of Newton's method for complex polynomials
On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
Some properties of Newton's method for polynomials with all real zeros
Newton's method as a dynamical system: Efficient root finding of polynomials and the Riemann \(\zeta\)-function
scientific article; zbMATH DE number 1003257
On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
On the improved Newton-like methods for the inclusion of polynomial zeros

zbMATH Keywords

efficiency Newton's method quadratic convergence complex polynomials homotopy algorithms system of polynomials

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)

Cited In (32)

Shifted varieties and discrete neighborhoods around varieties
The Probability That a Numerical Analysis Problem is Difficult
Smale's fundamental theorem of algebra reconsidered
A continuation method to solve polynomial systems and its complexity
A fully polynomial time projective method
Rudiments of an average case complexity theory for piecewise-linear path following algorithms
Newton's method for overdetermined systems of equations
Newton's method and the computational complexity of the fundamental theorem of algebra
Fast and efficient linear programming and linear least-squares computations
On the distance to the zero set of a homogeneous polynomial
The steepest descent gravitational method for linear programming
Average errors for zero finding: Lower bounds for smooth or monotone functions
Smoothed analysis of complex conic condition numbers
The probability that a slightly perturbed numerical analysis problem is difficult
Computational experience with a dual affine variant of Karmarkar's method for linear programming
Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
Some properties of Newton's method for polynomials with all real zeros
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
Computational complexity of kernel-based density-ratio estimation: a condition number analysis
Smooth analysis of the condition number and the least singular value
Smale's 17th problem: average polynomial time to compute affine and projective solutions
On the asymptotic behavior of the projective rescaling algorithm for linear programming
Applications of Algebra for Some Game Theoretic Problems
Optimal solution of nonlinear equations
The geometry of ill-conditioning
On the existence of generally convergent algorithms
Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
Random Polynomials and Approximate Zeros of Newton’s Method
Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
Linear programming, complexity theory and elementary functional analysis
On the volume of tubular neighborhoods of real algebraic varieties
Average case optimality

This page was built for publication: On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728110)