Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 94
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY
Edited by:
Paper 42

More Efficient Iterative Methods than Newton's Method for Solving Nonlinear Systems

J.A. Ezquerro and M.A. Hernández

Department of Mathematics and Computation, University of La Rioja, Logroño, Spain

Full Bibliographic Reference for this paper
, "More Efficient Iterative Methods than Newton's Method for Solving Nonlinear Systems", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 42, 2010. doi:10.4203/ccp.94.42
Keywords: nonlinear systems, Newton's method, iterative methods, efficiency index, computational efficiency, semilocal convergence, order of convergence, mildly nonlinear elliptic boundary value problem, molecular interaction equation.

Summary
The application of Newton's method (order of convergence two) is very widespread for solving nonlinear systems of equations. We propose the application of a new family of iterative methods with order of convergence four for solving such systems, which is constructed from the modification of a third-order iterative method of Chebyshev-type [1]. The proposal is based on the fact that the new iterative methods are more efficient than Newton's method. We can deduce the last by measuring the efficiency of the methods from two well-known indices [2]: the efficiency index and the computational efficiency, which are defined from the order of convergence of the iterative methods, the number of evaluations of functions that are carried out when the iterative methods are applied and the computational cost required to apply a step of the iterative methods. In particular, we construct iterative methods with a higher order of convergence than Newton's method, similar number of computations of functions and lower computational cost per iteration.

We study the semilocal convergence of the new iterative methods under the usual Kantorovich convergence conditions considered for studying Newton's method.

All the above-mentioned is illustrated by the solution of mildly nonlinear elliptic boundary value problems. The solution of a particular problem (the molecular interaction equation [3] in a square) is approximated by the most competitive iterative method of the family. To do this, we first follow a process of discretization using finite difference approximations, which yields a finite system of equations.

References
1
J.A. Ezquerro, J.M. Gutiérrez, M.A. Hernández, M.A. Salanova, "Chebyshev-like methods and quadratic equations", Rev. Anal. Numér. Théor. Approx., 28(1), 23-35, 1999.
2
J.F. Traub, "Iterative Methods for the Solution of Equations", Prentice Hall, Englewood Cliffs, N.J., 1964.
3
S.T. Pohozaev, "The Dirichlet problem for the equation Delta u=u2", Soviet Math. Dokl., 1, 1143-1146, 1960.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £125 +P&P)