A Two-Dimensional Variant of Newton’s Method and a Three-Point Hermite Interpolation: Fourth- and Eighth-Order Optimal Iterative Schemes

Abstract

A nonlinear equation $f\left(x\right)=0$ is mathematically transformed to a coupled system of quasi-linear equations in the two-dimensional space. Then, a linearized approximation renders a fractional iterative scheme $x_{n+1}=x_n-f\left(x_n\right)/[a+bf\left(x_n\right)]$, which requires one evaluation of the given function per iteration. A local convergence analysis is adopted to determine the optimal values of a and b. Moreover, upon combining the fractional iterative scheme to the generalized quadrature methods, the fourth-order optimal iterative schemes are derived. The finite differences based on three data are used to estimate the optimal values of a and b. We recast the Newton iterative method to two types of derivative-free iterative schemes by using the finite difference technique. A three-point generalized Hermite interpolation technique is developed, which includes the weight functions with certain constraints. Inserting the derived interpolation formulas into the triple Newton method, the eighth-order optimal iterative schemes are constructed, of which four evaluations of functions per iteration are required.

1. Introduction

In the paper, we develop several novel iterative schemes to solve the nonlinear equation:

$$f\left(x\right)=0,$$

(1)

which is frequently occurred in engineering and scientific applications. For solving Equation (1),

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)}$$

(2)

is a well-known Newton iterative method. A lot of methods were modified from the Newton iterative method [1,2,3,4,5,6,7,8], and they are effective to solve nonlinear equations. We are going to replace $f^{\prime }\left(x_n\right)$ in the denominator of Equation (2) by a linear function of $f\left(x_n\right)$, like as $a+bf\left(x_n\right)$ for some constants a and b. In doing so, a major drawback of the sensitivity to the initial guess of the Newton iterative method can be avoided, and at the same time, a major advantage is that $f^{\prime }\left(x_n\right)$ is no longer needed.

The iterative schemes in [2,9,10,11,12,13,14] were based on the quadratures, which are of two-step-type iterative schemes with third-order convergence, needing the first Newton step to generate a trial solution, and then a correction at the second step by some quadrature rules. Our fractional iterative scheme is of the one-step type and also of the third-order convergence, which saves much computation of function per iteration.

Weerakoon and Fernando [2] resorted to a trapezoidal quadrature rule to derive an arithmetic mean Newton method with third-order convergence of the iterative scheme. After that, third-order iterative schemes based on different quadrature methods were developed in [9,10,11,12,15,16], of which the evaluations of $[f\left(x_n\right),f^{\prime }\left(x_n\right),f^{\prime }\left({\widehat{x}}_n\right)]$ with ${\widehat{x}}_n=x_n-f\left(x_n\right)/f^{\prime }\left(x_n\right)$ are required per iteration. They have the same order $p=3$ and have the same efficiency index (E.I.)$=p^{1/m}=1.44225$. However, the optimal order and efficiency index of the iterative scheme based on $[f\left(x_n\right),f^{\prime }\left(x_n\right),f^{\prime }\left({\widehat{x}}_n\right)]$ are $p=2^{m-1}=4$ and E.I. = 1.5874, according to the conjecture of Kung and Traub [17].

For the fourth-order optimal iterative scheme (FOIS) with $[f\left(x_n\right),f^{\prime }\left(x_n\right),f\left({\widehat{x}}_n\right)]$ performing at each iteration, there were many methods [1,17,18,19,20,21,22,23,24,25,26,27,28,29]. Recently, Liu and Liu [30] derived a double-weight function technique to derive the FOIS. The iterative schemes using difference modifications of Potra-Ptak’s method with optimal fourth and eighth orders of convergence were performed by Cordero et al. [31]. However, the two-step FOIS based on $[f\left(x_n\right),f^{\prime }\left(x_n\right),f^{\prime }\left({\widehat{x}}_n\right)]$ is not yet developed. We are going to propose a simple method based on generalized quadratures to derive the FOIS, which is the optimal combination of two third-order iterative schemes to be developed in the paper.

Besides the quadratures and the finite difference approximation as used in the Ostrowski method and its modifications in [32,33,34,35,36], the function interpolation technique is often used to generate the high-order iterative scheme. Data interpolation is a mathematical process to construct the interpolant from the given data, of which the differential at each point is inserted to set up the Hermite interpolant, which was used in higher-order iterative schemes [30,37,38,39,40,41,42,43]. Also the three-point generalized Hermite interpolation techniques, and a new class of three-step eighth-order optimal iterative schemes (EOIS) is constructed in the paper, which involves four evaluations of functions that are optimal in the sense of Kung and Traub.

Previously, Zhanlav et al. [44] used the generating function method for constructing new EOIS iterations, by which our technique is quite different.

The scalar equation obtained in the engineering application is usually an implicit function of the unknown variable. For instance, the target equation used in the shooting method to solve the nonlinear boundary value problem is an implicit equation with $f\left(x\right)$ being an implicit function of x, and under this situation, it is hard to obtain the derivative term $f^{\prime }\left(x\right)$. When the Newton iterative method cannot be applied to solve this sort problem, the proposed fractional iterative schemes have an advantage to solve this type of problem without using $f^{\prime }\left(x\right)$.

The paper is organized as follows. A two-dimensional variant of Newton’s iterative method is developed in Section 2. We derive a fractional iterative scheme, whose convergence criterion is proven. The convergence behavior analysis of the fractional iterative scheme is carried out in Section 3. We verify the performance of the proposed iterative schemes in Section 4 by computing several numerical examples. In Section 5, we combine the fractional iterative scheme to the quadrature methods to generate the FOIS. We reduce the fractional iterative schemes to some derivative-free iterative schemes in Section 6, and the convergence is identified. The Hermite interpolation is introduced in Section 7, and a three-point interpolation formula is derived. The results are used in Section 8 to derive the three-point generalized Hermite interpolations. In Section 9, we construct the EOIS by using the weight functions obtained from the three-point generalized Hermite interpolations, and examples are given. Finally, we draw the conclusions in Section 10. The abbreviations are listed in the Abbreviations.

2. Two-Dimensional Generalization of Newton’s Method

To motivate the present study, we begin with

$$\begin{array}{ccc}\hfill & & f^{\prime }\left(x_n\right)=f^{\prime }\left(r\right)+f^{″}\left(r\right)(x_n-r)+\cdots ,\hfill \end{array}$$

(3)

$$\begin{array}{ccc}\hfill & & f\left(x_n\right)=f^{\prime }\left(r\right)(x_n-r)+\cdots ,\hfill \end{array}$$

(4)

where r is a simple solution of $f\left(x\right)=0$ with $f\left(r\right)=0$ and $f^{\prime }\left(r\right)\ne 0$. Inserting Equation (3) for $f^{\prime }\left(x_n\right)$ into Equation (2) and using $x_n-r=f\left(x_n\right)/f^{\prime }\left(r\right)$ derived from Equation (4) with higher-order terms being neglected yields

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(r\right)+\frac{f^{″}\left(r\right)}{f^{\prime }\left(r\right)}f\left(x_n\right)}.$$

(5)

This iterative scheme is a variant near to the Newton iterative scheme (2). We will prove that the iterative scheme (5), like Equation (2), is quadratically convergent as to be stated by Theorem 3 in Section 3. Below we will derive an iterative scheme with a similar form to Equation (5), but it is cubically convergent, rather than the quadratic convergence of Equation (5).

When a new variable is defined by

$$y:=f\left(x\right)=g\left(x\right)x,$$

(6)

where we suppose that $f\left(x\right)$ can be decomposed as $f\left(x\right)=g\left(x\right)x,x\ne 0$, from Equation (6) the following identity holds:

$$y-g\left(x\right)x=0.$$

(7)

By Equations (1) and (7), we have

$$\begin{array}{ccc}\hfill & & ax+y=ax,\hfill \end{array}$$

(8)

$$\begin{array}{ccc}\hfill & & \left[w\right(x)-1]g\left(x\right)x+y=w\left(x\right)g\left(x\right)x,\hfill \end{array}$$

(9)

where a is an accelerating parameter and $w\left(x\right)$ is a splitting function to be discussed below. While $ax$ is added on both sides of the equation $y=0$ in Equation (8), we add $w\left(x\right)g\left(x\right)x$ on both sides of Equation (7) to render Equation (9). Herein, the problem of finding the solution of Equation (1) is mathematically transformed to a coupled system of quasi-linear Equations (8) and (9) in the two-dimensional space $(x,y)$.

The splitting technique of $-g\left(x\right)x=-(1-w+w)g\left(x\right)x$ in Equation (9) is used to solve Equation (1) in [45]. Then, Liu et al. [46] proposed a derivative-free iterative scheme using $f\left(x\right)=g\left(x\right)x+Ax-B=0$. We further carry out a theoretical analysis in the two-dimensional space directly for $f\left(x\right)=g\left(x\right)x=0$.

