• 충청수학회지
• /
• 제21권1호
• /
• pp.107-116
• /
• 2008

In this study the k-fold pseudo-Cauchy's method of order k+3 is proposed from the classical Cauchy's method defined by an iteration $x_{n+1}=x_n-{\frac{f^{\prime}(x_n)}{f^{{\prime}{\prime}}(x_n)}}{\cdot}(1-{\sqrt{1-2f(x_n)f^{{\prime}{\prime}}(x_n)/f^{\prime}(x_n)^2}})$. The convergence behavior of the asymptotic error constant is investigated near the corresponding simple zero. A root-finding algorithm with the k-fold pseudo-Cauchy's method is described and computational examples have successfully confirmed the current analysis.