Computational & Technology Resources
an online resource for computational,
engineering & technology publications 

CivilComp Proceedings
ISSN 17593433 CCP: 94
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by:
Paper 38
Iterative Processes with High Order of Convergence for Nonlinear Systems A. Cordero^{1}, J.L. Hueso^{1}, E. Martínez^{2} and J.R. Torregrosa^{1}
^{1}Institute of Multidisciplinary Mathematics, ^{2}Institute of Pure and Applied Mathematics,
, "Iterative Processes with High Order of Convergence for Nonlinear Systems", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", CivilComp Press, Stirlingshire, UK, Paper 38, 2010. doi:10.4203/ccp.94.38
Keywords: nonlinear system, Newton's method, quadratic convergence, efficiency index.
Summary
In this paper we consider the problem of finding a real solution of a nonlinear
system F(x)=0 with n equations and n unknowns. The most used iterative method
is the classical Newton's method. It is well known that this method requires
the Jacobian matrix of F to be nonsingular in a neighborhood of the solution in
order to obtain quadratic convergence.
A known acceleration technique consists of the composition of two iterative methods of order p and q, respectively, to obtain a method of order pq [1]. Usually, new evaluations of the Jacobian matrix and the nonlinear functions are required in order to increase the order of convergence. However, some modifications of Newton's method can be made in order to limit the number of functional evaluations and increase the convergence order. In this work we present two new iterative methods with a high convergence order for solving nonlinear systems. These new methods are obtained by composing known iterative methods of order 3 and 4 with a modification of Newton's method that introduces just one evaluation of the function, increasing the convergence order in two units. Firstly, we consider the third order method introduced by Frontini and Sormani [2], and combine it with a modified Newton's method obtaining a threestep method with fifth order convergence. This idea is also applied to the fourth order method introduced by Cordero et al. [3] in order to obtain a sixthorder method when we combine it with the modified Newton's method. In order to compare different methods, it is very common to use the efficiency index [4] which involves the order of convergence and the number of functional evaluations per iteration required by the method. However, in the ndimensional case, it is also important to take into account the number of arithmetic operations performed, since for each iteration a number of linear systems must be solved. For this reason we define the computational efficiency index, which also takes into account the number of products and quotients per iteration. We also use this new index to compare the different methods. The efficiency index and the computational efficiency index of the new methods are checked. We also perform different numerical tests that confirm the theoretical results and allow us to compare these new methods with the ones from which they have been derived and with the classical Newton's method. References
purchase the fulltext of this paper (price £20)
go to the previous paper 