When $(x_n,y_n)$ is obtained at the nth step, the linearizations around $x_n$ for Equations (8) and (9) are

$$\begin{array}{ccc}\hfill & & ax+y=a{x}_n,\hfill \end{array}$$

(10)

$$\begin{array}{ccc}\hfill & & (w_n-1)g_{n}x+y=w_n{g}_n{x}_n,\hfill \end{array}$$

(11)

which are two-dimensional linear system for $(x,y)$. We take $g_n=g\left(x_n\right)$ and $w_n=w\left(x_n\right)$ for shorting the notations.

From Equations (10) and (11), we can obtain $(x_{n+1},y_{n+1})$ at the next step by

$$\left[\begin{array}{c}{x}_{n+1}\\ y_{n+1}\end{array}\right]={\left[\begin{array}{cc}a& 1\\ (w_n-1)g_n& 1\end{array}\right]}^{-1}\left[\begin{array}{c}a{x}_n\\ w_n{g}_n{x}_n\end{array}\right],$$

which renders

$$\begin{array}{ccc}\hfill & & x_{n+1}=\frac{a{x}_n-w_n{g}_n{x}_n}{a+(1-w_n)g_n},\hfill \end{array}$$

(12)

$$\begin{array}{ccc}\hfill & & y_{n+1}=\frac{a{g}_n{x}_n}{a+(1-w_n)g_n}=\frac{a{y}_n}{a+(1-w_n)g_n}.\hfill \end{array}$$

(13)

Both the nominator and denominator on the right-hand side of Equation (12) are multiplied by $x_n$, and using Equation (6), it can be refined to

$$x_{n+1}=x_n-\frac{f\left(x_n\right)x_n}{a{x}_n+(1-w_n)f\left(x_n\right)}.$$

(14)

Remark 1. 

Mathematically, after adding $ax-w\left(x\right)f\left(x\right)$ on both sides, Equation (1) is equivalent to

$$ax+f\left(x\right)-w\left(x\right)f\left(x\right)=ax-w\left(x\right)f\left(x\right),$$

which is then multiplied by x,

$$[ax+f\left(x\right)-w\left(x\right)f\left(x\right)]x=a{x}^2-w\left(x\right)f\left(x\right)x.$$

If $x_n$ is already known, we can seek the next $x_{n+1}$ by

$$x_{n+1}=\frac{a{x}_n^2-w\left(x_n\right)f\left(x_n\right)x_n}{a{x}_n+f\left(x_n\right)-w\left(x_n\right)f\left(x_n\right)}=x_n-\frac{f\left(x_n\right)x_n}{a{x}_n+f\left(x_n\right)-w\left(x_n\right)f\left(x_n\right)}.$$

(15)

Upon taking the same notation with $w_n=w\left(x_n\right)$, Equation (15) goes back to Equation (14). However, this one-dimensional approach cannot generate Equation (13); without setting the problem $f\left(x\right)=0$ in the two-dimensional space $(x,y)$ as carried out in Equations (8) and (9), it is hard to determine a and $w\left(x\right)$, and this proves Theorem 1 given below.

We are going to show that without resorting on the derivative term, the third-order convergence of the iterative scheme can also be realized. Our aim is reducing the number of function evaluations to one per iteration, without using the derivative term to maintain the order of convergence to be three.

Letting

$$1-w_n=b{x}_n,$$

(16)

where b is a constant, we can cancel $x_n$ in the fractional term of Equation (14), and with the aid of Equation (16), we can achieve

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{a+bf\left(x_n\right)},$$

(17)

which, including two constant parameters a and b, is a novel iterative scheme to solve Equation (1). For use in the later, the iterative scheme (17) is called a fractional iterative scheme.

Theorem 1. 

For solving $f\left(x\right)=0$, the iterative scheme (17) is convergent, if

$$f^2\left(x_n\right)+2abf\left(x_n\right)>0.$$

(18)

A finer criterion is

$$\frac{bf\left(x_n\right)}{a}>0,or\frac{bf\left(x_n\right)}{a}<-2.$$

(19)

Proof. 

In Equation (13), $y_{n+1}$ is replaced by $f\left(x_{n+1}\right)$ and $y_n$ is replaced by $f\left(x_n\right)$. In view of Equations (6) and (16), we have

$$f\left(x_{n+1}\right)=\frac{af\left(x_n\right)}{a+bf\left(x_n\right)}.$$

(20)

Let

$${\xi }_n:=\frac{a}{a+bf\left(x_n\right)}$$

be a contraction factor. By Equation (18), we have

$$f^2\left(x_n\right)+2abf\left(x_n\right)>0\Rightarrow \left|{\xi }_n\right|<1,$$

(21)

which implies a strictly monotonically decreasing sequence of

$$|f\left(x_{n+1}\right)|<|f\left(x_n\right)|.$$

(22)

Hence, the absolute convergence of the iterative scheme (17) was proved. Equation (20) can be written as

$$f\left(x_{n+1}\right)=\frac{f\left(x_n\right)}{1+\frac{bf\left(x_n\right)}{a}}.$$

(23)

If the criterion in Equation (19) is satisfied, from Equation (23), we can derive the inequality in Equation (22). The proof is completed. □

Remark 2. 

Although we have made a decomposition of $f\left(x\right)=xg\left(x\right)$ in Equation (6), the final results in Equations (17) and (20) are independent to $g\left(x\right)$. However, the decomposition technique in Equation (6) can help us to derive the two-dimensional approach to the Newton method and the fractional iterative scheme.

3. Convergence Analysis of Fractional Iterative Scheme

The convergence analysis of Equation (17) is given below.

Theorem 2. 

The iterative scheme (17) for solving $f\left(x\right)=0$ has third-order convergence, with the parameters given by

$$a=f^{\prime }\left(r\right),b=\frac{f^{″}\left(r\right)}{2f^{\prime }\left(r\right)}.$$

(24)

Proof. 

For the proof of convergence, let r be a simple solution of $f\left(x\right)=0$, i.e., $f\left(r\right)=0$ and $f^{\prime }\left(r\right)\ne 0$. Thus, by giving

$$e_n=x_n-r,$$

it follows that

$$\begin{array}{ccc}\hfill & & e_{n+1}=e_n+x_{n+1}-x_n,\hfill \end{array}$$

(25)

$$\begin{array}{ccc}\hfill & & f\left(x_n\right)=f^{\prime }\left(r\right)[e_n+c_2{e}_n^2+c_3{e}_n^3+c_4{e}_n^4+\cdots ],\hfill \end{array}$$

(26)

where

$$c_k:=\frac{f^{\left(k\right)}\left(r\right)}{k!f^{\prime }\left(r\right)},k=2,3,\dots .$$

Inserting Equation (26) into Equation (17) yields

$$\frac{f\left(x_n\right)}{a+bf\left(x_n\right)}=\frac{e_n+c_2{e}_n^2+c_3{e}_n^3+c_4{e}_n^4+\cdots }{1+b{e}_n+b{c}_2{e}_n^2+b{c}_3{e}_n^3+\cdots }=e_n+D_2{e}_n^2+D_3{e}_n^3+D_4{e}_n^4+\cdots ,$$

(27)

where we have used the first one in Equation (24), and $D_2$, $D_3$ and $D_4$ are given by

$$\begin{array}{ccc}\hfill & & D_2=c_2-b,\hfill \\ & & D_3=c_3-2c_{2}b+b^2,\hfill \\ & & D_4=2b^2{c}_2-b{c}_3+c_2(b^2-b{c}_2)-c_{3}b+c_4-b^3.\hfill \end{array}$$

(28)

Inserting Equation (27) into Equation (17) and using Equation (25) yields

$$e_{n+1}=e_n-e_n-D_2{e}_n^2-D_3{e}_n^3-D_4{e}_n^4-\cdots =-D_2{e}_n^2-D_3{e}_n^3-D_4{e}_n^4-\cdots .$$

(29)

If $b=c_2$ holds as that given in second one in Equation (24), we have

$$D_2=0,D_3=c_3-c_2^2,D_4=c_2^3-2c_2{c}_3+c_4,$$

and at the same time, Equation (29) reduces to

$$e_{n+1}=(c_2^2-c_3)e_n^3+\mathcal{O}\left(e_n^4\right).$$

(30)

Equation (30) indicates the third-order convergence. □

Theorem 3. 

The iterative scheme (5) for solving $f\left(x\right)=0$ has second-order convergence.

Proof. 

Upon comparing to Equation (17), the parameters in Equation (5) are given by

$$a=f^{\prime }\left(r\right),b=\frac{f^{″}\left(r\right)}{f^{\prime }\left(r\right)}.$$

Inserting b into $D_2$ in Equation (28) yields

$$D_2=c_2-\frac{f^{″}\left(r\right)}{f^{\prime }\left(r\right)}=\frac{f^{″}\left(r\right)}{2f^{\prime }\left(r\right)}-\frac{f^{″}\left(r\right)}{f^{\prime }\left(r\right)}=-\frac{f^{″}\left(r\right)}{2f^{\prime }\left(r\right)}\ne 0.$$

