A universal constant for the convergence of Newton's method and an application to the classical homotopy method

DOI10.1007/BF02141589zbMath0835.65075MaRDI QIDQ1895870

Jean-Claude Yakoubsohn

Publication date: 13 August 1995

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

convergenceNewton's methodnumerical examplessystems of polynomial equationshomotopy methodKantorovich theoremballs of convergence

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)

Related Items (5)

A fast Chebyshev's method for quadratic equations. ⋮ Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods ⋮ An adaptive version of a fourth-order iterative method for quadratic equations ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• Some tests of generalized bisection
• The fundamental theorem of algebra and complexity theory
• Complexity of Bezout's Theorem I: Geometric Aspects

This page was built for publication: A universal constant for the convergence of Newton's method and an application to the classical homotopy method