# A Family of Derivative-Free Methods with High Order of Convergence and Its Application to Nonsmooth Equations

Authors: Alicia Cordero; José L. Hueso; Eulalia Martínez; Juan R. Torregrosa
Journal: Abstract and Applied Analysis
 (2012)

---

## Abstract

A family of derivative-free methods of seventh-order
convergence for solving nonlinear equations is suggested. In the proposed
methods, several linear combinations of divided differences are used in
order to get a good estimation of the derivative of the given function at
the different steps of the iteration. The efficiency indices of the members of
this family are equal to 1.6266. Also, numerical examples are used to show
the performance of the presented methods, on smooth and nonsmooth
equations, and to compare with other derivative-free methods, including
some optimal fourth-order ones, in the sense of Kung-Traub’s conjecture.


---

## Body

## 1. Introduction

Finding iterative methods for solving nonlinear equations is an important area of research in numerical analysis, and it has interesting applications in various branches of Science and Engineering. In this study, we describe new iterative methods to find a simple rootα of a nonlinear equation f(x)=0, where f:I⊂ℝ→ℝ is a scalar function on an open interval I. The known Newton’s method for finding α uses the iterative expression(1.1)xk+1=xk-f(xk)f′(xk),k=0,1,…,which converges quadratically in some neighborhood ofα. If the derivative f′(xk) is replaced by the forward-difference approximation(1.2)f′(xk)≈f(xk+f(xk))-f(xk)f(xk),the Newton’s method becomes(1.3)xk+1=xk-(f(xk))2f(xk+f(xk))-f(xk),which is the known Steffensen’s method (SM), (see [1]). Newton and Steffensen’s methods are of second order, both require two functional evaluations per step, but in contrast to Newton’s method, Steffensen’s method is derivative-free.The procedure of removing the derivatives usually increases the number of functional evaluations per iteration. Commonly in the literature the efficiency of an iterative method is measured by theefficiency index defined as I=p1/d (see [2]), where p is the order of convergence and d is the total number of functional evaluations per step. Kung and Traub conjectured in [3] that the order of convergence of any multipoint method cannot exceed the bound 2d-1, (called the optimal order). Thus, the optimal order for methods with 3 or 4 functional evaluations per step would be 4 or 8, respectively.To improve the convergence properties, many variants of Steffensen’s method have been proposed in the last years. Some of these methods use forward or central divided differences for approximating the derivatives. For example, by composing Steffensen and Newton’s methods and using a particular approximation of the first derivative, Liu et al. derive in [4] an optimal fourth-order method, that we denote (LZM), with three functional evaluations per step. The iterative expression is(1.4)xk+1=yk-f[xk,yk]-f[yk,zk]+f[xk,zk]f[xk,yk]2f(yk),k=0,1,…,
where yk is the approximation of the Steffensen’s method, zk=xk+f(xk) and f[x,y]=(f(x)-f(y))/(x-y) is the divided difference of order one.Dehghan and Hajarian [5] proposed a variant of Steffensen’s method (DHM), which is written as(1.5)xk+1=xk-2f(xk)[f(zk+1)-f(xk)]f(xk+f(xk))-f(xk-f(xk)),
where zk+1=xk+2(f(xk))2/(f(xk+f(xk))-f(xk-f(xk))). The method is obtained by replacing the forward-difference approximation in Steffensen’s method by the central-difference approximation. However, it is still a method of third order and requires four functional evaluations per iteration.The authors have also presented in [6] a one-parameter family of optimal fourth-order derivative-free methods, denoted by (CTM), which will be used in this paper as a base in order to achieve higher orders of convergence. The iterative expression of this family is(1.6)yk=xk-f(xk)2f(zk)-f(xk),xk+1=yk-f(yk)(f(yk)-βf(zk))/(yk-zk)+(f(yk)-δf(xk))/(yk-xk),
where parameters β and δ must verify β+δ=1. In the numerical section, we will work with the element of this family obtained by taking β=1 and δ=0.In this paper, the technique used to improve the local order of convergence consists of the composition of two iterative methods of orderp and q, respectively, to obtain a method of order pq (see [1]). Specifically, we compose Newton’s method and the CTM family (1.6). In addition, some particular approximations of the derivative will be made in order to obtain a Steffensen-type method. As we will show, the obtained family of methods is of seventh-order of convergence and requires four evaluations of the function f(x); therefore, this class of methods has efficiency index 71/4≈1.6266, which is higher than 21/2≈1.4142 of the Steffensen’s method, 31/4≈1.3161 of the DHM method (1.5), 41/3≈1.5874 of the LZM (1.4) and CTM (1.6) methods. Therefore, although the methods of the new family are not optimal in the sense of Kung-Traub’s conjecture, they are competitive from the point of view of the efficiency index.Recently, some seventh-order methods have appeared in the literature: for example, Hu and Fang in [7] design a Jarratt-type scheme of order of convergence seven. Its iterative expression is(1.7)zk=yk-2f′(xk)-f′(yk)f′(xk)f(yk)f′(xk),xk+1=zk+f′(xk)+f′(yk)f′(xk)-3f′(yk)f(zk)f′(xk),
where yk is the Newton’s iteration. We will denote this scheme by HFM. Let us note that this method is not derivative-free, and it uses five functional evaluations. So, its efficiency index is 71/5≈1.4758.Noor et al. in [8, Algorithm 2.5] show an iterative method free from second derivative of order seven, with five functional evaluations. Its efficiency index is 71/5≈1.4758 and its iterative expression is(1.8)zk=yk-2f(yk)f′(yk)2(f′(yk))2-f(yk)Pf(xk,yk),xk+1=zk-f′(xk)+3f′(yk)6f′(yk)-2f′(xk)f(zk)f′(xk),
where Pf(xk,yk)=(2/(yk-xk))(2f′(yk)+f′(xk)-3f[yk,xk]). We denote this scheme by NM.Soleymani and Khattri in [9] (Theorem 1), design a derivative-free seventh-order method with four functional evaluations. Its iterative expression is(1.9)yk=xk-f(xk)f[xk,wk],zk=yk-f(yk)f[xk,wk](1+f(yk)f(xk)+f(yk)f(wk)),xk+1=zk-f(zk)f[xk,wk](1+(2-f[xk,wk])f(yk)f(wk)+(11-f[xk,wk])(f(yk)f(xk))2+f(zk)f(yk)),
where wk=xk-f(xk). We denote this method by SKM. Its efficiency index is 71/4≈1.6266.The rest of the paper is organized as follows: in Section2, we describe our family of methods and analyze its convergence order for smooth equations. In Section 3, different numerical tests confirm the theoretical results and allow us to compare this family with other known methods mentioned in this section. We also analyze in this numerical section the behavior of the new family on nonsmooth equations.