By Equation (29),

$$e_{n+1}=e_n-e_n-D_2{e}_n^2-D_3{e}_n^3-D_4{e}_n^4-\cdots =\frac{f^{″}\left(r\right)}{2f^{\prime }\left(r\right)}{e}_n^2+\mathcal{O}\left(e_n^3\right)$$

proves this theorem. □

In practice, the iterative scheme (5) is a variant of the Newton iterative scheme (2). Both orders of convergence are two.

Notice that the Newton method (2) is a single-point second-order optimal iterative scheme, with two function operations of $f\left(x_n\right)$ and $f^{\prime }\left(x_n\right)$. Halley [47] derived the following extension of the Newton method to a third-order iterative scheme:

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)-f\left(x_n\right)\frac{f^{″}\left(x_n\right)}{2f^{\prime }\left(x_n\right)}}.$$

(31)

However, because it needs three function operations on $f\left(x_n\right)$, $f^{\prime }\left(x_n\right)$ and $f^{″}\left(x_n\right)$, it is not an optimal iterative scheme. Besides the Halley method, there are many two-point iterative schemes which are of third-order convergence. Liu and Lee [48] generalized many quadrature-type third-order iterative schemes to

$$\begin{array}{ccc}\hfill & & y_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},{\eta }_n=\frac{f^{\prime }\left(x_n\right)}{f^{\prime }\left(y_n\right)}-1,\hfill \\ & & x_{n+1}=x_n-W\left({\eta }_n\right)\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},W\left(0\right)=1,W^{\prime }\left(0\right)=-\frac{1}{2},\left|W^{″}\left(0\right)\right|<\infty .\hfill \end{array}$$

(32)

Based on three function operations of $f\left(x_n\right)$, $f^{\prime }\left(x_n\right)$ and $f^{\prime }\left(y_n\right)$, Equation (32) is not an optimal iterative scheme. It is interesting that upon comparing Equation (31) to Equation (17), these two iterative schemes are the same if we take $a=f^{\prime }\left(x_n\right)$ and $b=-f^{″}\left(x_n\right)/\left(2f^{\prime }\left(x_n\right)\right)$. But merely with a and b given by Equation (24), the iterative scheme (17) is of third-order convergence. It must be emphasized that we do not need $f^{\prime }\left(x_n\right)$, $f^{″}\left(x_n\right)$ and two-point operation to achieve the third-order convergence. Therefore, the key issue of Equations (17) and (24) is that we need to give a precise estimation of a and b, without using the information from $f^{\prime }\left(r\right)$ and $f^{″}\left(r\right)$.

4. Numerical Verifications

Some examples are used to evaluate the iterative scheme (17), which is subjected to the convergence criteria:

$$|x_{n+1}-x_n|<\epsilon \mathrm{and}|f\left(x_n\right)|<\epsilon .$$

We fix $\epsilon ={10}^{-15}$ for all numerical tests. The numerically computed order of convergence (COC) is defined in [2]:

$$\mathrm{COC}:=\frac{ln|(x_{n+1}-r)/(x_n-r)|}{ln|(x_n-r)/(x_{n-1}-r)|},$$

(33)

where $f\left(r\right)=0$.

The presently computed results are compared to those obtained by the Newton method (NM), the Halley method (HM) [47] in Equation (31) and the method of Li (LM) [18]:

$${\widehat{x}}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},x_{n+1}=x_n-\frac{f\left(x_n\right)[f\left(x_n\right)-f\left({\widehat{x}}_n\right)]}{f^{\prime }\left(x_n\right)[f\left(x_n\right)-2f\left({\widehat{x}}_n\right)]}.$$

(34)

The orders of convergence for the NM, HM and LM are two, three and four, respectively.

We first use the following example:

$$f\left(x\right)=x^3-\frac{1}{2}{x}^2-\frac{7}{2}x+3=0,$$

(35)

to present the monotonically decreasing sequence of $f\left(x_n\right)$, which is generated by the method in Equation (17). The parameters a and b are specified, not that given by Equation (24).

There are three solutions $r=-2$, $r=1$ and $r=1.5$ of Equation (35). We consider four cases:

$$\begin{array}{ccc}\hfill & & \left(\mathrm{a}\right)x_0<0,f\left(x_0\right)<0,a>0,b<0,\hfill \\ \hfill & & \left(\mathrm{b}\right)x_0<0,f\left(x_0\right)>0,a>0,b<0,\hfill \\ \hfill & & \left(\mathrm{c}\right)x_0>0,f\left(x_0\right)<0,a<0,b<0,\hfill \\ \hfill & & \left(\mathrm{d}\right)x_0>0,f\left(x_0\right)>0,a>0,b>0.\hfill \end{array}$$

We take $x_0=-3$, $a=10.5$ and $b=-0.619$ for (a); $x_0=-1$, $a=10.5$ and $b=-0.619$ for (b); $x_0=1.1$, $a=-1.5$ and $b=-1.66$ for (c); $x_0=2.5$, $a=1.75$ and $b=1.8$ for (d). Cases (a) and (b) tend to the solution $r=-2$; case (c) tends to $r=1$; and case (d) tends to $r=1.5$.

Due to the monotonically decreasing sequence of $f\left(x_n\right)$, all the COCs are near to the third-order and they converge very fast. In the last column of

Table 1. For Equation (35), showing the monotonically decreasing sequence of $f\left(x_n\right)$ with respect to the number n of steps and the COC for different cases and listing the number of iterations (NI) of present method. The last column is the NI of LM.

n	0	1	2	3	4	5	COC	NI	LM
(a)	−18	−1.9558	$-1.3362\times {10}^{-2}$	$-5.4058\times {10}^{-9}$	0	×	3.01	4	6
(b)	5	2.7588	0.1148	$4.1074\times {10}^{-6}$	0	×	3.03	4	6
(c)	−0.1240	$-6.2336\times {10}^{-3}$	$-5.5696\times {10}^{-7}$	$-1.7764\times {10}^{-15}$	0	×	2.94	4	4
(d)	6.75	2.0947	0.3115	$2.6840\times {10}^{-4}$	$-1.9952\times {10}^{-8}$	0	2.98	5	5

, we list the NIs by using the LM of [18]. Starting from the same initial values, for the first two cases, the scheme (17) is convergent slightly faster than the LM. As mentioned by Li [18], the iterative scheme (34) requires two evaluations of the function and one first-order derivative per iteration. Therefore, the scheme (17) with one evaluation of the function saves much of the computational cost.

Other test examples are given by

$$\begin{array}{ccc}\hfill & & f_1\left(x\right)=exp(x^2+7x-30)-1,\hfill \end{array}$$

(36)

$$\begin{array}{ccc}\hfill & & f_2\left(x\right)=x^3+4x^2-10,\hfill \end{array}$$

(37)

$$\begin{array}{ccc}\hfill & & f_3\left(x\right)=x{e}^{x^2}-{sin}^{2}x+3cosx+5,\hfill \end{array}$$

(38)

$$\begin{array}{ccc}\hfill & & f_4\left(x\right)=|x^2-9|.\hfill \end{array}$$

(39)

Table 2. For $f_i\left(x\right)=0,i=1,\dots ,4$, listing $x_0$, a and b and the NIs of present method. The last two columns are the NIs of NM and HM.

$\mathit{f}=0$	${\mathit{x}}_0$	a	b	Present NI	NI (NM)	NI (HM)
$f_1=0$	4	13	2	7	20	11
$f_2=0$	−0.3	16.5134	0.49	6	55	142
$f_3=0$	−2	20.307	−1	6	9	6
$f_4=0$	3.2	6	0.2	4	×	×

lists $x_0$, a and b and the NIs for different methods. We can observe that the present iterative scheme converges faster than the NM and HM. NM and HM are not good for the solution of $f_2\left(x\right)=0$ with a worse initial guess $x_0=-0.3$, and cannot be applied to solve $f_4\left(x\right)=0$ in Equation (39).

5. Fourth-Order Optimal Iterative Schemes

Now, we propose some new FOIS by a constantly weighting combination of the third-order iterative schemes from Equations (17) and (24), as well as the following one. Before that, we cite the following result [48].

Lemma 1. 

The following two-step iterative scheme has third-order convergence:

$$x_{n+1}=x_n-W\left({\eta }_n\right)\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},$$

(40)

where W satisfies

$$W\left(0\right)=1,W^{\prime }\left(0\right)=-\frac{1}{2},\left|W^{″}\left(0\right)\right|<\infty .$$

Here,

$${\widehat{x}}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},{\eta }_n:=\frac{f^{\prime }\left({\widehat{x}}_n\right)}{f^{\prime }\left(x_n\right)}-1.$$

The error equation reads as

$$e_{n+1}=\left(2[1-W^{″}\left(0\right)]c_2^2+\frac{c_3}{2}\right)e_n^3+\mathcal{O}\left(e_n^4\right).$$

