2017
DOI: 10.1016/j.amc.2016.08.034
|View full text |Cite
|
Sign up to set email alerts
|

Design and multidimensional extension of iterative methods for solving nonlinear problems

Abstract: In this paper, a three-step iterative method with sixth-order local convergence for approximating the solution of a nonlinear system is presented. From Ostrowski's scheme adding one step of Newton with 'frozen' derivative and by using a divided difference operator we construct an iterative scheme of order six for solving nonlinear systems. The computational efficiency of the new method is compared with some known ones, obtaining good conclusions. Numerical comparisons are made with other existing methods, on s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0
1

Year Published

2019
2019
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 21 publications
0
11
0
1
Order By: Relevance
“…In addition, to compare the above five methods, we use the computational cost which is measured by C = d + op (see [20]), where d is the number of function evaluations per iteration and op denotes the number of operations (e.g., products and quotients) needed per iteration. The various evaluations and operations that contribute towards the total computational cost for a system of m nonlinear equations in m unknowns are explained as follows.…”
Section: Development Of Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, to compare the above five methods, we use the computational cost which is measured by C = d + op (see [20]), where d is the number of function evaluations per iteration and op denotes the number of operations (e.g., products and quotients) needed per iteration. The various evaluations and operations that contribute towards the total computational cost for a system of m nonlinear equations in m unknowns are explained as follows.…”
Section: Development Of Methodsmentioning
confidence: 99%
“…Sharma and Arora proposed a fourth order method in [19] requiring one F and two F in each iteration. Apart from these third and fourth-order methods, researchers have also proposed some higher order methods, see, for example [11,13,15,17,[20][21][22][23][24] and references therein.…”
Section: Introductionmentioning
confidence: 99%
“…Then in view of Taylor's series expansion, we have f (x n ) = f ′ ( )(e n + c 2 e 2 n + c 3 e 3 n + c 4 e 4 n + O(e 5 n )). (6) and f ′ (x n ) = f ′ ( )(1 + 2c 2 e n + 3c 3 e 2 n + 4c 4 e 3 n ) + O(e 4 n ). (7) so that,…”
Section: Theorem 1 Let F Be a Complex Valued Function Defined On Sommentioning
confidence: 99%
“…One of the most effective techniques is the use weight functions. This technique can be applied both on solving nonlinear equations [6][7][8][9] and systems of nonlinear equations. [10][11][12] In Reference 7, authors proposed the following method:…”
Section: Introductionmentioning
confidence: 99%
“…Among others, Sharma et al in [18] designed a scheme with fourth-order of convergence by using this procedure and, more recently, Artidiello et al constructed in [19,20] several classes of high-order schemes by means of matrix weight functions.…”
Section: Introductionmentioning
confidence: 99%