## 2. The Methods and Analysis of Convergence

By direct composition of the CTM family (1.6) and Newton’s method, it is easy to see that the scheme(2.1)yk=xk-f(xk)2f(zk)-f(xk),uk=yk-f(yk)(f(yk)-βf(zk))/(yk-zk)+(f(yk)-δf(xk))/(yk-xk),xk+1=uk-f(uk)f′(uk),
where zk=xk+f(xk), is of eighth-order convergence. In order to avoid the evaluation of the first derivative in the last step, we extend the estimation used in (1.6), by replacing f′(uk) by a linear combination of several divided differences:(2.2)f′(uk)≈D(xk)=b1f(uk)-b2f(zk)uk-zk+b3f(uk)-b4f(xk)uk-xk+b5f(uk)-b6f(yk)uk-yk+b7f(yk)-b8f(zk)yk-zk+b9f(yk)-b10f(xk)yk-xk+b11f(zk)-b12f(xk)zk-xk,whereb1,b2,…,b12∈ℝ are parameters. So, we are going to prove that for some values of the parameters the family of methods described by(2.3)yk=xk-f(xk)(f(zk)-f(xk))/f(xk),uk=yk-f(yk)(f(yk)-βf(zk))/(yk-zk)+(f(yk)-δf(xk))/(yk-xk),xk+1=uk-f(uk)D(xk),
is of seventh-order of convergence.Theorem 2.1.
Letα∈I be a simple zero of a sufficiently differentiable function f:I⊆ℝ→ℝ in an open interval I. If x0 is sufficiently close to α, then the iterative method defined by (2.3) has seventh-order of convergence for β=1-δ, b2=1-b8-b4-b10-b6, b11=b12=0, b7=b8+b4+b10, b6=1-b9-b4, b5=1, and b8=-1+b9+b4-b10  and satisfies the error equation
(2.4)xk+1-α=-(1+f′(α))3c22(c22-c3)[(-1+b1+b3+f′(α)(b3-b4))c22-(-2+b1+b3+f′(α)(b3-1))c3c22]ek7+O(ek8),
where ek=xk-α and ck=(1/k!)(f(k)(α)/f′(α)), k=2,3,… and δ,β,b1,b2,…,b12∈ℝ.Proof.
By using Taylor’s expansion aroundx=α, it is easy to observe (see [6]) that if β+δ=1 then,
(2.5)uk-α=(1+f′(α))2c2(c22-c3)ek4-(1+f′(α))(2(2+2f′(α)+f′(α)2)c24-2(4+5f′(α)+2f′(α)2)c22c3+(2+3f′(α)+f′(α)2)c32+(2+3f′(α)+f′(α)2)c2c4)ek5+O(ek6)
and then,
(2.6)f(uk)=f′(α)(1+f′(α))2c2(c22-c3)ek4-f′(α)(1+f′(α))(2(2+2f′(α)+f′(α)2)c24-2(4+5f′(α)+2f′(α)2)c22c3+(2+3f′(α)+f′(α)2)c32+(2+3f′(α)+f′(α)2)c2c4)ek5+O(ek6).
Now, the approximation off′(uk), D(xk), can be written as
(2.7)D(xk)=[b11(1+f′(α))-b12+(b2+b8+b4+b10+b6)+f′(α)(b4-b7+(1+f′(α))(b2-b9)+(2+f′(α))(b10+b8+b11))]c2ek+f′(α)[(b7+b9+f′(α)(b2+b7+b8+b10+b11)-(1+f′(α))(2b6-b5))c22+((3+3f′(α)+f′(α)2)b2+b4+b5-b6-2b7+3b8+2b9+f′(α)(2b2+b5-b6-b7+3b8-3b9)+f′(α)2(b2+b8-b9)+(3+3f′(α)+f′(α)2)(b10+b11))c3]ek2+O(ek3),
and calculating the last step of the iterative process (2.3), we have
(2.8)xk+1-α=(1+f′(α))2c2(c22-c3)×(1-f′(α)b11(1+f′(α))+f′(α)(b2+b8+b4+b10+b6)-b12)ek4+O(ek5).
It is necessary to assign the following values to the parameters in order to assure the sixth-order of convergence:b2=1-b8-b4-b10-b6, b11=b12=0, b7=b8+b4+b10, and b6=1-b9-b4. So, the error equation can be expressed as
(2.9)xk+1-α=(1+f′(α))3c2(c22-c3)((2-b4-b5+b8-b9+b10)c22+(-1+b5)c3c22)ek6+O(ek7).
Finally, ifb5=1 and b8=-1+b9+b4-b10, we have
(2.10)xk+1-α=-(1+f′(α))3c22(c22-c3)[(-1+b1+b3+f′(α)(b3-b4))c22-(-2+b1+b3+f′(α)(b3-1))c3c22]ek7+O(ek8).In terms of computational cost, the methods of this family require only four functional evaluations per step. So, they have efficiency indices71/4=1.6266. If we denote by M7 any element of this family, we can establish(2.11)IM7=ISKM>ICTM=ILZM>INM=IHFM>ISM>IDHM.In the next section, we use the element of family (2.3) obtained by choosing (for simplicity) δ=b1=b3=b4=b9=b10=b11=b12=0 and, therefore, β=1, b2=b6=1, and b7=b8=-1. So, the resulting iterative expression of the method is(2.12)yk=xk-f(xk)2f(zk)-f(xk),uk=yk-f(yk)(f(yk)-f(zk))/(yk-zk)+f(yk)/(yk-xk),xk+1=uk-f(uk)D(xk),
where D(xk)=(f(uk)-f(yk))/(uk-yk)-f(zk)/(uk-zk)-(f(yk)-f(zk))/(yk-zk) and zk=xk+f(xk).It is well known that ifα is a multiple zero of f(x), then α is a simple zero of f(x)/f′(x). In a similar way, for Steffensen-type methods, it is easy to prove that if we use f0(x)=(f(x))2/(f(x+f(x))-f(x)), we transform the problem of solving multiple roots of f(x)=0 into a simple roots one, f0(x)=0. Theoretically, this idea improves the order of convergence but in practice, results are not satisfactory.As we have seen, the method (2.12) has seventh-order convergence for smooth equations but, what is its behavior for nonsmooth equations? As we will see in the next section, for this class of equations our method, in general, loses the seventh-order convergence and stability problems appear. For nonsmooth functions, Amat and Busquier in [10] presented an strategy to control the approximation of the derivative and the stability of the iteration. They applied this idea to Steffensen’s method, obtaining a new scheme (STM):(2.13)xk+1=xk-f(xk)[f(xk+αk|f(xk)|f(xk))-f(xk)]/αk|f(xk)|f(xk),
where the parameters αk∈ℝ allow to control the approximation of the derivative. This procedure can be applied to any other derivative-free scheme. The authors showed the second-order convergence of (2.13) for nonsmooth functions and mentioned that, in order to control the stability in practice, the parameters αk should verify(2.14)tolc≪|αk|f(xk)|f(xk)|≤tolu,wheretolc is related to the computer precision and tolu is a free parameter.In the following section, we will apply this strategy to our proposed method, M7, obtaining a modified scheme that will be denoted as M7mod. Then, we will analyze how this new scheme improves in nonsmooth cases, although the order of convergence at singular points decreases to four.


