American Mathematical Monthly · 1995 · 132 citations · 25 references
ComputingMathematicsComputational GeometryDifferential EquationsGeometryConvergence AnalysisIterative SolversNumerical AlgorithmsConvergenceNewton ConvergenceSecant LinesTangent LinesTangent PlanesTangent Vectors
According to Traub [Tra64], Halley's iteration function (I.F.) must share with the secant I.F. the distinction of being the most frequently rediscovered I.F. in the literature. Halley's method is a close relative of Newton's method, an iterative technique depicted as a sequence of tangent lines with zeros converging to a root of a function. The usual derivation of Halley's method, however, lacks any obvious geometric interpretation. We present a derivation of Halley's method having such an interpretation, and give a brief history of Halley's work and the method that bears his name.
25
Iterative Methods for the Solution of Equations.
David M. Young, J. F. Traub · American Mathematical Monthly · 1967 · 2.2K citations
Historical Development of the Newton–Raphson Method
Tjalling Ypma · SIAM Review · 1995 · 908 citations
A First Course in Chaotic Dynamical Systems: Theory and Experiment
Robert L. Devaney, P. B. Siegel, A. John Mallinckrodt et al. · Computers in Physics · 1993 · 298 citations
A family of root finding methods
Eldon Hansen, Merrell L. Patrick · Numerische Mathematik · 1976 · 233 citations