scientific article; zbMATH DE number 4032923

MaRDI QIDQ3773185zbMATH OpenFDO

Authors Alexis Marin

Publication date 1987

Full work available at URL http://www.numdam.org/item?id=SB_1986-1987__29__19_0, https://eudml.org/doc/110079

zbMATH Keywords

computational efficiencyNewton's methodpolynomial equations

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) 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) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Smale's fundamental theorem of algebra reconsidered
• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• The complexity and geometry of numerically solving polynomial systems
• scientific article; zbMATH DE number 3846748
• On generalized Newton algorithms: Quadratic convergence, path-following and error analysis

Cited in

(3)

• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• scientific article; zbMATH DE number 503395 (Why is no real title available?)
• Functional norms, condition numbers and numerical algorithms in algebraic geometry

This page was built for publication:

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