TY - JOUR
TI - Newton's Method and Generation of a Determinantal Family of Iteration Functions
DO - https://doi.org/doi:10.7282/T3280C8M
AU - Kalantari, Bahman
AU - Gerlach, Jürgen
PY - 1998-11
AB - It is well-known that Halley’s method can be obtained by applying Newton’s method to the function f/√ f ′ . Gerlach [3], gives a generalization of this approach, and for each m ≥ 2, recursively defines an iteration function Gm(x) having order m. Kalantari et al. [6], and Kalantari [8] derive and characterize a determinantal family of iteration functions, called the Basic Family, Bm(x), m ≥ 2. In this paper we prove, Gm (x) = Bm (x). On the one hand, this implies that Gm(x) enjoys the previously derived properties of Bm(x), i.e., the closed formula, its efficient computation, an expansion formula which gives its precise asymptotic constant, as well as its multipoint versions. On the other hand, this gives a new insight on the Basic Family and Newton’s method.
KW - Newton-Raphson method
KW - Rootfinding
KW - Polynomial roots
KW - Roots, Numerical
LA - English
ER -