A family of Newton type iterative methods for solving nonlinear equations (Q1736714)

Summary: In this paper, a general family of \(n\)-point Newton type iterative methods for solving nonlinear equations is constructed by using direct Hermite interpolation. The order of convergence of the new \(n\)-point iterative methods without memory is \(2^n\) requiring the evaluations of \(n\) functions and one first-order derivative in per full iteration, which implies that this family is optimal according to \textit{H. T. Kung} and \textit{J. F. Traub}'s conjecture [J. Assoc. Comput. Mach. 21, 643--651 (1974; Zbl 0289.65023)]. Its error equations and asymptotic convergence constants are obtained. The \(n\)-point iterative methods with memory are obtained by using a self-accelerating parameter, which achieve much faster convergence than the corresponding \(n\)-point methods without memory. The increase of convergence order is attained without any additional calculations so that the \(n\)-point Newton type iterative methods with memory possess a very high computational efficiency. Numerical examples are demonstrated to confirm theoretical results.