Narrow Results

P. Jarratt has developed a family of fourth-order optimal methods. He suggested two members of the family. The dynamics of one of those was discussed previously. Here we show that the family can be written using a weight function and analyze all members of the family to find the best performer.

In this paper, we proposed a new highly efficient two-point sixth-order family of Halley type methods that do not require any second-order derivative evaluation for obtaining simple roots of nonlinear equations, numerically. In terms of computational cost, each member of the family requires two-function and two first-order derivative evaluations per iteration. On the account of the results obtained, it is found that our proposed methods are efficient and show better performance than existing sixth-order methods available in the literature. Further, it is also noted that larger basins of attraction belong to our methods as compared to the existing ones. On the other hand, the existing methods are slower and have darker basins while some of them are too sensitive upon the choice of the initial value.

In this paper, we present a new and interesting optimal scheme of order eight in a general way for solving nonlinear equations, numerically. The beauty of our scheme is that it is capable of producing further new and interesting optimal schemes of order eight from every existing optimal fourth-order scheme whose first substep employs Newton’s method. The construction of this scheme is based on rational functional approach. The theoretical and computational properties of the proposed scheme are fully investigated along with a main theorem which establishes the order of convergence and asymptotic error constant. Several numerical examples are given and analyzed in detail to demonstrate faster convergence and higher computational efficiency of our methods.