A generalization of Newton‐Raphson

Abstract

It is shown that the Newton‐Raphson iteration for nonlinear equations can be considered as a member of a general one‐parameter family of second‐order methods. Variation of the parameter can greatly increase the speed of convergence, and a criterion for choosing the optimal parameter is derived. Finally, a conjecture is proposed on the question of convergence from any initial value.