- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 709843, 15 pages
New Predictor-Corrector Methods with High Efficiency for Solving Nonlinear Systems
1Instituto de Matemática Multidisciplinar, Universitat Politècnica de València, Camino de Vera S/N, 40022 Valencia, Spain
2Instituto Tecnológico de Santo Domingo (INTEC), avenida de Los Próceres, Galóa, 10602 Santo Domingo, Dominican Republic
Received 20 July 2012; Revised 27 August 2012; Accepted 1 September 2012
Academic Editor: Fazlollah Soleymani
Copyright © 2012 Alicia Cordero et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
A new set of predictor-corrector iterative methods with increasing order of convergence is proposed in order to estimate the solution of nonlinear systems. Our aim is to achieve high order of convergence with few Jacobian and/or functional evaluations. Moreover, we pay special attention to the number of linear systems to be solved in the process, with different matrices of coefficients. On the other hand, by applying the pseudocomposition technique on each proposed scheme we get to increase their order of convergence, obtaining new efficient high-order methods. We use the classical efficiency index to compare the obtained procedures and make some numerical test, that allow us to confirm the theoretical results.
Many relationships in nature are inherently nonlinear, which according to these effects are not in direct proportion to their cause. Approximating a solution of a nonlinear system, , is a classical problem that appears in different branches of science and engineering (see, e.g. ). In particular, the numerical solution of nonlinear equations and systems is needed in the study of dynamical models of chemical reactors  or in radioactive transfer . Moreover, many of numerical applications use high precision in their computations; in , high-precision calculations are used to solve interpolation problems in astronomy; in  the authors describe the use of arbitrary precision computations to improve the results obtained in climate simulations; the results of these numerical experiments show that the high-order methods associated with a multiprecision arithmetic floating point are very useful, because it yields a clear reduction in iterations. A motivation for an arbitrary precision in interval methods can be found in , in particular for the calculation of zeros of nonlinear functions.
Recently, many robust and efficient methods with high convergence order have been proposed to solve nonlinear equations, but in most of cases the schemes cannot be extended to multivariate problems. Few papers for the multidimensional case introduce methods with high order of convergence. The authors design in  a modified Newton-Jarrat scheme of sixth order; in  a third-order method is presented for computing real and complex roots of nonlinear systems; Shin et al. compare in  Newton-Krylov methods and Newton-like schemes for solving big-sized nonlinear systems; the authors in  and A. Iliev and I. Iliev in  show general procedures to design high-order methods by using frozen Jacobian and Taylor expansion, respectively. Special case of sparse Jacobian matrices is studied in .
Dayton et al. in  formulate the multiplicity for the general nonlinear system at an isolated zero. They present an algorithm for computing the multiplicity structure, propose a depth-deflation method for accurate computation of multiple zeros, and introduce the basic algebraic theory of the multiplicity.
In this paper, we present three new Newton-like schemes, of order of convergence four, six, and eight, respectively. After the analysis of convergence of the new methods, we apply the pseudocomposition technique in order to get higher-order procedures. This technique (see ) consists of the following: we consider a method of order of convergence as a predictor, whose penultimate step is of order , and then we use a corrector step based on the Gaussian quadrature. So, we obtain a family of iterative schemes whose order of convergence is . This is a general procedure to improve the order of convergence of known methods.
To analyze and compare the efficiency of the proposed methods we use the classic efficiency index due to Ostrowski , where is the order of convergence and is the number of functional evaluations at each iteration.
The convergence theorem in Section 2 is demonstrated by means of the -dimensional Taylor expansion of the functions involved. Let be sufficiently Frechet differentiable in . By using the notation introduced in , the th derivative of at , , is the -linear function such that . It is easy to observe that(1), (2), for all permutation of .
So, in the following we will denote:(a), (b).
It is well known that, for lying in a neighborhood of a solution of the nonlinear system , Taylor’s expansion can be applied (assuming that the jacobian matrix is nonsingular), and where , . We observe that since and .
In addition, we can express the Jacobian matrix of , as where is the identity matrix. Therefore, . From (1.2), we obtain where ,.
We denote the error in the th iteration. The equation , where is a -linear function , is called the error equation and is the order of convergence.
The rest of the paper is organized as follows: in the next section, we present the new methods of order four, six, and eight, respectively. Moreover, the convergence order is increased when the pseudocomposition technique is applied. Section 3 is devoted to the comparison of the different methods by means of several numerical tests.
2. Design and Convergence Analysis of the New Methods
Let us introduce now a new Jarratt-type scheme of five steps which we will denote as M8. We will prove that its first three steps define a fourth-order scheme, denoted by M4, and its four first steps become a sixth-order method that will be denoted by M6. The coefficients involved have been obtained optimizing the order of the convergence, and the whole scheme requires three functional evaluations of and two of to attain eighth order of convergence. Let us also note that the linear systems to be solved in first, second, and last step have the same matrix and also have the third and fourth steps, so the number of operations involved is not as high as it can seem.
Theorem 2.1. Let be a sufficiently differentiable in a neighborhood of which is a solution of the nonlinear system , and let be an initial estimation close enough to the solution . One also supposes that is continuous and nonsingular at . Then, the sequence obtained by converges to with order of convergence eight. The error equation is
Proof. From (1.1) and (1.2) we obtain
As , we calculate
where and , for So,
where and .
Then, and , where .
The Taylor expansion of is where We also obtain the Taylor expansion of : where . As , we obtain where and .
So, where and .
We now calculate , and the error equation of the method at this step is where , Then the first three steps define a fourth-order procedure, and So, where and .
At the fourth step, we calculate where and This shows that the first four steps of the method define a sixth-order scheme. Indeed, where and Then, where and , . By multiplying (2.17) and (2.18), where and .
Finally, and the error equation is proving that the order of convergence of the analyzed method is eight.
In  the authors presented a new procedure to design higher-order schemes. This technique, called pseudocomposition, uses the two last steps of the predictor method to obtain a corrected scheme with higher order of convergence.
Theorem 2.2 (see ). Let be differentiable enough , let be a solution of the nonlinear system , and let be an initial estimation close enough to the solution . We suppose that is continuous and nonsingular at . Let and be the penultimate and final steps of orders and , respectively, of a certain iterative method. Taking this scheme as a predictor we get a new approximation of given by
where and , are the nodes and weights of the orthogonal polynomial corresponding to the Gaussian quadrature used. Then,(1)the obtained set of families will have an order of convergence at least ; (2)if is satisfied, then the order of convergence will be at least ; (3)if, also, , the order of convergence will be ,
where and .
Depending on the orthogonal polynomial corresponding to the Gaussian quadrature used in the corrector step, this procedure will determine a family of schemes. Furthermore, it is possible to obtain different methods in these families by using distinct number of nodes corresponding to the orthogonal polynomial used (see Table 1). However, according to the proof of Theorem 2.2 the order of convergence of the obtained methods does not depend on the number of nodes used.
Let us note that these methods, obtained by means of Gaussian quadratures, seem to be known interpolation quadrature schemes such as midpoint, trapezoidal, or Simpson’s method (see ). It is only a similitude, as they are not applied on the last iteration , and the last step of the predictor , but on the two last steps of the predictor. In the following, we will use a midpoint-like as a corrector step, which corresponds to a Gauss-Legendre quadrature with one node; for this scheme the order of convergence will be at least , by applying Theorem 2.2.
The pseudocomposition can be applied to the proposed scheme M8 with iterative expression (2.1), but also to M6. By pseudocomposing on M6 and M8 there can be obtained two procedures of order of convergence 10 and 14 (denoted by PsM10 and PsM14), respectively. Let us note that it is also possible to pseudocompose on M4, but the resulting scheme would be of third order of convergence, which is worse than the original M4, so it will not be considered.
Following the notation used in (2.1), the last step of PsM10 is and the last three steps of psM14 can be expressed as
In Figure 1, we analyze the efficiency indices of the proposed methods, compared with Newton and Jarrat’s schemes and between themselves. There can be deduced the following conclusions: the new methods M4, M6, and M8 (and also the pseudocomposed PsM10 and PsM14) improve Newton and Jarratt’s schemes (in fact, the indices of M4 and Jarratt’s are equal). Indeed, for the best index is that of M8. Nevertheless, none of the pseudocomposed methods improve the efficiency index of their original partners. Nevertheless, as we will see in the following section, the pseudocomposed schemes will show a very stable behavior that makes them worth.
3. Numerical Results
In order to illustrate the effectiveness of the proposed methods, we will compare them with other known schemes. Numerical computations have been performed in MATLAB R2011a by using variable-precision arithmetic, which uses floating-point representation of 2000 decimal digits of mantissa. The computer specifications are Intel(R) Core(TM) i5-2500 CPU @ 3.30 GHz with 16.00 GB of RAM. Each iteration is obtained from the former by means of an iterative expression , where , is a real matrix and . The matrix and vector are different according to the method used, but in any case, we calculate as the solution of the linear system , with Gaussian elimination with partial pivoting. The stopping criterion used is or .
Firstly, let us consider the following nonlinear systems of different sizes:(1), where and , such that When is odd, the exact zeros of are: and . (2) and the solutions are and . (3), being the solutions and . (4) with roots , and .
Table 2 presents results showing the following information: the different iterative methods employed (Newton (NC), Jarratt (JT), the new methods M4, M6, and M8, and the pseudocomposed PsM10 and PsM14), the number of iterations needed to converge to the solution Sol, the value of the stopping factors at the last step, and the computational order of convergence (see ) approximated by the formula: The value of which appears in Table 2 is the last coordinate of the vector when the variation between their coordinates is small. Also the elapsed time, in seconds, appears in Table 2, being the mean execution time for 100 performances of the method (the command cputime of MATLAB has been used).
We observe from Table 2 that not only the order of convergence and the number of new functional evaluations and operations are important in order to obtain new efficient iterative methods to solve nonlinear systems of equations. A key factor is the range of applicability of the methods. Although they are slower than the original methods when the initial estimation is quite good, when we are far from the solution or inside a region of instability, the original schemes do not converge or do it more slowly, the corresponding pseudocomposed procedures usually still converge or do it faster.
The advantage of pseudocomposition can be observed in Figures 2(a) and 2(b) (methods M6 and PsM10) and Figures 3(a) and 3(b) (methods M8 and PsM14) where the dynamical plane on is represented: we consider the system of two equations and two unknowns , for any initial estimation in represented by its position in the plane, a different color (blue or orange, as there exist only two solutions in this region) is used for the different solutions found (marked by a white point in the figure). Black color represents an initial point in which the method converges to infinity, and the green one means that no convergence is found (usually because any linear system cannot be solved). It is clear that when many initial estimations tend to infinity (see Figure 3(a)), the pseudocomposition “cleans” the dynamical plane, making the method more stable as it can find one of the solutions by using starting points that do not allow convergence with the original scheme (see Figure 3(b)).
If an analogous study is made on system , similar conclusions can be obtained, as the effect of smoothness is clear when the real dynamical plane of a method and its pseudocomposed partner are compared. So, in Figure 4 the amount of points in the lower half of the plane that converge to one of the roots is higher after the pseudocomposition, and, in Figure 5, there is a big green region of no convergence for method M8 that shows to be convergent when pseudocomposition is applied in PsM14.
We conclude that the presented schemes M4, M6, and M8 show to be excellent, in terms of order of convergence and efficiency, but also that the pseudocomposition technique achieves to transform them in competent and more robust new schemes.
The authors would like to thank the referees for the valuable comments and for the suggestions to improve the readability of the paper. This research was supported by Ministerio de Ciencia y Tecnología MTM2011-28636-C02-02 and FONDOCYT República Dominicana.
- A. Iliev and N. Kyurkchiev, Nontrivial Methods in Numerical Analysis: Selected Topics in Numerical Analysis, LAP LAMBERT Academic Publishing, Saarbrcken, Germany, 2010.
- D. D. Bruns and J. E. Bailey, “Nonlinear feedback control for operating a nonisothermal CSTR near an unstable steady state,” Chemical Engineering Science, vol. 32, pp. 257–264, 1977.
- J. A. Ezquerro, J. M. Gutiérrez, M. A. Hernández, and M. A. Salanova, “Chebyshev-like methods and quadratic equations,” Revue d'Analyse Numérique et de Théorie de l'Approximation, vol. 28, no. 1, pp. 23–35, 1999.
- Y. Zhang and P. Huang, “High-precision Time-interval Measurement Techniques and Methods,” Progress in Astronomy, vol. 24, no. 1, pp. 1–15, 2006.
- Y. He and C. Ding, “Using accurate arithmetics to improve numerical reproducibility and stability in parallel applications,” Journal of Supercomputing, vol. 18, pp. 259–277, 2001.
- N. Revol and F. Rouillier, “Motivations for an arbitrary precision interval arithmetic and the MPFI library,” Reliable Computing, vol. 11, no. 4, pp. 275–290, 2005.
- A. Cordero, J. L. Hueso, E. Martínez, and J. R. Torregrosa, “A modified Newton-Jarratt's composition,” Numerical Algorithms, vol. 55, no. 1, pp. 87–99, 2010.
- M. Nikkhah-Bahrami and R. Oftadeh, “An effective iterative method for computing real and complex roots of systems of nonlinear equations,” Applied Mathematics and Computation, vol. 215, no. 5, pp. 1813–1820, 2009.
- B.-C. Shin, M. T. Darvishi, and C.-H. Kim, “A comparison of the Newton-Krylov method with high order Newton-like methods to solve nonlinear systems,” Applied Mathematics and Computation, vol. 217, no. 7, pp. 3190–3198, 2010.
- A. Cordero, J. L. Hueso, E. Martínez, and J. R. Torregrosa, “Efficient high-order methods based on golden ratio for nonlinear systems,” Applied Mathematics and Computation, vol. 217, no. 9, pp. 4548–4556, 2011.
- A. Iliev and I. Iliev, “Numerical method with order t for solving system nonlinear equations,” Collection of scientific works “30 years FMI” Plovdiv 0304.11.2000, 105112, 2000.
- N. Kyurkchiev and A. Iliev, “A general approach to methods with a sparse Jacobian for solving nonlinear systems of equations,” Serdica Mathematical Journal, vol. 33, no. 4, pp. 433–448, 2007.
- B. H. Dayton, T.-Y. Li, and Z. Zeng, “Multiple zeros of nonlinear systems,” Mathematics of Computation, vol. 80, no. 276, pp. 2143–2168, 2011.
- A. Cordero, J. R. Torregrosa, and M. P. Vassileva, “Pseudocomposition: a technique to design predictor–corrector methods for systems of nonlinear equations,” Applied Mathematics and Computation, vol. 218, no. 23, pp. 11496–11504, 2012.
- A. M. Ostrowski, Solution of Equations and Systems of Equations, Academic Press, New York, NY, USA, 1966.
- A. Cordero and J. R. Torregrosa, “On interpolation variants of Newton's method for functions of several variables,” Journal of Computational and Applied Mathematics, vol. 234, no. 1, pp. 34–43, 2010.
- A. Cordero and J. R. Torregrosa, “Variants of Newton's method using fifth-order quadrature formulas,” Applied Mathematics and Computation, vol. 190, no. 1, pp. 686–698, 2007.