(41)

Proof. 

The proof can refer to [48]. □

Theorem 4. 

The following iterative scheme as an optimal combination of Equations (17) and (40):

$$x_{n+1}=x_n-\frac{w_{1}f\left(x_n\right)}{a+bf\left(x_n\right)}-w_{2}W\left({\eta }_n\right)\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)}$$

(42)

is of fourth-order convergence, where $W\left(0\right)=1$, $W^{\prime }\left(0\right)=-1/2$, $W^{″}\left(0\right)=\alpha$, and

$$w_1=\frac{1}{3},w_2=\frac{2}{3},\alpha =\frac{5}{4}.$$

(43)

Proof. 

The combination of Equations (17) and (40) is given by Equation (42), whose weighting factors $w_1$ and $w_2$ are subjected to

$$w_1+w_2=1.$$

(44)

Then, we consider the weighting combination of the error equations in Equations (30) and (41), such that the combined coefficient preceding $e_n^3$ is zero:

$$w_1(c_2^2-c_3)+w_2\left(2[1-\alpha ]c_2^2+\frac{c_3}{2}\right)=0\Rightarrow w_1(c_2^2-c_3)-\frac{w_2}{2}[(4\alpha -4)c_2^2-c_3]=0.$$

(45)

Equation (45) leads to

$$4\alpha -4=1,w_1-\frac{w_2}{2}=0.$$

(46)

Solving Equations (44) and (46), we can derive Equation (43). Thus, the error equation of the optimally combined iterative scheme in Equation (42) is

$$e_{n+1}=\mathcal{O}\left(e_n^4\right).$$

This completes the proof of Theorem 4. □

As an application of Theorem 4, we consider [49]:

$$\left\{\begin{array}{c}{x}_{n+1}=x_n-\frac{f\left(x_n\right)[f^{\prime }{\left(x_n\right)}^{\gamma -1}+f^{\prime }{\left({\widehat{x}}_n\right)}^{\gamma -1}]}{f^{\prime }{\left(x_n\right)}^{\gamma }+f^{\prime }{\left({\widehat{x}}_n\right)}^{\gamma }},\hfill \\ e_{n+1}=\left[\gamma c_2^2+\frac{c_3}{2}\right]e_n^3+\mathcal{O}\left(e_n^4\right),\hfill \end{array}\right.$$

which in the form of Equation (40) leads to

$$W\left({\eta }_n\right)=\frac{1+{({\eta }_n+1)}^{\gamma -1}}{1+{({\eta }_n+1)}^{\gamma }}.$$

When we take $\gamma =-1/2$, the conditions $W\left(0\right)=1$, $W^{\prime }\left(0\right)=-1/2$, $W^{″}\left(0\right)=5/4$ in Theorem 4 are satisfied. In

Table 3. For Equation (35), listing $x_0$, NIs and COCs of the FOIS (42) for three solutions.

r	${\mathit{x}}_0$	NI	COC
−2	−2.5	4	3.828
1	0.8	4	3.694
1.5	1.4	4	4.278

, we solve Equation (35) by using the FOIS (42), and list the results for three different solutions $r=-2,1,1.5$, which show large values of the COC.

Let $\alpha =W^{″}\left(0\right)$ be a parameter. With $W\left(\eta \right)=1-\eta /2+\alpha {\eta }^2/2$ in Equation (40), we have

$$\left\{\begin{array}{c}{x}_{n+1}=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)}\left(\frac{3}{2}-\frac{f^{\prime }\left({\widehat{x}}_n\right)}{2f^{\prime }\left(x_n\right)}+\frac{\alpha {[f^{\prime }\left({\widehat{x}}_n\right)-f^{\prime }\left(x_n\right)]}^2}{2f^{\prime }{\left(x_n\right)}^2}\right),\hfill \\ e_{n+1}=\left(2[1-\alpha ]c_2^2+\frac{c_3}{2}\right)e_n^3+\mathcal{O}\left(e_n^4\right).\hfill \end{array}\right.$$

The best value of $\alpha =5/4$ is chosen such that

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{3[a+bf\left(x_n\right)]}-\frac{2f\left(x_n\right)}{3f^{\prime }\left(x_n\right)}\left(\frac{3}{2}-\frac{f^{\prime }\left({\widehat{x}}_n\right)}{2f^{\prime }\left(x_n\right)}+\frac{\alpha {[f^{\prime }\left({\widehat{x}}_n\right)-f^{\prime }\left(x_n\right)]}^2}{2f^{\prime }{\left(x_n\right)}^2}\right)$$

(47)

is an FOIS.

In

Table 4. For Equation (36), listing $x_0$, NIs and COCs of the FOIS (47) for the solution $r=3$.

$x_0$	3.1	3.5	4	5
NI	5	8	12	21
COC	3.325	3.811	3.741	3.339

, we solve Equation (36) and list the results for the solution $r=3$ with four different initial guesses: $x_0=3.1,3.5,4,5$, which show large values of the COC.

6. Derivative-Free Iterative Schemes

In this section, we approximate a and b in Equation (24). With two initial guesses $x_0$ and ${\tilde{x}}_2$ satisfying $f\left(x_0\right)f\left({\tilde{x}}_2\right)<0$ to render $r\in (x_0,{\tilde{x}}_2)$, ${\tilde{x}}_1=(x_0+{\tilde{x}}_2)/2$ is taken. By a finite difference approximation of a and b, we take

$$a=\frac{f\left({\tilde{x}}_2\right)-f\left(x_0\right)}{{\tilde{x}}_2-x_0},b=\frac{1}{2a}\frac{f\left({\tilde{x}}_2\right)-2f\left({\tilde{x}}_1\right)+f\left(x_0\right)}{{({\tilde{x}}_1-x_0)}^2}=\frac{2f\left({\tilde{x}}_2\right)-4f\left({\tilde{x}}_1\right)+2f\left(x_0\right)}{({\tilde{x}}_2-x_0)[f\left({\tilde{x}}_2\right)-f\left(x_0\right)]}.$$

(48)

Inserting a and b in Equation (48) into Equation (17), we solve Equation (35) and the related data are tabulated in

Table 5. For Equation (35), listing $x_0$, ${\tilde{x}}_2$, a and b, NIs and COCs of present method for three solutions: $r=-2,1,1.5$.

r	${\mathit{x}}_0$	${\tilde{\mathit{x}}}_2$	a	b	NI	COC
−2	−2.5	−1.5	10.75	−0.60645	11	1.0059
1	0.8	1.2	−1.46	−1.71233	11	1.01383
1.5	1.4	1.6	1.76	2.27273	8	1.00138

.

We solve Equations (36)–(39), and the related data are tabulated in

Table 6. For $f_i\left(x\right)=0,i=1,\dots ,4$, listing $x_0$, ${\tilde{x}}_2$, a and b, NIs and COCs of present method.

i	${\mathit{x}}_0$	${\tilde{\mathit{x}}}_2$	a	b	NI	COC
1	2.9	3.07	13.0621	5.96248	9	0.978064
2	0.9	1.3	11.67	0.282776	9	0.9819139
3	−1.25	−1.2	21.43125	−1.5275414	11	1.009
4	3.2	3.3	6.5	0.1538462	14	1.11766

.

Remark 3. 

For the solution of $f_4\left(x\right)=0$, it does not exist $x_0$ and ${\tilde{x}}_2$ such that $f_4\left(x_0\right)f_4\left({\tilde{x}}_2\right)<0$, due to $f_4\left(x\right)\ge 0$. However, we place $x_0$ and ${\tilde{x}}_2$ on the right-side of the solution and the present iterative scheme is applicable to find the solution with 14 iterations, as shown in Table 6.

If the curve of $f\left(x\right)$ vs. x is available, we can observe a rough position of the solution r, and then the slope $f^{\prime }\left(r\right)$ and the curvature $f^{″}\left(r\right)$ can be estimated roughly. Intuitively, we can estimate a and b by the slope and curvature. In order to maintain the fast convergence, we must choose ${\tilde{x}}_0$ and ${\tilde{x}}_2$ quite close to the solution r, such that

$$\tilde{a}=\frac{f\left({\tilde{x}}_2\right)-f\left({\tilde{x}}_0\right)}{{\tilde{x}}_2-{\tilde{x}}_0},\tilde{b}=\frac{1}{2\tilde{a}}\frac{f\left({\tilde{x}}_2\right)-2f\left({\tilde{x}}_1\right)+f\left({\tilde{x}}_0\right)}{{({\tilde{x}}_1-{\tilde{x}}_0)}^2}$$

(49)

are very close to a and b in Equation (24), where ${\tilde{x}}_1=({\tilde{x}}_0+{\tilde{x}}_2)/2$. For Equation (35) with the solution $r=-2$, if we take ${\tilde{x}}_0=r-0.01$ and ${\tilde{x}}_2=r+0.01$, NI is greatly reduced from 11 to 5 and COC = 2.904; for $r=1$, NI reduces to 6 and COC = 2.862; and for $r=1.5$, NI reduces to 5 and COC = 2.936. Here, NI and COC are improved by comparing to that in Table 5.