## 3. Numerical Results

This numerical section is divided into two parts: one devoted to compare the different methods on smooth equations and other in which we analyze the behavior of our method on nonsmooth test functions.In the first part of this section, we use some test functions in order to check the effectiveness of the new high-order method (2.12), we compare it with the classical Steffensen’s method, SM, the method DHM, and the optimal fourth-order methods, LZM and CTM with β=1 and δ=0. These methods are employed to find the zeros of some nonlinear functions, specifically,(i)
f1(x)=sin2x-x2+1,α≈1.404492,(ii)
f2(x)=x2-ex-3x+2,α≈0.257530,(iii)
f3(x)=cosx-x,α≈0.739085,(iv)
f4(x)=(x-1)3-1,α=2,(v)
f5(x)=x3-10,α≈2.154435,(vi)
f6(x)=cos(x)-xex+x2,α≈0.639154,(vii)
f7(x)=ex-1.5-arctan(x),α≈0.767653,(viii)
f8(x)=x3+4x2-10,α≈1.365230,(ix)
f9(x)=8x-cos(x)-2x2,α≈0.128077,(x)
f10(x)=arctan(x),α=0.The complexity of the iterative expressions plays an important role in the computational efficiency of the different methods. So, some authors use another index in order to compare the iterative methods, taking also into account the number of products and quotients involved in each step of the iterative process. Thecomputational efficiency index is defined as CI=p1/(d+op), (see [11]), where p is the order of convergence, d is the number of functional evaluations, and op is the number of products and quotients per iteration. Under the point of view of this index, the relationship between the schemes that we use in this section is(3.1)CICTM(41/8)=CISM(21/4)>CIM7(71/12)=CIHFM>CIDHM(31/7)>CILZM(41/10)>CINM(71/16)>CISKM(71/18).Nowadays, high-order methods are important because numerical applications use high precision in their computations; for this reason, numerical computations have been carried out using variable precision arithmetic in Matlab 7.12 (R2011a) with 500 significant digits. The computer specifications are  Intel(R) Core(TM) i5-2500 CPU @ 3.30 GHz with 16.00 GB of RAM. The stopping criterion used is|xk+1-xk|<10-150 or |f(xk)|<10-150. The information shown in Tables 1 and 2 is, for every method, the number of iterations needed to reach the required tolerance (if the method does not converge, it will be denoted by "nc"), the last value of |xk+1-xk| and |f(xk+1)|, and the approximated computational order of convergence (ACOC) ρ, defined by the authors in [12]:(3.2)ρ=ln⁡⁡(|xk+1-xk|/|xk-xk-1|)ln⁡⁡(|xk-xk-1|/|xk-1-xk-2|).
By means of (3.2), a vector is obtained by using the different iterations calculated in the process. The value of ρ that appears in Tables 1 to  4 is the last coordinate of this vector when the variation between its components is small. Let us note that when the approximated convergence order is not stable (if the difference between two consecutive values is bigger than one unit), we will denote it by ‘—’.Table 1
Numerical results fromf1 to f10.
SMDHMLZMCTMM7f1,x0=0.9|xk+1-xk|3.9289e-1121.7589e-0553.7228e-1221.5049e-1241.9456e-023|f(xk+1)|4.4514e-2232.8819e-164001.8101e-159ACOC2.00003.00004.00004.00006.6629iter97553e-time0.12170.18910.11390.10330.0927f2,x0=1.2|xk+1-xk|1.4587e-1497.6358e-1033.4035e-1382.6499e-1413.1050e-029|f(xk+1)|2.0878e-2982.5787e-306001.0495e-202ACOC2.00003.00004.00004.00006.8723iter911553e-time0.12820.27910.11610.10920.1075f3,x0=2.1|xk+1-xk|8.3630e-0851.9786e-0591.0746e-1431.4483e-1125.6495e-024|f(xk+1)|1.7410e-1691.8682e-177003.7489e-167ACOC2.00003.00004.00004.00007.0731iter86553e-time0.07460.08940.08740.08670.0468f4,x0=2.2|xk+1-xk|1.9109e-1161.8976e-0723.3922e-1101.0118e-1163.4709e-027|f(xk+1)|4.3820e-2311.5033e-214005.1781e-184ACOC2.00003.00004.00004.00006.8325iter106553e-time0.11760.14430.12460.09140.0930f5,x0=2.3|xk+1-xk|7.8747e-0851.2204e-1239.1432e-1428.5347e-1441.2638e-030|f(xk+1)|5.9818e-1670006.8463e-207ACOC2.00003.00004.00004.00006.8181iter107553e-time0.11680.13530.09450.10590.0596f6,x0=2|xk+1-xk|1.4558e-087—2.1767e-1095.9067e-1125.4741e-023|f(xk+1)|5.7398e-174—009.2491e-157ACOC2.0000—4.00004.00005.9331iter8nc553e-time0.1245—0.15760.14180.1226f7,x0=0.5|xk+1-xk|5.1639e-1273.2959e-0791.5312e-0503.3808e-0734.7872e-034|f(xk+1)|9.3020e-2531.1763e-2354.6052e-1997.2079e-2909.9787e-234ACOC2.00003.00003.99994.00006.8055iter116553e-time0.16710.16960.14260.13490.0732f8,x0=1.5|xk+1-xk|1.0817e-1428.4333e-1226.9628e-1362.1376e-1371.1249e-030|f(xk+1)|1.6591e-2820007.6946e-207ACOC2.00003.00004.00004.00006.7788iter117553e-time0.18860.23560.17970.14630.1170f9,x0=0.8|xk+1-xk|2.2055e-1294.6810e-1282.9693e-1397.1679e-1406.1073e-028|f(xk+1)|9.0498e-2570001.6582e-191ACOC2.00003.00004.00004.00006.7613iter156784e-time0.23680.16800.26840.19020.1232f10,x0=0.6|xk+1-xk|2.4132e-0811.3419e-1306.2415e-1411.0766e-0312.7207e-019|f(xk+1)|2.8106e-242001.9282e-1552.1785e-167ACOC3.00005.00005.00004.99228.7406iter75543e-time0.09550.14710.07460.07330.0749Table 2
Numerical results fromf1 to f10 and seventh-order schemes.
HFMSKMNMM7f1,x0=0.9|xk+1-xk|9.2403e-0507.8995e-1041.9456e-023|f(xk+1)|001.8101e-159ACOC—7.00236.6629iter6≥10043e-time0.11260.14040.0927f2,x0=1.2|xk+1-xk|1.1602e-0451.0203e-0366.3747e-0583.1050e-029|f(xk+1)|0001.0495e-202ACOC6.79657.24036.71086.8723iter3433e-time0.06040.14450.11000.1075f3,x0=2.1|xk+1-xk|1.8810e-0409.8612e-0371.4468e-0525.6495e-024|f(xk+1)|0003.7489e-167ACOC6.32286.24016.52257.0731iter3433e-time0.03150.09690.06740.0468f4,x0=2.2|xk+1-xk|5.1064e-034—9.9985e-0423.4709e-027|f(xk+1)|0—05.1781e-184ACOC6.8073—6.91776.8325iter3n.c.33e-time0.0532—0.08420.0930f5,x0=2.3|xk+1-xk|2.6845e-0533.2107e-0251.2399e-0621.2638e-030|f(xk+1)|3.1147e-2079.9146e-1673.1147e-2076.8463e-207ACOC6.95277.16516.97986.8181iter3533e-time0.04060.08940.09610.0596f6,x0=2|xk+1-xk|8.6332e-1241.0547e-0755.4741e-023|f(xk+1)|009.2491e-157ACOC6.99906.99485.9331iter4≥10043e-time0.09110.14090.1226f7,x0=0.5|xk+1-xk|8.9879e-0766.4335e-0451.6607e-0284.7872e-034|f(xk+1)|3.8934e-2081.9467e-2081.1707e-1953.8434e-208ACOC7.01156.87347.23946.8055iter4333e-time0.07470.07570.12140.0732f8,x0=1.5|xk+1-xk|2.1424e-0538.0693e-0631.1249e-030|f(xk+1)|009.3442e-207ACOC6.95286.97836.7788iter3≥10033e-time0.07300.09670.1170f9, x0=0.8|xk+1-xk|1.6408e-0271.3528e-1284.3711e-0396.1073e-028|f(xk+1)|1.5509e-1902.4334e-2081.2167e-2081.6582e-191ACOC7.32436.99997.13166.7613iter3434e-time0.05520.11580.11120.1232f10,x0=0.6|xk+1-xk|2.0089e-035—1.1046e-0512.7207e-019|f(xk+1)|0—02.1785e-167ACOC10.9352—10.92178.7406iter3n.c.33e-time0.0367—0.09220.0749On the other hand, in Tables1 and 2, the mean elapsed time, calculated by means of the command "cputime" of Matlab (e-time), after 100 performances of the program, appears. It can be observed that, in most cases, the elapsed time taken by M7 to obtain the solution is lower than the corresponding ones of the other methods involved. In terms of computational effort, the efficiency of the proposed method is not lower than that of the optimal fourth-order methods. These elapsed times are in concordance with the computational efficiency index of each method.Numerical results in Table1 confirm the theoretical statements developed in this paper, showing that the estimated order of convergence coincides with the theoretical one, except in case f10: the second derivative of this nonlinear function at the solution is zero, so the order of convergence increases: from second to third in SM, from third (and fourth) to fifth in DHM (and LZM or CTM), and from seventh to ninth in M7. Nevertheless, in this case the e-time from the new method M7 does not improve the other ones. In fact, in case f10 the best time is obtained by Steffensen’s method, followed by CTM and DHM. In general, there can be stated that the new high-order scheme improves the results obtained by other known methods, even optimal fourth-order methods such as LZM and CTM.In Table2, we compare the new method M7 with other known seventh-order schemes described in the introduction, HFM, SKM, and NM. It can be observed that M7 performs better than SKM and NM, but HFM is more precise than the rest of methods.Now, we are going to make some numerical tests in order to check how the methods SM and M7 behave in nonsmooth cases. Moreover, we apply theαk-procedure to both methods to avoid some stability problems. In these cases, numerical computations have been carried out using simple precision arithmetic, so tolc=10-16, and the stopping criterion used has been |xk+1-xk|<tolu=10-11 or |f(xk+1)|<tolu=10-11. From a sufficiently small α0, we use the following algorithm to compute the different αk:(3.3)αk+1={αk2if|αk2|f(xk)|f(xk)|≥tolc,tolc∥f(xk)|f(xk)|,elsewhere.The first test has been made on the function:(3.4)f11(x)={x(x+1)ifx<0,-2x(x-1)ifx≥0,that can be found in [13]. We use three initial estimations in order to approximate the three different roots of the equation, {0,1,-1}. In Table 3, we show for each initial estimations and every method, the exact absolute error at first and last iterations, the absolute difference between the two last iterations |xk+1-xk|, the value of f in the last iteration |f(xk+1)|, and the ACOC. From Table 3 it can be inferred that the order of convergence of M7 method decreases to five and stability problems appear when it is applied to nonsmooth equations. Nevertheless, it usually performs better than or equal to Steffensen’s method and its modifications by the αk procedure. Indeed, when this strategy is applied on the seventh-order method (M7mod), the stability of the method is improved and it results in more precise estimations with less iterations. In this example, the ACOC is not stable in some cases.Table 3
Numerical results for functionf11(x).
x0=0.1SMSTM(tolu=10-11)M7M7moditererroritererroritererroritererrorα=014.52e-211.50e-211.50e-312.28e-424.60e-322.32e-423.49e-1120⋮35.38e-83048.32e-94050|xk+1-xk|8.32e-95.38e-83.49e-112.28e-4|f(xk+1)|2.08e-165.80e-153.76e-374.08e-15ACOC2.09192.00004.2042—x0=3itererroritererroritererroritererrorα=110.2910.8013.45e-216.22e-220.1520.2526.91e-1122.35e-9⋮⋮3NaN3057.98e-865.36e-1261.0e-1470xk+1-xk|7.98e-85.36e-12NaN2.35e-9|f(xk+1)|1.27e-140NaN0ACOC1.99972.0000—4.9686x0=-20itererroritererroritererroritererrorα=-1118.4419.2617.1712.31217.8824.3922.3828.82e-2⋮⋮⋮32.29e-10305.65e-581.98e-642.72e-840311.80e-1393.93e-125NaN|xk+1-xk|5.65e-51.98e-6NaN2.29e-8|f(xk+1)|1.80e-133.93e-12NaN0ACOC—1.9991——Table 4
Numerical results for functionf12(x).
x0=2.8SMSTM(tolu=10-11)M7M7moditererroritererroritererroritererrorα=310.4417.14e-310.1717.54e-520.8928.39e-621.69e-1121.0e-14⋮31.17e-1130246.0e-1040250|xk+1-xk|6.0e-101.17e-111.69e-87.54e-5|f(xk+1)|0006.93e-14ACOC2.00091.9984——x0=-2.8itererroritererroritererroritererrorα=-3>10417.14e-315.66e-317.54e-528.39e-624.41e-321.0e-1431.17e-11⋮4042.74e-105NaN|xk+1-xk|1.17e-11NaN7.54e-5|f(xk+1)|0NaN6.93e-14ACOC1.9984——x0=-10itererroritererroritererroritererrorα=-3>10412.4510.7017.98e-220.5520.7323.2e-13⋮⋮52.05e-872.23e-9608NaN|xk+1-xk|2.05e-8NaN7.98e-2|f(xk+1)|0NaN1.95e-12ACOC1.9368——Finally, we consider the nonsmooth function(3.5)f12(x)=|x2-9|.The numerical experiments made on this function are summarized in Table4. In this case, the advantages of the modified methods over original Steffensen’s method and M7 method are more evident when the initial estimation is far from the zero of the function. When the initial estimation is good enough, it is clear that the behavior of M7mod improves lower-order methods, in terms of precision and number of iterations.


## 4. Conclusions

A new seventh-order family of derivative-free iterative methods for solving nonlinear equations has been presented. As only four functional evaluations are required per iteration, the efficiency index of each member of this family is equal to71/4=1.6266. In addition, these methods use a small amount of products and quotients and are derivative-free, which allow us to apply them also to nonsmooth equations with positive and promising results.The generalization of these methods to nonlinear systemsF(x)=0 is similar to the classical Steffensen’s method (see [1]):(4.1)x̃k=xk+αk‖F(xk)‖F(xk),xk+1=xk-[xk,x̃k;F]-1F(xk),where[u,v;F]:ℝn→ℝn is a linear operator such that [u,v;F](u-v)=F(u)-F(v), which is called divided difference.



---

*Source: 836901-2012-05-15.xml*