Abstract
We present the semilocal convergence of a multi-step modified Newton-Hermitian and Skew-Hermitian Splitting method (MMN-HSS method) to approximate a solution of a nonlinear equation. Earlier studies show convergence under only Lipschitz conditions limiting the applicability of this method. The convergence in this study is shown under generalized Lipschitz-type conditions and restricted convergence domains. Hence, the applicability of the method is extended. Moreover, numerical examples are also provided to show that our results can be applied to solve equations in cases where earlier study cannot be applied. Furthermore, in the cases where both old and new results are applicable, the latter provides a larger domain of convergence and tighter error bounds on the distances involved.
Keywords:
MMN-HSS method; semilocal convergence; system of nonlinear equations; generalized Lipschitz conditions; Hermitian method MSC:
65F10; 65W05
1. Introduction
Let be Gateaux-differentiable and D be an open set. Let also be a point at which is continuous and positive definite. Suppose that , where and are the Hermitian and Skew-Hermitian parts of the Jacobian matrix , respectively. Many problems can be formulated like the equation
using mathematical modelling [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]. The solution of Equation (1) can rarely be found in explicit form. This is why most solution methods of Equation (1) are usually iterative. In particular, Hermitian and Skew-Hermitian Splitting (HSS) methods have been shown to be very efficient in solving large sparse non-Hermitian positive definite systems of linear equations [11,12,17,19,22].
We study the semilocal convergence of the multi-step modified Newton-HSS (MMN-HSS) method defined by
where is an initial point, is a sequence of positive integers, and and are positive constants
and
The local and semilocal convergence analysis of method (2) was given in [19] using Lipschitz continuity conditions on F. Later, we extended the local convergence of method (2) using generalized Lipschitz continuity conditions [8].
In the present study, we show that the results in [19] can be extended as the ones for MN-HSS in [8]. Using generalized Lipschitz-type conditions, we present a new semilocal convergence analysis with advantages (A):
- (a)
- Larger radius of convergence,
- (b)
- More precise error estimates on ,
- (c)
- The new results can be used in cases where the old ones in [19] cannot be used to solve Equation (1).
The advantages (A) are obtained under the same computational cost as in [19]. Hence, the applicability of the MMN-HSS method is extended.
2. Semilocal Convergence
The following hypotheses shall be used in the semilocal convergence analysis (H):
- (H1)
- Let . There exist , , and such that
- (H2)
- There exist , , continuous and nondecreasing functions with such that, for eachDefine functions w and v by and .and set
- (H3)
- There exist , , continuous and nondecreasing functions with such that, for each
We need the following auxiliary results for the semilocal convergence analysis that follows.
Lemma 1.
Under the (H) hypotheses, the following items hold for each :
and
Proof.
We shall define some scalar functions and parameters to be used in the semilocal convergence analysis. Let and . Define scalar sequences by the following schemes:
Moreover, define functions q and on the interval by
and
We have that and as . It follows from the intermediate value theorem that function has zeros in interval . Denote by the smallest such zero. Then, we have that for each
Lemma 2.
Suppose that equation
has zeros in interval . Denote by r the smallest such zero. Then, sequence , generated by Equation (9) is nondecreasing, bounded from above by and converges to its unique least upper bound , which satisfies
Proof.
Equation (11) can be written as
since, by Equation (9),
and r solves Equation (11). It follows from the definition of sequence , functions , , , and inequality (10) that
and
Therefore, sequences converges to , which satisfies inequality (12). ☐
Next, we present the semilocal convergence analysis of the MMN-HSS method.
Theorem 1.
Suppose that the hypotheses (H) and hypotheses of Lemma 2 hold. Define , where is defined in ([7], Theorem 2.1) and is given in Lemma 2. Let , , . Moreover, suppose
where the symbol denotes the smallest integer no less than the corresponding real number, and
Then, the sequence generated by the MMN-HSS method is well defined, remains in for each and converges to a solution of Equation .
Proof.
Notice that we showed in ([8], Theorem 2.1) that for each
The following statements shall be shown using mathematical induction:
We have for :
Suppose the following items hold for each :
We shall prove that inequalities (18) hold for .
Using the (H) conditions, we get in turn that
Then, we also obtain that
and
Hence, we get from inequality (19) that
Then, we have by Equation (9) that
holds, and the items (17) hold for . Suppose that the items (17) hold for all nonnegative integers less than k. Next, we prove the items (17) hold for k.
We get, in turn, by the induction hypotheses:
In view of , we have
We also get that
and
It follows that
Suppose that the following items hold for any positive integers less than :
We also get that
and
Then, the sequence also converges to some . By letting in inequality (21), we get that
☐
Remark 1.
Let us specialize functions , , , as , , , for some positive constants , , , and set , . Suppose that . Then, notice that
since
and
and
where .
Remark 2.
The set in can be replaced by leading to even smaller “w” and “v” functions, since .
3. Numerical Examples
Example 1.
Suppose that the motion of an object in three dimensions is governed by system of differential equations
with for . Then, the solution of the system is given for by function defined by
Then, the Fréchet-derivative is given by
Then, we have that , , , , , , where , , , , , and .
Therefore,
In addition, we have that
and (see [7])
So,
It follows that sequence is complete, in D and as such it converges to .
Example 2.
Consider the system of nonlinear equation , wherein and , with
where by convention. This system has a complex solution. Therefore, we consider the complex initial guess . The derivative is given by
It is clear that is sparse and positive definite. Now, we solve this nonlinear problem by the Newton-HSS method (N-HSS), (see [10]), modified Newton-HSS method (MN-HSS), (see [22]), three-step modified Newton-HSS (3MN-HSS) and four-step modified Newton-HSS (4MN-HSS) method. The methods are compared in error estimates, CPU time (CPU-time) and the number of iterations. We use experimentally optimal parameter values of for the methods corresponding to the problem dimension , see Table 1. The numerical results are displayed in Table 2. From numerical results, we observe that MN-HSS outperforms N-HSS in the sense of CPU time and the number of iterations. Note that, in this example, the results in [19] can not be applied since the operators involved are not Lipschitz. However, our results can be applied by choosing “w” and “v” functions appropriately as in Example 3.1. We leave these details to the interested readers.
Table 1.
Optimal values of for N-HSS and MN-HSS methods.
Table 2.
Numerical results.
Acknowledgments
We would like to express our gratitude to the anonymous reviewers for their help with the publication of this paper.
Author Contributions
The contribution of all the authors has been equal. All of them worked together to develop the present manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Amat, S.; Busquier, S.; Plaza, S.; Guttérrez, J.M. Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 2003, 157, 197–205. [Google Scholar] [CrossRef]
- Amat, S.; Busquier, S.; Plaza, S. Dynamics of the King and Jarratt iterations. Aequ. Math. 2005, 69, 212–223. [Google Scholar] [CrossRef]
- Amat, S.; Hernández, M.A.; Remero, N. A modified Chebyshev’s iterative method with at least sixth order of convergence. Appl. Math. Comput. 2008, 206, 164–174. [Google Scholar] [CrossRef]
- Argyros, I.K. Convergence and Applications of Newton—Type Iterations; Springer-Verlag: 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]
- Argyros, I.K.; Magreñán, Á.A. Ball convergence theorems and the convergence planes of an iterative methods for nonlinear equations. SeMA 2015, 71, 39–55. [Google Scholar]
- Argyros, I.K.; Sharma, J.R.; Kumar, D. Local convergence of Newton-HSS methods with positive definite Jacobian matrices under generalized conditions. SeMA 2017. [Google Scholar] [CrossRef]
- Argyros, I.K.; Sharma, J.R.; Kumar, D. Extending the applicability of modified Newton-HSS method for solving systems of nonlinear equations. Stud. Math. 2017, submitted. [Google Scholar]
- Axelsson, O. Iterative Solution Methods; Cambridge University Press: Cambridge, CA, USA, 1994. [Google Scholar]
- Bai, Z.-Z.; Guo, X.P. The Newton-HSS methods for systems of nonlinear equations with positive definite Jacobian matrices. J. Comput. Math. 2010, 28, 235–260. [Google Scholar]
- Bai, Z.-Z.; Golub, G.H.; Pan, J.Y. Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numer. Math. 2004, 98, 1–32. [Google Scholar] [CrossRef]
- Bai, Z.-Z.; Golub, G.H.; Ng, M.K. Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite Linear systems. SIAM J. Matrix Anal. Appl. 2003, 24, 603–626. [Google Scholar] [CrossRef]
- Cordero, A.; Ezquerro, J.A.; Hernández-Veron, M.A.; Torregrosa, J.R. On the local convergence of a fifth-order iterative method in Banach spaces. Appl. Math. Comput. 2015, 251, 396–403. [Google Scholar] [CrossRef]
- Dembo, R.S.; Eisenstat, S.C.; Steihaug, T. Inexact Newton methods. SIAM J. Numer. Anal. 1982, 19, 400–408. [Google Scholar] [CrossRef]
- 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]
- 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]
- Guo, X.-P.; Duff, I.S. Semilocal and global convergence of Newton-HSS method for systems of nonlinear equations. Numer. Linear Algebra Appl. 2011, 18, 299–315. [Google Scholar] [CrossRef]
- Hernández, M.A.; Martínez, E. On the semilocal convergence of a three steps Newton-type process under mild convergence conditions. Numer. Algorithms 2015, 70, 377–392. [Google Scholar] [CrossRef]
- Li, Y.; Guo, X.-P. Multi-step modified Newton-HSS methods for systems of nonlinear equations with positive definite Jacobian Matrices. Numer. Algorithms 2017, 75, 55–80. [Google Scholar] [CrossRef]
- Ortega, J.M.; Rheinboldt, W.C. Iteraive Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
- Shen, W.-P.; Li, C. Convergence criterion of inexact methods for operators with Hölder continuous derivatives. Taiwanese J. Math. 2008, 12, 1865–1882. [Google Scholar]
- Wu, Q.-B.; Chen, M.-H. Convergence analysis of modified Newton-HSS method for solving systems of nonlinear equations. Numer. Algorithms 2013, 64, 659–683. [Google Scholar] [CrossRef]
© 2017 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/).