A greed search such as the 2D golden section search algorithm in the given range can help us to obtain the optimal values of a and b for fast convergence. However, it would spend much more computations. Instead of a greed search in the plane $(a,b)$, we discuss the influence of $\tilde{a}$ and $\tilde{b}$ in Equation (49) by giving ${\tilde{x}}_0=r-c$ and ${\tilde{x}}_2=r+c$. For different c, $\tilde{a}$ and $\tilde{b}$ are different. In

Table 7. For Equation (35) with the solution $r=-2$ and with the initial guess $x_0=-2.5$, listing $\tilde{a}$, $\tilde{b}$, NIs and COCs of present method for different values of c.

c	$\tilde{\mathit{a}}$	$\tilde{\mathit{b}}$	NI	COC
0.1	10.51	−0.61845861	7	0.999994
0.05	10.5025	−0.61890026	6	1.084194
0.02	10.50004	−0.61902404	6	1.233496
0.011	10.500012	−0.61904049	5	2.90119
0.01	10.50001	−0.61904172	5	2.90404

, we list the results. Obviously, COC defined in Equation (33) is sensitive to the values of $\tilde{a}$ and $\tilde{b}$, when they approach to the optimal values, but NI does not have a large variation. When $\tilde{a}$ and $\tilde{b}$ tend to optimal values $a=10.5$ and $b=-0.619047619$, COC = 2.9041 tends to the theoretical one with COC = 3, as listed in Table 1.

Like that performed in Equations (48) and (17), we introduce a derivative-free modification of the Newton variant in Equation (5) to

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{A+Bf\left(x_n\right)},$$

(50)

where

$$A=\frac{f\left({\tilde{x}}_2\right)-f\left(x_0\right)}{{\tilde{x}}_2-x_0},B=\frac{1}{A}\frac{f\left({\tilde{x}}_2\right)-2f\left({\tilde{x}}_1\right)+f\left(x_0\right)}{{({\tilde{x}}_1-x_0)}^2}=\frac{4f\left({\tilde{x}}_2\right)-8f\left({\tilde{x}}_1\right)+4f\left(x_0\right)}{({\tilde{x}}_2-x_0)[f\left({\tilde{x}}_2\right)-f\left(x_0\right)]}.$$

(51)

For Equations (36)–(39) solved by the first derivative-free Newton method (FDFNM), the related data are tabulated in

Table 8. For $f_i\left(x\right)=0,i=1,\dots ,4$, listing $x_0$, ${\tilde{x}}_2$, A and B, NIs and COCs of the FDFNM.

i	${\mathit{x}}_0$	${\tilde{\mathit{x}}}_2$	A	B	NI	COC
1	2.9	3.07	13.0621	11.92497	10	1.00286
2	0.9	1.3	11.67	0.565553	9	1.000512
3	−1.25	−1.2	21.43125	−3.055083	12	1.05017
4	3.2	3.3	6.5	0.30729631	14	1.00584

.

By neglecting the higher-order terms in Equations (2) and (3), we have

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(r\right)+f^{″}\left(r\right)(x_n-r)}.$$

(52)

We have

$$f\left(x_n\right)=f\left(r\right)+f^{\prime }\left(r\right)(x_n-r)+\frac{1}{2}{f}^{″}\left(r\right){(x_n-r)}^2+\cdots .$$

(53)

By using $f\left(r\right)=0$ and neglecting the higher-order terms, it follows from Equation (53) a quadratic equation for $x_n-r$:

$$f^{″}\left(r\right){(x_n-r)}^2+2f^{\prime }\left(r\right)(x_n-r)-2f\left(x_n\right)=0.$$

Thus, we can derive

$$x_n-r=\frac{\sqrt{f^{\prime }{\left(r\right)}^2+2f\left(x_n\right)f^{″}\left(r\right)}-f^{\prime }\left(r\right)}{f^{″}\left(r\right)}.$$

(54)

Inserting Equation (54) into Equation (52), we can derive the second modified Newton method:

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{\sqrt{f^{\prime }{\left(r\right)}^2+2f\left(x_n\right)f^{″}\left(r\right)}},$$

(55)

which is different from the first modified Newton method (5). Let

$$C=\frac{f\left({\tilde{x}}_2\right)-f\left(x_0\right)}{{\tilde{x}}_2-x_0},D=\frac{f\left({\tilde{x}}_2\right)-2f\left({\tilde{x}}_1\right)+f\left(x_0\right)}{{({\tilde{x}}_1-x_0)}^2},$$

(56)

and we can obtain the second derivative-free Newton method (SDFNM):

$$x_{n+1}=x_n-\frac{f\left(x_n\right)}{\sqrt{C^2+2Df\left(x_n\right)}}.$$

(57)

We employ the SDFNM to solve Equations (36)–(39), and the related data are tabulated in

Table 9. For $f_i\left(x\right)=0,i=1,\dots ,4$, listing $x_0$, ${\tilde{x}}_2$, A and B, NIs and COCs of the SDFNM.

i	${\mathit{x}}_0$	${\tilde{\mathit{x}}}_2$	C	D	NI	COC
1	2.9	3.07	13.0621	155.8141	8	0.9984
2	0.9	1.3	11.67	6.6	9	1.0022
3	−1.25	−1.2	21.43125	−65.4743	12	1.0311
4	3.2	3.3	6.5	2	14	0.98004

.

Upon comparing Table 6, Table 8 and Table 9, the performance of the presented method in Equations (48) and (17), as well as the FDFNM in Equations (50) and (51) and the SDFNM in Equations (56) and (57), are almost the same.

As a practical application of the proposed iterative schemes, let us consider a nonlinear boundary value problem:

$$\begin{array}{ccc}\hfill & & u^{″}\left(y\right)=\frac{3}{2}{u}^2\left(y\right),y\in (0,1),\hfill \end{array}$$

(58)

$$\begin{array}{ccc}\hfill & & u\left(0\right)=4,u\left(1\right)=1.\hfill \end{array}$$

(59)

An exact solution is

$$u\left(y\right)=\frac{4}{{(y+1)}^2}.$$

The conventional shooting method is assumed to be an unknown initial slope $u^{\prime }\left(0\right)=x$, and we integrate Equation (58) with the initial conditions $u\left(0\right)=4$ and $u^{\prime }\left(0\right)=x$, which results an implicit equation $f\left(x\right)=u(1,x)-1=0$ to be solved. The exact solution is $r=-8$.

We apply the fourth-order Runge–Kutta method to integrate Equation (58) with $N=7500$ steps, and fix $x_0=-9.5$ and ${\tilde{x}}_2=-6$. By using Equations (48) and (17), NI is 16, the error of x is $2.842\times {10}^{-14}$ and the maximum error of u is $5.33\times {10}^{-15}$. While we use Equations (50) and (51), NI is increased to 18, and the errors are the same.

7. Hermite Interpolation

To be the extensions of the one-step Newton method (2), there are, respectively, two-step and three-step methods of double Newton and triple Newton:

$$\left\{\begin{array}{c}{y}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},\hfill \\ x_{n+1}=y_n-\frac{f\left(y_n\right)}{f^{\prime }\left(y_n\right)},\hfill \end{array}\right.\left\{\begin{array}{c}{y}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},\hfill \\ z_n=y_n-\frac{f\left(y_n\right)}{f^{\prime }\left(y_n\right)},\hfill \\ x_{n+1}=z_n-\frac{f\left(z_n\right)}{f^{\prime }\left(z_n\right)}.\hfill \end{array}\right.$$

(60)

However, due to the low efficiency index (E.I.) = 1.414 of these iterative schemes, they are rarely used in the solution of nonlinear equations. Below, we will employ the generalized Hermite interpolation techniques to raise the values of E.I.

We fix

$$\begin{array}{ccc}\hfill & & y_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},\hfill \end{array}$$

(61)

$$\begin{array}{ccc}\hfill & & {\xi }_n=\frac{f\left(y_n\right)}{f\left(x_n\right)},{\eta }_n=\frac{f\left(z_n\right)}{f\left(y_n\right)},{\gamma }_n=\frac{f\left(z_n\right)}{f\left(x_n\right)}={\xi }_n{\eta }_n.\hfill \end{array}$$

(62)

The Hermite function $H\left(x\right)$ for the interpolation of the data of a function $f\left(x\right)$ at two points $x_n$ and $y_n$ is such that

$$H\left(x_n\right)=f\left(x_n\right),H\left(y_n\right)=f\left(y_n\right),H^{\prime }\left(x_n\right)=f^{\prime }\left(x_n\right),H^{\prime }\left(y_n\right)=f^{\prime }\left(y_n\right).$$

(63)

