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

DOI10.1016/0885-064X(89)90005-8zbMath0675.65036MaRDI QIDQ1122311

James H. Curry

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

Halley's methoditerative methodsanalytic functionshigher order convergencezero findingschlicht-function

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (12)

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

Cites Work

• Unnamed Item
• Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• On the efficiency of algorithms of analysis
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• The fundamental theorem of algebra and complexity theory

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