Abstract
Our aim in this article is to suggest an extended local convergence study for a class of multi-step solvers for nonlinear equations valued in a Banach space. In comparison to previous studies, where they adopt hypotheses up to 7th Fŕechet-derivative, we restrict the hypotheses to only first-order derivative of considered operators and Lipschitz constants. Hence, we enlarge the suitability region of these solvers along with computable radii of convergence. In the end of this study, we choose a variety of numerical problems which illustrate that our works are applicable but not earlier to solve nonlinear problems.
Keywords:
local convergence; multi-step iterative solver; Lipschitz constant; order of convergence; Banach space MSC:
65G99; 65H10; 47J25; 47J05; 65D10; 65D99
1. Introduction
Finding the approximate solution of
is one of the top priorities in the field of Numerical analysis. We assume that is a Fréchet-differentiable operator, are Banach spaces and is a convex subset of . The is known as the set of bounded linear operators.
The problem of finding an approximate unique solution is very important, since many problems can be written as Equation (1) in References [1,2,3,4,5,6,7,8]. However, it is not always possible to access the solution in an explicit form. Hence, most of the solvers are iterative in nature. The analysis of solvers involves local convergence that stands on the knowledge around . It also ensures the convergence of iteration procedures. One of the most significant tasks in the analysis of iterative procedures is to yield the convergence region. Hence, it is essential to suggest the radius of convergence.
We redefine the iterative solver suggested in Reference [7], for all as
where is a starting guess, is a -order iteration function solver (for ) and
stands for the first-order Fŕechet-derivative of F. The study of these methods is important for various reasons already stated in Reference [7]. For brevity we refer the reader to Reference [7] and the references therein. On top of those reasons, we also mention that method (2) generalizes the existing widely used Newton’s type methods such as Newton’s, Traub’s and other methods. So, it is important to study these methods under the same set of convergence criteria. Keeping the linear operator frozen is also a very cheap and efficient way of increasing the order of convergence. The convergence order of (2) was given in Reference [7] but using hypotheses up to the 7th-order derivative of function F. Only the 1st-order derivative emerges in scheme (2). Such conditions hamper the suitability of solver (2). Consider function F with on by
Using this definition, we get
and
It is clear from the above that the 3rd-order derivative of is unbounded in . We have plenty of research articles on iterative solvers [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26]. The local convergence analysis of these solvers traditionally requires the usage of Taylor expansions and the operator involved must be sufficiently many times differentiable in a neighborhood of the solution . This way, the convergence order is established but derivatives of an order higher than one do not appear in these solvers, as we saw previously with the motivational example restricting the applicability of solvers. Another problem is that this approach does not provide error estimates on that can be used to predetermine the number of steps required to attain a prescribed error tolerance. The uniqueness of the solution also cannot be established in any set containing it. Moreover, the starting guess is a shot in the dark. Therefore, it is important to find a technique other than the preceding. This is what we offer in this article. Furthermore, (COC) and (ACOC) [27] are used to compute the convergence order (to be explained in Remark 1 (d)).
These formulas do not require higher than one derivative, and in the case of ACOC, knowledge of is not needed. It is worth noting that the iterates are obtained by using (2), which involves the first derivative. Hence, these iterates also depend on the first derivative (see Remark 1 (d)). Our techniques can be used on other solvers to extend their applicability in a similar fashion.
2. Local Convergence
Here, we present a study of local convergence for solver (2). For this, we consider a function which is nondecreasing and continuous such that . We assume
has a minimal positive solution .
Define functions and on the interval by
where and functions are also nondecreasing and continuous, satisfying . We have that and , as . Then, by the intermediate value theorem, we notice that the functions and have solutions in the interval . Call as and the smallest such solutions in of the functions and , respectively. Assume has minimal positive solution . Consider functions
These functions are defined in the interval , where . Consider functions on as
where
Then, and as . Defined by be the minimal solutions of corresponding to functions in .
Set r as
Then, it follows
and for all
and
Let , be, respectively, open and closed balls in centered at and of radius . Next, the local convergence analysis of solver (2) follows.
Theorem 1.
Let be a differentiable operator. Let and be a nondecreasing continuous function such that . The parameter be defined by (4). Suppose that there exists such that
and
Moreover, suppose that for all
and
Then, generated for by solver (2) is well defined, remains in for all and converges to μ, so that
and
Further, if
then, μ is the only solution of equation in .
Proof.
We select mathematical induction to show that expressions (18)–(21) are satisfied. Using hypotheses , (4), (5) and (13), we yield
Therefore, , are well defined, and
Using (2), (5), (8), (9), (11) (for ), (28) and (31), we obtain
so (20) holds for and . In an analogous way, we obtain for that
which implies (20) holds for and
In view of solver (2), (5), (11) (for ) and the proceeding estimates
showing (21) (for ) with . Now, change , and by , and in the preceding estimates. Hence, we attain (18)–(21). By adopting
we have with . Finally, for the uniqueness of required solution, we assume that satisfying . Set , so
Hence, Q is invertible. Then,
yields . ☐
Remark 1.
- (a)
- Indeed, we have
- (b)
- (c)
- If are constants functions, thenandwhere is the radius for Newton’s solver [14].Rheinboldt [26] and Traub [6] also provided radius of convergence instead ofand by Argyros [1,2]where is a constant for (9) on D, sosoand
- (d)
- By adopting conditions to the 7th-order derivative of operator F, the order of the convergence of solver (2) was given in Reference [7]. We assume hypotheses only on the 1st-order derivative of operator F. For obtaining the order of convergence, we adoptedorthe computational order of convergence COC and the approximate computational order of convergence ACOC [28,29], respectively. These definitions can also be found in Reference [27]. They do not require derivatives higher than one. Indeed, notice that to generate iterates and therefore compute ξ and , we need to use the formula (2) using only the first derivatives. It is vital to note that ACOC does not need the prior information of exact root μ.
- (e)
- Consider F satisfying the autonomous differential equation [1,2] ofwhere P is a given and continuous operator. Then, our results apply but without knowledge of and choose . Hence, we select .
3. Concrete Applications
Here, we illustrate the theoretical consequences suggested in Section 2. We choose and , in all examples. Next, we provide numerical examples given as follows:
Example 1.
Choose , where . We study the mixed Hammerstein-like equation [4,18], defined as follows:
where
defined in . The solution is the same as zero of (1), where , given as:
But
and
so since ,
Then, we consider
and
by Remark 1. But is not Lipschitz, so earlier studies [4,7] are not applicable to solving this problem. On the other hand, our technique does not exhibit this kind of behavior. The different radii of convergence mentioned in Table 1.
Table 1.
Distinct radii of convergence.
Example 2.
Describing the movement of a particle in 3-D by the following system of differential equations
with for . Define by function given as follows:
So, we obtain
Then, we have for that and . The different radii of convergence mentioned in Table 2.
Table 2.
Distinct radii of convergence.
Example 3.
Let us choose , facilitated by the max norm. Set and choose a function F on A
We have that
Then, we have that and . So, we yield the Table 3, where we calculated distinct radii of convergence.
Table 3.
Distinct radii of convergence.
Example 4.
By the academic problem that we considered in the introduction, we yield and . So, we have the different radii of convergence depicted in Table 4.
Table 4.
Distinct radii of convergence.
4. Application of Our Scheme on Large System of Nonlinear Equations
We cited the , , and as the index of number of iteration, absolute residual errors, errors among two iterations and computational convergence order, respectively, in Table 5, Table 6 and Table 7.
Table 5.
Computational results on a boundary value problem 5.
Table 6.
Computational results of 2D Bratu problem in Example 6.
Table 7.
Computational results on Example 7.
The whole calculation is performed in the Mathematica software (Version-9, Wolfram Research, Champaign, IL, USA). We consider at least 1000 digits of mantissa in order to minimize the round-off errors. The notation employs .
Example 5.
We assume here a boundary value problem [30], which is given by
Further, we chosen a σ-point partition of in the following way:
Furthermore, we assume that . By adopting the following technique for removing derivatives for problem (61)
We have
a system of nonlinear equations (SNE) of order . We choose the starting approximation . We solved the problem for a SNE by choosing . We obtained the following solution
We depicted the numerical out comes in Table 5.
Example 6.
We choose a prominent 2D Bratu problem [31,32], which is given by
Let us assume that is a numerical result over the grid points of the mesh. In addition, we consider that and are the number of steps in the direction of x and t, respectively. Moreover, we choose that h and k are the respective step sizes in the direction of x and y, respectively. In order to find the solution of PDE (62), we adopt the following approach
which further yields the succeeding SNE
By choosing and , we get a large SNE of order . The starting point is
and results are depicted in Table 6.
Example 7.
Finally, we deal with succeeding SNE
In order to access a giant system of nonlinear equations of order , we pick . In addition, we consider the following starting approximation for this problem:
and converges to . The attained computation outcomes are illustrated in Table 7.
5. Concluding Remarks
Recently, there has been a surge in the development of multi-step solvers for nonlinear equations. In this article, we present a unifying local convergence of solver (2), relying only on the first derivative. This way, we expand the applicability of these solvers. Notice that in earlier studies that are special cases of (2), higher than one derivatives are used, which do not appear in the solver. Moreover, no bounds on the distances are provided, nor uniqueness theorems. Furthermore, we provide computable bounds and uniqueness of solutions. This is where the novelty of our article lies. Numerical and applications are also given to test the convergence conditions. In our application, we solve the 2D-Bratu, BVP problems as well as a system of nonlinear equations of .
Author Contributions
R.B. and I.K.A.: Conceptualization; Methodology; Validation; Writing—Original Draft Preparation; Writing—Review & Editing. All authors have read and agreed to the published version of the manuscript.
Funding
Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia, under Grant No. D-237-130-1440.
Acknowledgments
This project was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant No. (D-237-130-1440). The authors, therefore, gratefully acknowledge the DSR technical and financial support.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Argyros, I.K. Convergence and Application of Newton-type Iterations; Springer: New York, NY, USA, 2008. [Google Scholar]
- Argyros, I.K.; Hilout, S. Computational Methods in Nonlinear Analysis; World Scientific Publishing Company: Hackensack, NJ, USA, 2013. [Google Scholar]
- Cordero, A.; Torregrosa, J.R.; Vassileva, M.P. Increasing the order of convergence of iterative schemes for solving nonlinear system. J. Comput. Appl. Math. 2012, 252, 86–94. [Google Scholar] [CrossRef] [Scilit]
- Hernández, M.A.; Martinez, E. On the semilocal convergence of a three steps Newton-type process under mild convergence conditions. Numer. Algor. 2015, 70, 377–392. [Google Scholar] [CrossRef] [Scilit]
- Sharma, J.R.; Ghua, R.K.; Sharma, R. An efficient fourth-order weighted-Newton method for system of nonlinear equations. Numer. Algor. 2013, 62, 307–323. [Google Scholar] [CrossRef] [Scilit]
- Traub, J.F. Iterative Methods for the Solution of Equations; Prentice- Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
- Xiao, X.; Yin, H. Achieving higher order of convergence for solving systems of nonlinear equations. Appl. Math. Comput. 2017, 311, 251–261. [Google Scholar] [CrossRef] [Scilit]
- Potra, F.A.; Pták, V. Nondiscrete introduction and iterative process; Research Notes in Mathematics Volume 103; Pitman Advanced Publishing Program: Boston, MA, USA, 1984. [Google Scholar]
- Montazeri, H.; Soleymani, F.; Shateyi, S.; Motsa, S.S. On a new method for computing the numerical solution of systems of nonlinear equations. J. Appl. Math. 2012, 2012, 751975. [Google Scholar] [CrossRef] [Scilit]
- Amat, S.; Busquier, S.; Plaza, s.; Guttiérrez, J.M. Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 2003, 157, 197–205. [Google Scholar] [CrossRef] [Scilit]
- Amat, S.; Busquier, S.; Plaza, S. Dynamics of the King and Jarratt iterations. Aequ. Math. 2005, 69, 212–223. [Google Scholar] [CrossRef] [Scilit]
- Amat, S.; Hernández, M.A.; Romero, N. A modified Chebyshev’s iterative method with at least sixth order of convergence. Appl. Math. Comput. 2008, 206, 164–174. [Google Scholar] [CrossRef] [Scilit]
- Argyros, I.K.; George, S. Local convergence of some higher-order Newton-like method with frozen derivative. SeMA J. 2015, 70, 47–59. [Google Scholar] [CrossRef] [Scilit]
- Argyros, I.K.; Magreñán, Á.A. Ball convergence theorems and the convergence planes of an iterative methods for nonlinear equations. SeMA J. 2015, 71, 39–55. [Google Scholar]
- Argyros, I.K.; Magreñán, Á.A. On the convergence of an optimal fourth-order family of methods and its dynamics. Appl. Math. Comput. 2015, 252, 336–346. [Google Scholar] [CrossRef] [Scilit]
- Cordero, A.; Torregrosa, J.R. Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 2007, 190, 686–698. [Google Scholar] [CrossRef] [Scilit]
- Cordero, A.; Torregrosa, J.R. Variants of Newton’s method for functions of several variables. Appl. Math. Comput. 2006, 183, 199–208. [Google Scholar] [CrossRef] [Scilit]
- Ezquerro, J.A.; Hernández, M.A. New iterations of R-order four with reduced computational cost. BIT Numer. Math. 2009, 49, 325–342. [Google Scholar] [CrossRef] [Scilit]
- Ezquerro, J.A.; Hernández, M.A. A uniparametric Halley type iteration with free second derivative. Int. J. Pure and Appl. Math. 2003, 6, 99–110. [Google Scholar]
- Gutiérrez, J.M.; Hernández, M.A. Recurrence relations for the super-Halley method. Comput. Math. Appl. 1998, 36, 1–8. [Google Scholar] [CrossRef] [Scilit]
- Gutiérrez, J.M.; Magreñán, Á.A.; Romero, N. On the semilocal convergence of Newton–Kantorovich method under center-Lipschitz conditions. Appl. Math. Comput. 2013, 221, 79–88. [Google Scholar] [CrossRef] [Scilit]
- Kou, J. A third-order modification of Newton method for systems of nonlinear equations. Appl. Math. Comput. 2007, 191, 117–121. [Google Scholar]
- Magreñán, Á.A. Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 2014, 233, 29–38. [Google Scholar]
- Magreñán, Á.A. A new tool to study real dynamics: The convergence plane. Appl. Math. Comput. 2014, 248, 215–224. [Google Scholar] [CrossRef] [Scilit]
- Petkovic, M.S.; Neta, B.; Petkovic, L.; Džunič, J. Multipoint Methods for Solving Nonlinear Equations; Academic Press: New York, NY, USA, 2013. [Google Scholar]
- Rheinboldt, W.C. An adaptive continuation process for solving systems of nonlinear equations. Banach Ctr. Publ. 1978, 3, 129–142. [Google Scholar] [CrossRef] [Scilit]
- Weerakoon, S.; Fernando, T.G.I. A variant of Newton’s method with accelerated third order convergence. Appl. Math. Lett. 2000, 13, 87–93. [Google Scholar] [CrossRef] [Scilit]
- Beyer, W.A.; Ebanks, B.R.; Qualls, C.R. Convergence rates and convergence-order profiles for sequences. Acta Appl. Math. 1990, 20, 267–284. [Google Scholar] [CrossRef] [Scilit]
- Potra, F.A. On Q-order and R-order of convergence. J. Optim. Theory Appl. 1989, 63, 415–431. [Google Scholar] [CrossRef] [Scilit]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
- Kapania, R.K. A pseudo-spectral solution of 2-parameter Bratu’s equation. Comput. Mech. 1990, 6, 55–63. [Google Scholar] [CrossRef] [Scilit]
- Simpson, R.B. A method for the numerical determination of bifurcation states of nonlinear systems of equations. SIAM J. Numer. Anal. 1975, 12, 439–451. [Google Scholar] [CrossRef] [Scilit]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).