If $H\left(x\right)$ is a polynomial to match these four conditions in Equation (63), it is at least a second-order function of x, denoted as $H_2\left(x\right)$. When $y_n$ is computed from Equation (61), it is not independent to $x_n$; hence, there exists an Hermite interpolation formula to predict $f^{\prime }\left(y_n\right)$ from the data $(f\left(x_n\right),f\left(y_n\right),f^{\prime }\left(x_n\right))$. The two-point Hermite interpolation formula was generalized in [30], involving a weight function.

The second-order Hermite polynomial is constructed according to the Hermite interpolation conditions [30]:

$$H_2\left(x_n\right)=f\left(x_n\right),H_2\left(y_n\right)=f\left(y_n\right),H_2^{\prime }\left(x_n\right)=f^{\prime }\left(x_n\right).$$

Wang and Liu [36] derived

$$\begin{array}{ccc}& & H_2\left(x\right)=\frac{(x-y_n)f\left(x_n\right)}{x_n-y_n}-\frac{x-x_n}{{(x_n-y_n)}^2}[(x-y_n)f\left(x_n\right)-(x-x_n)f\left(y_n\right)]\hfill \\ & & +\frac{(x-x_n)(x-y_n)}{x_n-y_n}{f}^{\prime }\left(x_n\right),\hfill \\ & & H_2^{\prime }\left(x\right)=\frac{2(x-x_n)}{{(y_n-x_n)}^2}[f\left(y_n\right)-f\left(x_n\right)]-\frac{2x-x_n-y_n}{y_n-x_n}{f}^{\prime }\left(x_n\right).\hfill \end{array}$$

Then, it follows from $f^{\prime }\left(y_n\right)=H_2^{\prime }\left(y_n\right)$ and Equations (61) and (62) that

$$f^{\prime }\left(y_n\right)=(1-2{\xi }_n)f^{\prime }\left(x_n\right),$$

(64)

which expressed a certain two-point generalized Hermite interpolation.

Definition 1. 

A two-point generalized Hermite interpolation of $f^{\prime }\left(y_n\right)$ in terms of $f^{\prime }\left(x_n\right)$ and ${\xi }_n$ is depicted by

$$f^{\prime }\left(y_n\right)=h\left({\xi }_n\right)f^{\prime }\left(x_n\right),$$

(65)

where the weight function $h\left({\xi }_n\right)$ satisfies

$$h\left(0\right)=1,h^{\prime }\left(0\right)=-2.$$

(66)

Equations (65) and (66) include Equation (64) as a special case.

If one replaces $f^{\prime }\left(y_n\right)$ in the first equation in Equation (60) by that in Equation (65), it generates an FOIS [17,37,38]:

$$\left\{\begin{array}{c}{y}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},\hfill \\ x_{n+1}=y_n-\frac{1}{h\left({\xi }_n\right)}\frac{f\left(y_n\right)}{f^{\prime }\left(x_n\right)}.\hfill \end{array}\right.$$

(67)

The E.I. of Equation (67) is now raised to E.I. = 1.587, which is better than E.I. = 1.414 of the double Newton method.

This fact encourages us also to replace $f^{\prime }\left(z_n\right)$ in Equation (60) by the following three-point interpolation formula:

$$f^{\prime }\left(z_n\right)=g({\xi }_n,{\eta }_n,{\gamma }_n)f^{\prime }\left(x_n\right),$$

(68)

such that the combination of Equations (60), (65) and (68) leads to

$$\left\{\begin{array}{c}{y}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},\hfill \\ z_n=y_n-\frac{1}{h\left({\xi }_n\right)}\frac{f\left(y_n\right)}{f^{\prime }\left(x_n\right)},\hfill \\ x_{n+1}=z_n-\frac{1}{g({\xi }_n,{\eta }_n,{\gamma }_n)}\frac{f\left(z_n\right)}{f^{\prime }\left(x_n\right)}.\hfill \end{array}\right.$$

(69)

With certain conditions on $h\left({\xi }_n\right)$ and $g({\xi }_n,{\eta }_n,{\gamma }_n)$, the E.I. of the iterative scheme (69) can be further raised to E.I. = 1.682. They are three-point EOISs.

8. Three-Point Generalized Hermite Interpolations

Using the third-order Hermite polynomial for the three-point $(x_n,y_n,z_n)$ interpolation, Wang and Liu [36] and Petković [37] derived

$$f^{\prime }\left(z_n\right)=-2f[x_n,y_n]+f[y_n,z_n]+2f[x_n,z_n]+(y_n-z_n)f[y_n,x_n,x_n],$$

(70)

where

$$f[x_n,y_n]=\frac{f\left(x_n\right)-f\left(y_n\right)}{x_n-y_n},f[y_n,x_n,x_n]=\frac{f[y_n,x_n]-f^{\prime }\left(x_n\right)}{y_n-x_n},$$

and $f[x_n,z_n]$ and $f[y_n,z_n]$ are defined by the same fashion.

From the first two equations in Equation (69) and Equation (62), we can derive the following divided differences:

$$\begin{array}{ccc}\hfill & & f[x_n,y_n]=(1-{\xi }_n)f^{\prime }\left(x_n\right),\hfill \end{array}$$

$$\begin{array}{ccc}& & f[y_n,z_n]=h\left({\xi }_n\right)(1-{\eta }_n)f^{\prime }\left(x_n\right),f[x_n,z_n]=\frac{h\left({\xi }_n\right)(1-{\gamma }_n)}{h\left({\xi }_n\right)+{\xi }_n}{f}^{\prime }\left(x_n\right),\hfill \\ \hfill & & f[y_n,x_n,x_n]=\frac{{\xi }_n}{f\left(x_n\right)}{f}^{\prime }{\left(x_n\right)}^2,\hfill \end{array}$$

(71)

$$\begin{array}{ccc}& & f[z_n,x_n,x_n]=\frac{f[z_n,x_n]-f^{\prime }\left(x_n\right)}{z_n-x_n}=\frac{[h\left({\xi }_n\right){\gamma }_n+{\xi }_n]h\left({\xi }_n\right)}{{[h\left({\xi }_n\right)+{\xi }_n]}^{2}f\left(x_n\right)}{f}^{\prime }{\left(x_n\right)}^2.\hfill \end{array}$$

(72)

Using Equations (70), (71) and (72) and through some manipulations, we can derive

$$f^{\prime }\left(z_n\right)=[A\left({\xi }_n\right)-B\left({\xi }_n\right){\eta }_n-C\left({\xi }_n\right){\gamma }_n]f^{\prime }\left(x_n\right),$$

(73)

where

$$A\left({\xi }_n\right):=2{\xi }_n+h\left({\xi }_n\right)-\frac{2{\xi }_n}{h\left({\xi }_n\right)+{\xi }_n}+\frac{{\xi }_n^2}{h\left({\xi }_n\right)},B\left({\xi }_n\right)=h\left({\xi }_n\right),C\left({\xi }_n\right):=\frac{2h\left({\xi }_n\right)}{h\left({\xi }_n\right)+{\xi }_n}.$$

(74)

Definition 2. 

A three-point generalized Hermite interpolation of $f^{\prime }\left(z_n\right)$ in terms of $f^{\prime }\left(x_n\right)$ and $g({\xi }_n,{\gamma }_n,{\eta }_n)$ is defined by Equations (73) and (74) as

$$f^{\prime }\left(z_n\right)=g({\xi }_n,{\eta }_n,{\gamma }_n)f^{\prime }\left(x_n\right):=[A\left({\xi }_n\right)-B\left({\xi }_n\right){\eta }_n-C\left({\xi }_n\right){\gamma }_n]f^{\prime }\left(x_n\right),$$

(75)

where the weight functions $A\left({\xi }_n\right)$, $B\left({\xi }_n\right)$ and $C\left({\xi }_n\right)$ satisfy

$$A\left(0\right)=1,A^{\prime }\left(0\right)=-2,A^{″}\left(0\right)=-2,A^{‴}\left(0\right)=0,B\left(0\right)=1,B^{\prime }\left(0\right)=-2,C\left(0\right)=2.$$

(76)

For the two-point Hermite interpolation function $h\left({\xi }_n\right)=1-2{\xi }_n$ in Equation (64), by Equation (74), we can derive

$$A\left({\xi }_n\right)=\frac{2-4{\xi }_n}{1-{\xi }_n}+\frac{{\xi }_n^2}{1-2{\xi }_n}-1,B\left({\xi }_n\right)=1-2{\xi }_n,C\left({\xi }_n\right)=\frac{2-4{\xi }_n}{1-{\xi }_n}.$$

(77)

Equation (77) is a special case of Equation (76). Unlike that in Equation (74), for the generalized interpolation in Equation (75), $g({\xi }_n,{\gamma }_n,{\eta }_n)=A\left({\xi }_n\right)-B\left({\xi }_n\right){\eta }_n-C\left({\xi }_n\right){\gamma }_n$ can be independent to $h\left({\xi }_n\right)$.

The function $A\left(\xi \right)$ is subjected to four conditions, in which it is somewhat not easy to obtain $A\left(\xi \right)$. We attempt to construct it by a function with merely two conditions.

