Research article

Semilocal convergence analysis of an eighth order iterative method for solving nonlinear systems

  • Received: 03 June 2023 Revised: 08 July 2023 Accepted: 11 July 2023 Published: 13 July 2023
  • MSC : 49M15, 65J15, 65G99

  • In this paper, the semilocal convergence of the eighth order iterative method is proved in Banach space by using the recursive relation, and the proof process does not need high order derivative. By selecting the appropriate initial point and applying the Lipschitz condition to the first order Fréchet derivative in the whole region, the existence and uniqueness domain are obtained. In addition, the theoretical results of semilocal convergence are applied to two nonlinear systems, and satisfactory results are obtained.

    Citation: Xiaofeng Wang, Yufan Yang, Yuping Qin. Semilocal convergence analysis of an eighth order iterative method for solving nonlinear systems[J]. AIMS Mathematics, 2023, 8(9): 22371-22384. doi: 10.3934/math.20231141

    Related Papers:

    [1] Lv Zhang, Qingbiao Wu . Modified Newton-EHS method for solving nonlinear problems with complex symmetric Jacobian matrices. AIMS Mathematics, 2023, 8(10): 24233-24253. doi: 10.3934/math.20231236
    [2] Fiza Zafar, Alicia Cordero, Dua-E-Zahra Rizvi, Juan Ramon Torregrosa . An optimal eighth order derivative free multiple root finding scheme and its dynamics. AIMS Mathematics, 2023, 8(4): 8478-8503. doi: 10.3934/math.2023427
    [3] Shubham Kumar Mittal, Sunil Panday, Lorentz Jäntschi, Liviu C. Bolunduţ . Two novel efficient memory-based multi-point iterative methods for solving nonlinear equations. AIMS Mathematics, 2025, 10(3): 5421-5443. doi: 10.3934/math.2025250
    [4] Mudassir Shams, Nasreen Kausar, Serkan Araci, Liang Kong, Bruno Carpentieri . Highly efficient family of two-step simultaneous method for all polynomial roots. AIMS Mathematics, 2024, 9(1): 1755-1771. doi: 10.3934/math.2024085
    [5] Dumitru Baleanu, Babak Shiri . Nonlinear higher order fractional terminal value problems. AIMS Mathematics, 2022, 7(5): 7489-7506. doi: 10.3934/math.2022420
    [6] Xiaofeng Wang, Ying Cao . A numerically stable high-order Chebyshev-Halley type multipoint iterative method for calculating matrix sign function. AIMS Mathematics, 2023, 8(5): 12456-12471. doi: 10.3934/math.2023625
    [7] Xiaofeng Wang, Mingyu Sun . A new family of fourth-order Ostrowski-type iterative methods for solving nonlinear systems. AIMS Mathematics, 2024, 9(4): 10255-10266. doi: 10.3934/math.2024501
    [8] Dalal Khalid Almutairi, Ioannis K. Argyros, Krzysztof Gdawiec, Sania Qureshi, Amanullah Soomro, Khalid H. Jamali, Marwan Alquran, Asifa Tassaddiq . Algorithms of predictor-corrector type with convergence and stability analysis for solving nonlinear systems. AIMS Mathematics, 2024, 9(11): 32014-32044. doi: 10.3934/math.20241538
    [9] G Thangkhenpau, Sunil Panday, Bhavna Panday, Carmen E. Stoenoiu, Lorentz Jäntschi . Generalized high-order iterative methods for solutions of nonlinear systems and their applications. AIMS Mathematics, 2024, 9(3): 6161-6182. doi: 10.3934/math.2024301
    [10] Mudassir Shams, Nasreen Kausar, Serkan Araci, Liang Kong . On the stability analysis of numerical schemes for solving non-linear polynomials arises in engineering problems. AIMS Mathematics, 2024, 9(4): 8885-8903. doi: 10.3934/math.2024433
  • In this paper, the semilocal convergence of the eighth order iterative method is proved in Banach space by using the recursive relation, and the proof process does not need high order derivative. By selecting the appropriate initial point and applying the Lipschitz condition to the first order Fréchet derivative in the whole region, the existence and uniqueness domain are obtained. In addition, the theoretical results of semilocal convergence are applied to two nonlinear systems, and satisfactory results are obtained.



    In mathematics and various sciences, the changes of output and input of nonlinear systems are out of proportion. Most of the systems involved in life are essentially nonlinear, so solving nonlinear problems has attracted various scientists. Scholars have proposed more efficient iterative methods for solving nonlinear systems. One of the most famous iterative methods for solving nonlinear systems is Newton's method [1],

    x(k+1) =x(k)[F(x(k))]1F(x(k)), (1.1)

    for k=0,1,2,..., x0 is the starting point. The Newton's method is second order convergent and effective in solving some nonlinear systems.

    With the advancement of computers and numerical algebra, scholars have developed many iterative methods based on Newton's method that are more efficient than second-order Newton's method for solving nonlinear problems [2,3,4,5,6,7]. In addition, when the Jacobian matrix cannot be calculated for nonlinear systems, some effective derivative free methods can also solve nonlinear systems well (see [8,9,10,11,12]). We propose an eighth order iterative method with high computational efficiency, which is suitable for solving large systems of equations [13]. The specific iteration format is as follows

    {y(k) =x(k)ΓkF(x(k)),w(k)=y(k)[I+(I+54M(k))M(k)]ΓkF(y(k)),x(k+1)=w(k)[I+(I+32M(k))M(k)]ΓkF(w(k)), (1.2)

    where M(k)=Γk(F(x(k))F(y(k))), and Γk=[F(x(k))]1.

    The theoretical results of local convergence and semilocal convergence of the iterative method are also important in the study. Local convergence requires the existence of the assumed solution and the initial value is close enough to the solution. Semilocal convergence does not require the existence of an assumed solution, but the selection of initial values also needs to meet certain conditions (see [14,15,16,17,18]). Therefore, for some systems that cannot be analyzed and solved, the results of semilocal convergence cannot only prove the convergence of iterative sequences, but also prove the existence of solutions of these systems, so as to obtain the existence domain and uniqueness domain of system solutions; for further study (see [19,20,21,22]). Based on this, we perform a semilocal convergence analysis on the method (1.2) .

    This paper consists of five sections. In Section 2 of the paper, the recurrence relation is explained. The semilocal convergence of the iterative method (1.2) is proved in Section 3. In Section 4, the numerical experiments of two nonlinear systems are completed. Finally, the conclusion of this paper is made.

    In this section, let X and Y be Banach spaces and let F:ΩXY be a twice differetiable nonlinear Fréchet operator in an open Ω [23]. Let us assume that the inverse of the Jacobian matrix of the system in the iteration (1.2) is Γ0L(Y,X), which is the set of linear operation from Y to X.

    Moreover, in order to obtain the semilocal convergence result for this iterative method (1.2) , Kantorovich conditions are assumed:

    (M1)Γ0β,

    (M2)Γ0F(x0)η,

    (M3)F(x)F(y)Kxy,

    where K, β, η are non-negative real numbers. For the sake of simplicity, we denote a0=Kβη and define the sequence

    ak+1=akf(ak)2g(ak), (2.1)

    where we use the following auxiliary functions

    h(x)=1256(256+256x+384x2+640x3+576x4+576x5+528x6+298x7+170x8+75x9), (2.2)
    f(x)=11xh(x), (2.3)

    and

    g(x)=x131072(196608+327680x+589824x2+819200x3+1064960x4+1351680x5+1569792x6+1689600x7+1752576x8+1693696x9+1490432x10+1226752x11+913920x12+596928x13+354724x14+180520x15+73600x16+25500x17+5625x18). (2.4)

    These functions play a key role in the analysis that will be performed next.

    Preliminary results. In order to get the difference of the first two elements in the iterative method (1.2) , we have

    w0x0=y0x0[I+(I+54Γ0(F(x0)F(y0)))Γ0(F(x0)F(y0))]Γ0F(y0). (2.5)

    The Taylor series expansion of F around x0 evaluated in y0 is

    F(y0)=F(x0)+F(x0)(y0x0)+y0x0(F(x)F(x0))dx, (2.6)

    where the term F(x0)+F(x0)(y0x0) is equal to zero, since it comes from a Newton's step. With the change x=x0+t(y0x0), we get

    F(y0)=10(F(x0+t(y0x0))F(x0))(y0x0)dt. (2.7)

    Then,

    w0x0=y0x0(I+Γ0(F(x0)F(y0))+54Γ0(F(x0)F(y0))Γ0(F(x0)F(y0)))Γ0F(y0)=y0x0(Γ0F(y0)+Γ0(F(x0)F(y0))Γ0F(y0)+54Γ0(F(x0)F(y0))Γ0(F(x0)F(y0))Γ0F(y0))=y0x0(Γ010(F(x0+t(y0x0))F(x0))(y0x0)dt+Γ0(F(x0)F(y0))Γ010(F(x0+t(y0x0))F(x0))(y0x0)dt+54Γ0(F(x0)F(y0))Γ0(F(x0)F(y0))×Γ010(F(x0+t(y0x0))F(x0))(y0x0)dt). (2.8)

    Taking norms and applying Lipschitz condition, we get

    w0x0y0x0+K2Γ0y0x02+K22Γ0y0x0Γ0y0x02+5K38Γ0y0x0Γ0y0x0Γ0y0x02η+12Kβη2+12K2β2η3+58K3β3η4=η(1+12a0+12a20+58a30), (2.9)

    so that,

    w0x0η(1+12(a0+a20+54a30)). (2.10)

    Using a method similar to (2.5), we get w0y0

    w0y0=y0y0[I+(I+54Γ0(F(x0)F(y0)))Γ0(F(x0)F(y0))]Γ0F(y0). (2.11)

    So,

    w0y0y0y0+K2Γ0y0x02+K22Γ0y0x0Γ0y0x02+5K38Γ0y0x0Γ0y0x0Γ0y0x0212Kβη2+12K2β2η3+58K3β3η4=η(12a0+12a20+58a30). (2.12)

    Next, the next step analysis

    x1x0=w0x0[I+(I+32Γ0(F(x0)F(y0)))Γ0(F(x0)F(y0))]Γ0F(w0). (2.13)

    Using Taylor's expansion of F(w0) around x0 and applying Lipschitz condition, we obtain

    x1x0w0x0+K2Γ0w0x02+K22Γ0y0x0Γ0w0x02+3K34Γ0y0x0Γ0y0x0Γ0w0x02η(1+12(a0+a20+54a30))+Kβη22(1+12(a0+a20+54a30))2+K2β2η32(1+12(a0+a20+54a30))2+3K3β3η44(1+12(a0+a20+54a30))2=η((1+12(a0+a20+54a30))+a02(1+12(a0+a20+54a30))2+a202(1+12(a0+a20+54a30))2+3a304(1+12(a0+a20+54a30))2)=η(1256(256+256a0+384a20+640a30+576a40+576a50+528a60+298a70+170a80+75a90)). (2.14)

    By applying Banach's lemma, one has

    IΓ0F(x1)=Γ0F(x0)Γ0F(x1)=Γ0F(x0)Γ0F(x1)Kβx1x0Kβη(1256(256+256a0+384a20+640a30+576a40+576a50+528a60+298a70+170a80+75a90))=a0(h(a0))<1, (2.15)

    where

    h(x)=1256(256+256x+384x2+640x3+576x4+576x5+528x6+298x7+170x8+75x9).

    Then, as far as a0(h(a0))<1 (by taking a0<0.45807), Banach's lemma guarantees that

    (Γ0F(x1))1=Γ1Γ10

    exists and

    Γ111a0(h(a0))Γ0=f(a0)Γ0, (2.16)

    so

    f(x)=111256(256+256x+384x2+640x3+576x4+576x5+528x6+298x7+170x8+75x9).

    Based on the above analysis, we can obtain the following theorem.

    Theorem 1. For k1, the following conditions are valid:

    (O1k)Γkf(ak1)Γk1,

    (O2k)ykxk=ΓkF(xk)f(ak1)g(ak1)yk1xk1,

    (O3k)KΓkykxkak,

    (O4k)xkxk1h(ak1)yk1xk1.

    Proof. The above theorem is proven through induction. Starting with k=1, (2.16) proved the (O11).

    (O21): The Taylor's expansion of F(x1) around y0, we can get

    F(x1)=F(y0)+F(y0)(x1y0)+x1y0(F(x)F(y0))dx=F(y0)+(F(y0)F(x0))(x1y0)+F(x0)(x1y0)+10(F(y0+t(x1y0))F(y0))(x1y0)dt. (2.17)

    So, we must to have x1y0

    x1y0=w0y0[I+(I+32Γ0(F(x0)F(y0)))Γ0(F(x0)F(y0))]Γ0F(w0). (2.18)

    And bounding its norm, the following inequality is obtained

    x1y0w0y0+K2Γ0w0x02+K22Γ0y0x0Γ0w0x02+3K34Γ0y0x0Γ0y0x0Γ0w0x02η(12a0+12a20+58a30)+Kβη22(1+12(a0+a20+54a30))2+K2β2η32(1+12(a0+a20+54a30))2+3K3β3η44(1+12(a0+a20+54a30))2η(1256(256+384a0+640a20+576a30+576a40+528a50+298a60+170a70+75a80)). (2.19)

    Then, using (2.17)–(2.19), the F(x1) is bounded

    F(x1)12Kη2+Kη2(1256(256+384a0+640a20+576a30+576a40+528a50+298a60+170a70+75a80))+1βη(1256(256+384a0+640a20+576a30+576a40+528a50+298a60+170a70+75a80))+12Kη2(1256(256+384a0+640a20+576a30+576a40+528a50+298a60+170a70+75a80))2. (2.20)

    Therefore, by applying (O11), we get

    y1x1=Γ1F(x1)=f(a0)Γ0F(x1)f(a0)[1131072a0(196608+327680a0+589824a20+819200a30+1064960a40+1351680a50+1569792a60+1689600a70+1752576a80+1693696a90+1490432a100+1226752a110+913920a120+596928a130+354724a140+180520a150+73600a160+25500a170+5625a180)]η. (2.21)

    That is,

    y1x1=f(a0)g(a0)ηf(a0)g(a0)y0x0,

    where,

    g(x)=x131072(196608+327680x+589824x2+819200x3+1064960x4+1351680x5+1569792x6+1689600x7+1752576x8+1693696x9+1490432x10+1226752x11+913920x12+596928x13+354724x14+180520x15+73600x16+25500x17+5625x18).

    (O31): Using (O11) and (O21),

    KΓ1y1x1Kf(a0)Γ0f(a0)g(a0)y0x0=a0f(a0)2g(a0)=a1.

    (O41): For k=1 it has been proven in (2.16).

    The proof of (O1k+1), (O2k+1), (O3k+1) and (O4k+1) is based on the same method of proving that the inductive assumption with (O1k), (O2k), (O3k) and (O4k) as k1 holds true.

    According to the convergence property of xk sequence in Banach space, we need to prove that this sequence is a Cauchy sequence. Based on the auxiliary function, we can obtain the following results.

    Lemma 1. According h(x),f(x) and g(x), we have:

    i. f(x) is inceasing and f(x)>1 for x(0,0.45807),

    ii. h(x) and g(x) are increasing for x(0,0.45807).

    The above lemma can be calculated from the Section 2, and the process is omitted.

    Lemma 2. The f(x) and g(x) defined by (2.3) and (2.4). Then

    i. f(a0)g(a0)<1 for a0<0.252232,

    ii. f(a0)2g(a0)<1 for a0<0.21715,

    iii. the sequence ak is decreasing and ak<0.21715 for k>0.

    Proof. It is straightforword that i, ii are satisfied. As f(a0)2g(a0)<1, then by construction of ak, it is a dereasing sequence. So ak<a00.21715, for all k1.

    Theorem 2. Let X, Y be Banach spaces and F:ΩXY be a nonlinear twice differentiable Fréchet operator in an open set domain Ω. Assume that Γ0=[F(x0)]1 exists in x0Ω and meet the conditions of (M1)(M3). Let be a0=Kβη, and assume that a0<0.21. The sequence {xk} defined in (2.1) and starting in x0 converges to the solution x of F(x)=0, if Be(x0,Rη)=xX:xx0<RηΩ where R=h(a0)1f(a0)g(a0). In the case, the iterates {xk} and {yk} are contained in Be(x0,Rη) and xBe(x0,Rη). In addition, the x is the only solution of equation F(x)=0 in Bn(x0,2KβRη)Ω.

    Proof. By recursively applying (O4k), we can write

    xk+1xkh(ak)ykxkh(ak)f(ak1)g(ak1)yk1xk1h(ak)[k1i=0f(ai)g(ai)]y0x0. (3.1)

    Then,

    xk+mxkxk+mxk+m1+xk+m1xk+m2++xk+1xkh(ak+m1)ηk+m2i=0f(ai)g(ai)+h(ak+m2)ηk+m3i=0f(ai)g(ai)++h(ak)ηk1i=0f(ai)g(ai). (3.2)

    As h(x) is increasing and ak dreasing, it can be stated that

    xk+mxkh(ak)ηm1l=0[k+l1i=0f(ai)g(ai)]h(ak)ηm1l=0(f(a0)g(a0))l+k. (3.3)

    Moreover, according Lemmas 1 and 2, by using the expression for the partial sum of a geometrical series,

    xk+mxkh(ak)1(f(a0)g(a0))m1f(a0)g(a0)(f(a0)g(a0))kη. (3.4)

    So, the Cauchy sequence if and only if f(a0)g(a0)<1 (Lemma 2).

    For k=0,

    xmx0xmxm1+xm1xm2++x1x0h(a0)y0x0m1r=0(f(a0)g(a0))r.=h(a0)1(f(a0)g(a0))m1f(a0)g(a0)η<Rη, (3.5)

    when m, we get the radius od convergence Rη=h(a0)1f(a0)g(a0)η.

    Let's prove that x is the solution of F(x)=0 starting from the boundary of F(xn),

    F(xk)F(x0)+F(xk)F(x0)F(x0)+Kxkx0F(x0)+KRη. (3.6)

    Then, acorrding M2 and (3.1)

    F(xk)F(xk)ykxkF(xk)h(ak)[n1i=0f(ai)g(ai)]η, (3.7)

    as h(x), f(x) and g(x) are increasing and ak is the decreasing sequence,

    F(xk)F(xk)h(ak)(f(a0)g(a0))kη. (3.8)

    Taking into account that F(xk) is bounded and (f(a0)g(a0))k tends to zero when k, we conclude that F(xk)0. As F is continuous in Ω, then F(x)=0.

    Finally, the uniqueness of x in B(x0,2KβRη)Ω.

    0=F(y)F(x)=(F(x)+10F(x+t(yx))(yx)dt)(F(x)=(yx)10F(x+t(yx))dt). (3.9)

    In order to guarantee that yx=0 it is necesssary to prove that operator 10F(x+t(yx))dt is invertible. Applying hypothesis (M3),

    Γ010F(x+t(yx))F(x0)dtKβ10x+t(yx)x0dtKβ10((1t)xx0+tyx0)dt<Kβ2(Rη+2KβRη)=1. (3.10)

    By the Banach lemma, the intergal operator is invertible and hence y=x.

    In this section, we provide some numerical examples to illustrate the theoretical results introduced earlier.

    Example 1. Hammerstein equation is a kind of important nonlinear integral equation [24], which is given as follows:

    x(s)=1+(1/5)10N(s,t)x(t)3dt, (4.1)

    where xC[0,1],s,t[0,1], with the kernel N is

    N(s,t)={(1s)tts,s(1t)st.

    To solve (4.1) we transform it into a syste of nonlinear equations through a discretization process. We approximate the integral appearing in Eq (4.1) by using Gauss-Legendre quadrature,

    10s(t)dt7i=1wjs(tj),

    being tj and wj the nodes and the weights of the Gauss-Legendre polynomial. Denoting the approximation of x(tj) as xi,i=1,...,7, then we estimate (4.1) with the nonlinear system of equations

    xi1157j=1aijx3j=0,i=1,...,7 (4.2)

    where

    aij={wjtj(1ti)ji,wjti(1tj)i<j.

    So, the system can be rewritten as

    F(x)=x115Avx,vx=(x31,x32,...,x37)T,
    F(x)=I35AD(x),D(x)=diag(x21,x22,...,x27),

    where F if a nonlinear operator in the Banach space RL, and F is its Fréchet derivative in L(RL,RL).

    According the method (1.2), we will use it to solve the nonlinear systems.

    Taking x0=(1.8,1.8,...,1.8)T,L=7 and the infinity norm, we get

    Γ0β,β1.2559,Γ0F(x0)η,η2.2062,F(x)F(y)kxy,k0.0671,a0=kβη,0.1860. (4.3)

    The above results satisfy the semilocal convergence condition, so this method can be applied to the system. Thus, we guarantee the existence of the solution in Be(x0,0.5646), and the uniqueness in Bn(x0,22.4874). Table 1 shows the the radius of the existence domain and the radius of the unique domain under different initial values. For x0i>1.87,i=1,2,...,7, convergence conditions are not satisfied and, therefore, the convergence is not guaranteed.

    Table 1.  Different initial values related parameters.
    x0i β η k a0 Re Rn
    0.2 1.0025 2.1204 0.0287 0.0610 0.0754 69.3528
    0.4 1.0102 1.6005 0.0337 0.0545 0.0657 58.6428
    0.6 1.0232 1.0827 0.0390 0.0433 0.0500 50.0651
    0.8 1.0420 0.5637 0.0451 0.0265 0.0288 42.5422
    1.0 1.0671 0.0461 0.0682 0.0034 0.0034 27.4813
    1.2 1.0996 0.4949 0.0505 0.0275 0.0300 36.0019
    1.4 1.1406 1.0420 0.0569 0.0676 0.0859 30.7271
    1.6 1.1919 1.6098 0.0622 0.1193 0.1970 26.6603
    1.7 1.2222 1.9038 0.0647 0.1505 0.3107 24.7005

     | Show Table
    DownLoad: CSV

    Using the iterative method (1.2) to solve (4.2), the exact solution is

    x=(1.003,1.012,1.023,1.028,1.023,1.012,1.003)T.

    Example 2. Let X=Y=R2 be equipped with the max-norm. Choose: x0=(0.9,0.9)T, s[0,12). Let s=0.49, define function F by

    F(x)=(x31s,x32s)T,x=(x1,x2)T. (4.4)

    The fréchet-derivative of operator F is given by

    F(x)=[3x21003x2].

    Taking x0=(0.9,0.9)T and the infinity norm, we get

    Γ0β,β0.4115,Γ0F(x0)η,η0.1391,F(x)F(y)kxy,k3.6113,a0=kβη,0.2067. (4.5)

    The convergence conditions are met and consequently the method can be applied to the system. The existence domain of the solution is Be(x0,0.9101), and the uniqueness domain is Bn(x0,1.2192).

    Taking x0=(0.73,0.73)T and the infinity norm, then

    Γ0β,β0.6255,Γ0F(x0)η,η0.0893,F(x)F(y)kxy,k3.2329,a0=kβη,0.1806. (4.6)

    The existence domain of the solution is Be(x0,0.5095), and the uniqueness domain is Bn(x0,0.943534).

    When the initial value satisfies the Kantorovich condition and the range of a0 obtained, the initial value within that range is taken to solve the system. Iterative method (1.2) for solving nonlinear (4.4) with roots of x=(0.7884,0.7884)T.

    Similar results can be obtained in Tables 2 and 3, that is, under the Kantorovich condition, by selecting different initial values, we can converge to a unique solution. When the initial value is closer to the root, the error estimate is lower. This semilocal convergence that can prove the existence and uniqueness of solutions under certain assumptions is very valuable.

    Table 2.  Numberical results of method (1.2) for nonliner equation.
    x0i iter xkxk1 F(xk)
    0.2 4 7.469e-336 2.149e-2021
    0.4 4 2.538e-352 4.629e-2120
    0.6 4 1.755e-383 8.222e-2307
    0.8 4 5.848e-445 2.318e-2675
    1.0 4 2.629e-701 3.000e-4096
    1.2 4 2.221e-467 5.991e-2809
    1.4 4 1.935e-353 8.489e-2126
    1.6 4 8.010e-286 2.379e-1720
    1.7 4 7.450e-259 1.285e-1558

     | Show Table
    DownLoad: CSV
    Table 3.  Numberical results of method (1.2) for nonliner equation.
    x0i iter xkxk1 F(xk) ρ
    0.72 4 4.048e-331 1.878e-2640 8
    0.74 4 2.665e-419 6.432e-3346 8
    0.76 4 1.046e-548 3.726e-4381 8
    0.78 4 2.052e-830 1.000e-6000 8
    0.8 4 2.246e-767 1.000e-6000 8
    0.82 4 2.005e-554 6.803e-4427 8
    0.84 4 1.127e-454 6.768e-3629 8
    0.86 4 9.380e-391 1.559e-3117 8
    0.88 4 1.414e-344 4.163e-2748 8
    0.9 4 5.796e-309 3.313e-2463 8

     | Show Table
    DownLoad: CSV

    In this paper, the semilocal convergence of the eighth order iterative method (1.2) is studied. By analyzing the behavior of the iterative method under the Kantorovich condition, the Lipschitz condition is applied to the first derivative, and the theory of semilocal convergence of the iterative method is obtained by using the recurrence relation. The existence and uniqueness domain of the solution of the nonlinear system is obtained. In the experimental part, a classical Hammerstein nonlinear integral equation and a matrix function are solved. The experimental results are consistent with expectations, and the high-precision approximation of the system solution also proves the effectiveness of the method numerically.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This research was supported by the National Natural Science Foundation of China (No. 61976027), the Natural Science Foundation of Liaoning Province (Nos. 2022-MS-371, 2023-MS-296), Educational Commission Foundation of Liaoning Province of China (Nos. LJKMZ20221492, LJKMZ20221498) and the Key Project of Bohai University (No. 0522xn078).

    The authors declare no conflicts of interest.



    [1] J. M. Ortega, W. C. Rheinboldt, Iterative solution of nonlinear equations in several variables, New York: Academic Press, 1970. https://doi.org/10.1016/C2013-0-11263-9
    [2] R. Behl, S. Bhalla, Á. A. Magrenán, S. Kumar, An efficient high order iterative scheme for large nonlinear systems with dynamics, J. Comput. Appl. Math., 404 (2022), 113249. http://dx.doi.org/10.1016/j.cam.2020.113249 doi: 10.1016/j.cam.2020.113249
    [3] C. Chun, B. Neta, Developing high order methods for the solution of systems of nonlinear equations, Appl. Math. Comput., 342 (2019), 178–190. http://dx.doi.org/10.1016/j.amc.2018.09.032 doi: 10.1016/j.amc.2018.09.032
    [4] X. Wang, Y. Cao, A numerically stable high-order Chebyshev-Halley type multipoint iterative method for calculating matrix sign function, AIMS Math., 8 (2023), 12456–12471. http://dx.doi.org/10.3934/math.2023625 doi: 10.3934/math.2023625
    [5] X. Wang, W. Li, Stability analysis of simple root seeker for nonlinear equation, Axioms, 12 (2023), 215. https://doi.org/10.3390/axioms12020215 doi: 10.3390/axioms12020215
    [6] T. Zhanlav, K. Otgondorj, Higher order Jarratt-like iterations for solving systems of nonlinear equations, Appl. Math. Comput., 395 (2021), 125849. https://dx.doi.org/10.1016/j.amc.2020.125849 doi: 10.1016/j.amc.2020.125849
    [7] S. Regmi, Optimized iterative methods with applications in diverse disciplines, New York: Nova Science Publishers, Inc., 2021.
    [8] B. Neta, A new derivative-free method to solve nonlinear equations, Mathematics, 9 (2021), 583. http://dx.doi.org/10.3390/math9060583 doi: 10.3390/math9060583
    [9] C. Chun, B. Neta, An efficient derivative-free method for the solution of systems of equations, Numer. Func. Anal. Opt., 42 (2021), 834–848. http://dx.doi.org/10.1080/01630563.2021.1931313 doi: 10.1080/01630563.2021.1931313
    [10] R. Behl, A. Cordero, J. R. Torregrosa, A new higher-order optimal derivative free scheme for multiple roots, J. Comput. Appl. Math., 404 (2022), 113773. http://dx.doi.org/10.1016/j.cam.2021.113773 doi: 10.1016/j.cam.2021.113773
    [11] M. Kansal, A. S. Alshomrani, S. Bhalla, R. Behl, M. Salimi, One parameter optimal derivative-free family to find the multiple roots of algebraic nonlinear equations, Mathematics, 8 (2020), 2223. http://dx.doi.org/10.3390/math8122223 doi: 10.3390/math8122223
    [12] J. R. Sharma, S. Kumar, L. Jantschi, On derivative free multiple-root finders with optimal fourth order convergence, Mathematics, 8 (2020), 1091. http://dx.doi.org/10.3390/math8071091 doi: 10.3390/math8071091
    [13] X. Wang, Fixed-point iterative method with eighth-order constructed by undetermined parameter technique for solving nonlinear systems, Symmetry, 13 (2021), 863. http://dx.doi.org/10.3390/sym13050863 doi: 10.3390/sym13050863
    [14] I. K. Argyros, S. George, On the complexity of extending the convergence region for Traub's method, J. Complexity, 56 (2020), 101423. http://dx.doi.org/10.1016/j.jco.2019.101423 doi: 10.1016/j.jco.2019.101423
    [15] I. K. Argyros, S. George, Ball comparison between four fourth convergence order methods under the same set of hypotheses for solving equations, Int. J. Appl. Comput. Math., 7 (2021), 9. http://dx.doi.org/10.1007/S40819-020-00946-8 doi: 10.1007/S40819-020-00946-8
    [16] I. K. Argyros, A new convergence theorem for the Steffenssen method in Banach space and applications, Rev. Anal. Numér. Théor. Approx, 29 (2000), 119–127.
    [17] A. Cordero, E. G. Villalba, J. R. Torregrosa, P. Triguero-Navarro, Convergence and stability of a parametric class of iterative schemes for solving nonlinear systems, Mathematics, 9 (2021), 86. http://dx.doi.org/10.3390/math9010086 doi: 10.3390/math9010086
    [18] I. K. Argyros, S. George, S. Shakhno, H. Yarmola, Perturbed Newton methods for solving nonlinear equations with applications, Symmetry, 14 (2022), 2206. http://dx.doi.org/10.3390/sym14102206 doi: 10.3390/sym14102206
    [19] A. Cordero, J. G. Maimó, E. Martinez, J. R. Torregrosa, Semilocal convergence of the extension of Chun's method, Axioms, 10 (2021), 161. http://dx.doi.org/10.3390/axioms10030161 doi: 10.3390/axioms10030161
    [20] S. Amat, M. A. Hernández, N. Romero, Semilocal convergence of a sixth order iterative method for quadratic equations, Appl. Numer. Math., 62 (2012), 833–841. http://dx.doi.org/10.1016/j.apnum.2012.03.001 doi: 10.1016/j.apnum.2012.03.001
    [21] A. Cordero, M. A. Hernández-Verón, N. Romero, J. R. Torregrosa, Semilocal convergence by using recurrence relations for a fifth-order method in Banach spaces, J. Comput. Appl. Math., 273 (2015), 205–213. http://dx.doi.org/10.1016/j.cam.2014.06.008 doi: 10.1016/j.cam.2014.06.008
    [22] M. A. Hernández-Verón, E. Martinez, C. Teruel, Semilocal convergence of a k-step iterative process and its application for solving a special kind of conservative problems, Numer. Algor., 76 (2017), 309–331. http://dx.doi.org/10.1007/s11075-016-0255-z doi: 10.1007/s11075-016-0255-z
    [23] V. Candela, A. Marquina, Recurrence relations for rational cubic models Ⅱ: the Chebyshev method, Computing, 45 (1990), 355–367. http://dx.doi.org/10.1007/BF02238803 doi: 10.1007/BF02238803
    [24] J. A. Ezquerro, M. A. Hernández-Verón, Halley's method for operators with unbounded second derivative, Appl. Numer. Math., 57 (2007), 354–360. http://dx.doi.org/10.1016/j.apnum.2006.05.001 doi: 10.1016/j.apnum.2006.05.001
  • This article has been cited by:

    1. Wenshuo Li, Xiaofeng Wang, Ball convergence analysis of Jarratt-type sixth-order method and its applications in solving some chemical problems, 2024, 43, 2238-3603, 10.1007/s40314-023-02517-1
    2. Xiaofeng Wang, Dongdong Ruan, Convergence ball of a new fourth-order method for finding a zero of the derivative, 2024, 9, 2473-6988, 6073, 10.3934/math.2024297
    3. Dongdong Ruan, Xiaofeng Wang, On the convergence of a new fourth-order method for finding a zero of a derivative, 2024, 9, 2473-6988, 10353, 10.3934/math.2024506
    4. Alicia Cordero, Juan R. Torregrosa, Paula Triguero-Navarro, First optimal vectorial eighth-order iterative scheme for solving non-linear systems, 2025, 498, 00963003, 129401, 10.1016/j.amc.2025.129401
    5. Dongdong Ruan, Xiaofeng Wang, A high-order Chebyshev-type method for solving nonlinear equations: local convergence and applications, 2025, 33, 2688-1594, 1398, 10.3934/era.2025065
    6. Eulalia Martínez, Arleen Ledesma, Semilocal Convergence Domain of a Chandrasekhar Integral Equation, 2025, 17, 2073-8994, 767, 10.3390/sym17050767
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1653) PDF downloads(77) Cited by(6)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog