A weighted variant family of Newton’s method with accelerated third-order convergence

摘要

An improvement to the iteration of Newton’s method that generalizes previous known improvements of it are presented. A symbolic computation that allows us to find the best coefficients with regard to the local order of convergence is given. Furthermore, a set of functions have been tested and all the methods considered present third theoretical and computational order of convergence.