Lemma 2. 

A function $A\left(\xi \right)$, with

$$A\left(0\right)=a_0,A^{\prime }\left(0\right)=a_1,A^{″}\left(0\right)=a_2,A^{‴}\left(0\right)=a_3,$$

(78)

can be obtained from

$$A\left(\xi \right)=a_0+a_1\xi +{\xi }^{2}F\left(\xi \right),$$

(79)

where

$$F\left(0\right)=\frac{a_2}{2},F^{\prime }\left(0\right)=\frac{a_3}{6}.$$

(80)

Proof. 

Inserting $\xi =0$ into Equation (79), $A\left(0\right)=a_0$ follows directly. It follows from Equation (79) that

$$\begin{array}{ccc}& & A^{\prime }\left(\xi \right)=a_1+2\xi F\left(\xi \right)+{\xi }^2{F}^{\prime }\left(\xi \right),A^{″}\left(\xi \right)=2F\left(\xi \right)+4\xi F^{\prime }\left(\xi \right)+{\xi }^2{F}^{″}\left(\xi \right),\hfill \\ & & A^{‴}\left(\xi \right)=6F^{\prime }\left(\xi \right)+6\xi F^{″}\left(\xi \right)+{\xi }^2{F}^{‴}\left(\xi \right),\hfill \end{array}$$

of which after inserting $\xi =0$ and using Equation (80), we can derive the last three conditions in Equation (78). □

Taking advantage of Lemma 2, we can replace Equation (76) by

$$A\left(\xi \right)=1-2\xi +{\xi }^{2}F\left(\xi \right),F\left(0\right)=-1,F^{\prime }\left(0\right)=0,B\left(0\right)=1,B^{\prime }\left(0\right)=-2,C\left(0\right)=2.$$

There appear different interpolation techniques. Using a rational function, Sharma and Sharma [50] derived

$$f^{\prime }\left(z_n\right)=\frac{f[x_n,z_n]f[y_n,z_n]}{f[x_n,y_n]},$$

which in terms of Equation (71) can be written as

$$f^{\prime }\left(z_n\right)=\frac{h^2\left({\xi }_n\right)(1-{\gamma }_n)(1-{\eta }_n)}{[h\left({\xi }_n\right)+{\xi }_n](1-{\xi }_n)}{f}^{\prime }\left(x_n\right),h\left({\xi }_n\right)=1-2{\xi }_n.$$

(81)

Based on the Taylor series expansion,

$$f^{\prime }\left(z_n\right)=f[z_n,y_n]+(z_n-y_n)f[z_n,x_n,x_n]=f[z_n,y_n]+\frac{z_n-y_n}{z_n-x_n}[f[z_n,x_n]-f^{\prime }\left(x_n\right)]$$

was derived by Bi et al. [34], which with the aid of Equations (71) and (72) can be recast to

$$f^{\prime }\left(z_n\right)=\left[h\left({\xi }_n\right)(1-{\eta }_n)-\frac{{\xi }_n[h\left({\xi }_n\right){\gamma }_n+{\xi }_n]}{{[h\left({\xi }_n\right)+{\xi }_n]}^2}\right]f^{\prime }\left(x_n\right),h\left({\xi }_n\right)=\frac{2-5{\xi }_n}{2-{\xi }_n}.$$

(82)

Both interpolations (81) and (82) are special cases of the generalized interpolation in Equation (75).

To observe the accuracy of Equation (75) and the other two interpolations (81) and (82), we consider two definite functions:

$$f_1\left(x\right)=x^3+4x^2-10,f_2\left(x\right)=e^{x^2+7x-30}-1,$$

(83)

of which $f_1(r=1.3652300134)=0$ and $f_2(r=3)=0$. We define

$$\mathrm{RE}:=\frac{|f^{\prime }\left(z_n\right)-f_E^{\prime }\left(z_n\right)|}{|f_E^{\prime }\left(z_n\right)|}$$

(84)

to be the relative error of the interpolation of $f^{\prime }\left(z_n\right)$, where $f^{\prime }\left(z_n\right)$ and $f_E^{\prime }\left(z_n\right)$ are, respectively, the value calculated from Equation (75) and the exact value.

The following cases are with simple weight functions:

$$\begin{array}{ccc}\hfill & & \left(\mathrm{a}\right)h=1-2{\xi }_n,\mathrm{and}A\left({\xi }_n\right),B\left({\xi }_n\right),C\left({\xi }_n\right)\mathrm{by} \mathrm{Equation}\left(77\right),\hfill \\ & & \left(\mathrm{b}\right)h=1-2{\xi }_n-{\xi }_n^4,\mathrm{and}A\left({\xi }_n\right),B\left({\xi }_n\right),C\left({\xi }_n\right)\mathrm{by} \mathrm{Equation}\left(74\right),\hfill \\ & & \left(\mathrm{c}\right)h=1-2{\xi }_n+{\xi }_n^3,\mathrm{and}A\left({\xi }_n\right),B\left({\xi }_n\right),C\left({\xi }_n\right)\mathrm{by} \mathrm{Equation}\left(74\right),\hfill \\ & & \left(\mathrm{d}\right)h=1-2{\xi }_n+{\xi }_n^4,\mathrm{and}A\left({\xi }_n\right),B\left({\xi }_n\right),C\left({\xi }_n\right)\mathrm{by} \mathrm{Equation}\left(74\right),\hfill \\ & & \left(\mathrm{e}\right)h=1-2{\xi }_n+{\xi }_n^3,F\left({\xi }_n\right)=-1-{\xi }_n^2,B\left({\xi }_n\right)=1-2{\xi }_n,C\left({\xi }_n\right)=2-2{\xi }_n,\hfill \\ & & \left(\mathrm{f}\right)h=1-2{\xi }_n,F\left({\xi }_n\right)=-1+{\xi }_n^2+{\xi }_n^3,B\left({\xi }_n\right)=1-2{\xi }_n+{\xi }^2,C\left({\xi }_n\right)=2.\hfill \end{array}$$

(85)

Table 10. Listing REs for the functions $f_1\left(x\right)$ and $f_2\left(x\right)$ in Equation (83), which are computed at $x_n=1.3$ and $x_n=3.05$, respectively. Each number of $e(-k)$ means that ${10}^{-k}$.

	(a)	(b)	(c)	(d)	(e)	(f)	(81)	(82)
$f_1$	$3.6e(-14)$	$2.4e(-14)$	$2.3e(-14)$	$1.1e(-14)$	$3.3e(-5)$	$3.8e(-6)$	$2.6e(-5)$	$2.4e(-5)$
$f_2$	$4.3e(-3)$	$4.3e(-3)$	$4.2e(-3)$	$4.2e(-3)$	$4.3e(-2)$	$1.6e(-2)$	$9.1e(-3)$	$2.5e(-2)$

lists the REs.

For $f_1\left(x\right)$, the accuracy of Cases (a)–(d) is much better than others because the interpolant $f_1\left(x\right)$ is itself a third-order polynomial; however, for $f_2\left(x\right)$, the accuracy of all cases are of the levels ${10}^{-2}$ and ${10}^{-3}$.

9. Three-Point Eighth-Order Optimal Iterative Schemes

In this section, we combine the two-point and three-point generalized Hermite interpolations to generate some eighth-order optimal iterative schemes (EOIS).

Theorem 5. 

Equation (69) has eighth-order convergence, if $h\left({\xi }_n\right)$ satisfies

$$h\left(0\right)=1,h^{\prime }\left(0\right)=-2,h^{″}\left(0\right)=0,$$

(86)

and $A\left({\xi }_n\right)$, $B\left({\xi }_n\right)$ and $C\left({\xi }_n\right)$ in

$$g({\xi }_n,{\eta }_n,{\gamma }_n)=A\left({\xi }_n\right)-B\left({\xi }_n\right){\eta }_n-C\left({\xi }_n\right){\gamma }_n$$

(87)

satisfy the conditions in Equation (76).

Proof. 

Before giving the proof, we emphasize that for the special case with $h\left({\xi }_n\right)=1-2{\xi }_n$ and $A\left({\xi }_n\right)$, $B\left({\xi }_n\right)$ and $C\left({\xi }_n\right)$ given in Equation (77), Wang and Liu [36] have proven the eighth-order convergence of the iterative scheme (69) and derived the corresponding error equation. For saving space, the details are not written here, and the error equation is not written out explicitly.

Let $e_n=x_n-r$, $s_n=y_n-r$, $d_n=z_n-r$ and $c_k=f^{\left(k\right)}\left(r\right)/[k!f^{\prime }\left(r\right)],k=2,\dots$. As shown in [36],

$$\begin{array}{ccc}\hfill & & f\left(x_n\right)=f^{\prime }\left(r\right)[e_n+c_2{e}_n^2+\dots +c_8{e}_n^8+\mathcal{O}\left(e_n^9\right)],\hfill \end{array}$$

(88)

