Increasing the order of convergence for iterative methods to solve nonlinear systems (Q331791): Difference between revisions
From MaRDI portal
Latest revision as of 20:24, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Increasing the order of convergence for iterative methods to solve nonlinear systems |
scientific article |
Statements
Increasing the order of convergence for iterative methods to solve nonlinear systems (English)
0 references
27 October 2016
0 references
The article is devoted to describe a class of iterative methods for solving a nonlinear system \(F(x)=0\), where \(F:D\subset \mathbb{R}^n\to\mathbb{R}^n\) is a ``sufficiently Fréchet differentiable'' function in a neighborhood of a zero \(\alpha\) of \(F\). Generalizing previous methods of \textit{A. Cordero} et al. [Appl. Math. Lett. 25, No. 12, 2369--2374 (2012; Zbl 1252.65093)] and \textit{J. R. Sharma} and \textit{P. Gupta} [Comput. Math. Appl. 67, No. 3, 591--601 (2014; Zbl 1350.65048)], in the paper under review the authors propose a technique for accelerating a method of order of convergence \(p\) to \(p+2\), using only one additional evaluation of the function \(F\) under consideration. This technique is applied to some known method, obtaining methods of fifth, sixth and seventh order of convergence. Computational efficiency of the new methods is compared with that of the previous ones and numerical examples are considered to illustrate their practical behavior.
0 references
systems of nonlinear equations
0 references
order of convergence
0 references
higher-order methods
0 references
computational efficiency
0 references
modified Newton method
0 references
convergence acceleration
0 references
numerical examples
0 references
0 references
0 references
0 references