On zero finding methods of higher order from data at one point

DOI10.1016/0885-064X(89)90005-8MaRDI QIDQ1122311zbMATH OpenFDO

Authors James H. Curry

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)90005-8

zbMATH Keywords

analytic functionsHalley's methodhigher order convergenceiterative methodsschlicht-functionzero finding

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Review text

The author generalizes to higher order methods the approach of \textit{S. Smale} [The merging of disciplines in pure, applied and computational mathematics 185-196 (1986; Zbl 0613.65058)] for the convergence analysis of iterative methods for analytic functions based on data at one point. A particular aim is here to avoid the need for schlicht-function assumptions. Two examples of cubically convergent methods are given one of which is Halley's method.

Recommendations

• Accelerated Convergence in Newton’s Method
• scientific article; zbMATH DE number 562891
• A class of simultaneous methods for the zeros of analytic functions
• Higher-order iterative methods for approximating zeros of analytic functions
• scientific article; zbMATH DE number 4048919

Cites work

• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• scientific article; zbMATH DE number 3476451 (Why is no real title available?)
• Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
• On the efficiency of algorithms of analysis
• The fundamental theorem of algebra and complexity theory

Cited in

(12)

• Unified complexity analysis for Newton LP methods
• On the convergence of Wang-Zheng's method
• The convergence of a family of parallel zero-finding methods
• A new fourth-order family of simultaneous methods for finding polynomial zeros
• Point estimation of a family of simultaneous zero-finding methods
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• Approximate Zeros of Quadratically Convergent Algorithms
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• On the guaranteed convergence of the square-root iteration method
• The guaranteed convergence of Laguerre-like method
• On the convergence condition of generalized root iterations for the inclusion of polynomial zeros

This page was built for publication: On zero finding methods of higher order from data at one point

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