• 충청수학회지
• /
• 제22권2호
• /
• pp.217-227
• /
• 2009

Assuming that a given nonlinear function f : $\mathbf{R}{\rightarrow}\mathbf{R}$ has a zero $\alpha$with integer multiplicity $m{\geq}1$ and is sufficiently smooth in a small neighborhood of $\alpha$, we define extended leap-frogging Newton's method. We investigate the order of convergence and the asymptotic error constant of the proposed method as a function of multiplicity m. Numerical experiments for various test functions show a satisfactory agreement with the theory presented in this paper and are throughly verified via Mathematica programming with its high-precision computability.