$$\begin{array}{ccc}\hfill & & f\left(y_n\right)=f^{\prime }\left(r\right)[s_n+c_2{s}_n^2+c_3{s}_n^3+c_4{s}_n^4+\mathcal{O}\left(e_n^9\right)],\hfill \end{array}$$

(89)

$$\begin{array}{ccc}\hfill & & f\left(z_n\right)=f^{\prime }\left(r\right)[d_n+c_2{d}_n^2+\mathcal{O}\left(e_n^9\right)],\hfill \end{array}$$

(90)

where

$$\begin{array}{ccc}\hfill & & s_n=c_2{e}_n^2-2(c_2^2-c_3)e_n^3-(7c_2{c}_3-4c_2^3-3c_4)e_n^4+\dots +c_8{e}_n^8+\mathcal{O}\left(e_n^9\right),\hfill \end{array}$$

(91)

$$\begin{array}{ccc}\hfill & & d_n=(c_2^3-c_2{c}_3)e_n^4+\dots +\mathcal{O}\left(e_n^9\right).\hfill \end{array}$$

(92)

In view of Equations (88)–(92), $({\xi }_n,{\eta }_n,{\gamma }_n)$ in Equation (62) have the following asymptotic estimations:

$${\xi }_n\approx \mathcal{O}\left(e_n\right),{\eta }_n\approx \mathcal{O}\left(e_n^2\right),{\gamma }_n\approx \mathcal{O}\left(e_n^3\right).$$

(93)

Due to

$$f^{\prime }\left(x_n\right)=f^{\prime }\left(r\right)[1+2c_2{e}_n+\dots +8c_8{e}_n^7+\mathcal{O}\left(e_n^8\right)]$$

and Equation (90), the term $f\left(z_n\right)/f^{\prime }\left(x_n\right)$ in Equation (69) has the following asymptotic estimation:

$$\frac{f\left(z_n\right)}{f^{\prime }\left(x_n\right)}\approx \mathcal{O}\left(e_n^4\right).$$

(94)

Therefore, we merely need to expand g to the third order by

$$g\approx A\left(0\right)+A^{\prime }\left(0\right){\xi }_n+\frac{A^{″}\left(0\right)}{2}{\xi }_n^2+\frac{A^{‴}\left(0\right)}{6}{\xi }_n^3-[B\left(0\right)+B^{\prime }\left(0\right){\xi }_n]{\eta }_n-C\left(0\right){\gamma }_n+\mathcal{O}\left(e_n^4\right),$$

(95)

where Equation (93) was taken into account.

Inserting $d_n=x_n-r$ and Equations (94) and (95) into the last one in Equation (69) yields

$$\begin{array}{ccc}\hfill & & e_{n+1}=d_n-\frac{1}{g}\frac{f\left(z_n\right)}{f^{\prime }\left(x_n\right)}\hfill \\ \hfill & & \approx d_n-\frac{1}{A\left(0\right)+A^{\prime }\left(0\right){\xi }_n+\frac{A^{″}\left(0\right)}{2}{\xi }_n^2+\frac{A^{‴}\left(0\right)}{6}{\xi }_n^3-[B\left(0\right)+B^{\prime }\left(0\right){\xi }_n]{\eta }_n-C\left(0\right){\gamma }_n}\mathcal{O}\left(e_n^4\right)\approx \mathcal{O}\left(e_n^8\right),\hfill \end{array}$$

(96)

since $h\left({\xi }_n\right)$ satisfies Equation (86); $A\left({\xi }_n\right)$, $B\left({\xi }_n\right)$ and $C\left({\xi }_n\right)$ have the same values at ${\xi }_n=0$ as listed in Equation (76) with those in Equation (77); and according to [36], the coefficients preceding $e_n^4$ to $e_n^7$ are zeros for the iterative scheme (69). Equation (96) indicates that Equation (69) has eighth-order convergence. Because we do not derive the error equation in an explicit form, many processes were omitted. □

Although, the details of the derivation of the corresponding error equation is not given here, we give two examples to verify the performance of the iterative scheme (69), of which $h\left({\xi }_n\right)$ and $g({\xi }_n,{\eta }_n,{\gamma }_n)$ are independent, not like that in [36] as shown by Case (a) in Equation (85), wherein g is related to h by Equations (75) and (74). We abbreviate the method in [36] as WLM. For the purpose of comparison, the WLM is written as follows:

$$\begin{array}{ccc}\hfill & & \left\{\begin{array}{c}{y}_n=x_n-\frac{f\left(x_n\right)}{f^{\prime }\left(x_n\right)},\hfill \\ z_n=y_n-\frac{f\left(y_n\right)}{2f[x_n,y_n]-f^{\prime }\left(x_n\right)},\hfill \\ x_{n+1}=z_n-\frac{f\left(z_n\right)}{2f[x_n,z_n]+f[y_n,z_n]-2f[x_n,y_n]+(y_n-z_n)f[y_n,x_n,x_n]},\hfill \end{array}\right.\hfill \end{array}$$

(97)

$$\begin{array}{ccc}\hfill & & \left\{\begin{array}{c}f[x_n,y_n]=\frac{f\left(x_n\right)-f\left(y_n\right)}{x_n-y_n},\hfill \\ f[x_n,z_n]=\frac{f\left(x_n\right)-f\left(z_n\right)}{x_n-z_n},\hfill \\ f[y_n,z_n]=\frac{f\left(y_n\right)-f\left(z_n\right)}{y_n-z_n},\hfill \\ f[y_n,x_n,x_n]=\frac{f[x_n,y_n]-f^{\prime }\left(x_n\right)}{y_n-x_n}.\hfill \end{array}\right.\hfill \end{array}$$

(98)

This iterative scheme was proved in [36] to be eighth-order convergence, which is optimal, because there are four function operations on $[f\left(x_n\right),f^{\prime }\left(x_n\right),f\left(y_n\right),f\left(z_n\right)]$. Compared to Equation (69), which is also eighth-order convergence, and also with the same function operations on $[f\left(x_n\right),f^{\prime }\left(x_n\right),f\left(y_n\right),f\left(z_n\right)]$, the two methods are different in their construction techniques.

The iterative scheme (69), which involves $h\left({\xi }_n\right)$ and $g({\xi }_n,{\eta }_n,{\gamma }_n)$, is definitely more general than that in Equations (97) and (98). The theoretical basis of Equation (69) is the generalizations of the two-point and three-point Hermite interpolation methods.

Substituting the functions in Cases (a)–(f) into the iterative scheme (69), we have different algorithms; in particular, using the functions in Equations (81) and (82), we recover the iterative schemes developed in [34,50], which are shortened as SSM and BRWM in

Table 11. For the functions $f_1\left(x\right)=x^3+4x^2-10$ with $x_0=1$ and $f_2\left(x\right)=e^{x^2+7x-30}-1$ with $x_0=3.5$, comparing the number of iterations.

	WLM	(b)	(c)	(d)	(e)	(f)	SSM	BRWM
$f_1=0$	3	3	3	3	3	3	3	3
$f_2=0$	6	6	6	6	6	6	6	5

. The convergence criteria are $|x_{n+1}-x_n| <{10}^{-15}$ and $|f\left(x_n\right)| <{10}^{-15}$. It can be seen that these iterative schemes have the same performance.

10. Conclusions

We have derived a simple iterative scheme to solve nonlinear equations from a two-dimensional approach with two constant parameters involved. Executing the convergence analysis, the parameters were constrained by a derived inequality, which resulted in a third-order convergence iterative scheme. The presented method is derivative-free and the theoretically and numerically proved order of the convergence is three. We proved that the iterative scheme is a variant of Newton’s method improved from quadratic convergence to cubic convergence. Numerical results revealed that the new method can be of practical interest for finding the solution quickly, and at each iteration, it merely required one evaluation of the given function. The proposed fractional iterative scheme was combined with the generalized quadrature methods to develop a class of fourth-order optimal iterative schemes. Examples were given to show that the COC is close to four. We employed a finite difference technique on the data at three points near to the solution to estimate the optimal values of two parameters, whose efficiency was identified by numerical tests. In terms of weight functions with certain constraints, two new generalized Hermite interpolation techniques were performed for the transformations between the derivatives at two points and at three points. A modification of the triple Newton’s method with the two generalized Hermite interpolation formulas can realize the eighth-order optimal iterative scheme, whose E.I. = 1.682 is better than E.I. = 1.414 of the triple Newton method. Two examples were verified for testing the accuracy of the generalized Hermite interpolations and the efficiency of the proposed eighth-order optimal iterative schemes. In summary, the novelty points of this paper are as follows:

• A two-dimensional approach to the modification of the Newton method is developed.
• The resulting fractional iterative scheme involving two parameters is of the one-step type and also of third-order convergence, which saves much computation of function per iteration.
• A new fourth-order optimal iterative scheme was constructed.
• A new three-point generalized Hermite interpolation was constructed, which is quite general.
• A new eighth-order optimal iterative scheme was constructed.