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

A composite fourth-order iterative method for solving non-linear equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
53
0
1

Year Published

2007
2007
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 84 publications
(55 citation statements)
references
References 3 publications
1
53
0
1
Order By: Relevance
“…The informational efficiency of the above methods is unity. The efficiency index of those methods is 1.4142 for (1) and (8) but I ¼ 1:442 for (34) and (9).…”
Section: A New Fourth-order Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The informational efficiency of the above methods is unity. The efficiency index of those methods is 1.4142 for (1) and (8) but I ¼ 1:442 for (34) and (9).…”
Section: A New Fourth-order Methodsmentioning
confidence: 99%
“…The fourthorder methods in the literatute usually require three evaluations of the given function and its first derivative per iteration, and it was shown that they can compete with Newton's method, see [1,9,13,16,20] and the references therein. Other than the above-mentioned methods, various types of improvements of Newton's method are available in the literature [6][7][8][9][10][11][12][13][14][15] and the references therein. Among these methods it is noteworthy to mention that the method of undetermined coefficients was successfully applied in [11] to show that many methods in the literature can be derived from each other, and so proving their equivalence.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For a given x 0 , compute approximates solution by the iterative schemes Algorithm 2.1 has fourth-order convergence, which was obtained by [13]. Homeier [3] derived the following cubically convergent iteration scheme.…”
Section: Description Of the Methodsmentioning
confidence: 99%
“…In [9] Kung and Traub conjectured that the iterative method which requires n + 1 function evaluations per iteration can reach at most 2 n convergence order in general. The methods that satisfy KungTraub conjecture are known as optimal methods (see [10], [11], [12], [13], [14], [15], [16], [14], [18], [19]). This research presents a new family of such optimal eighth order methods.…”
Section: Introductionmentioning
confidence: 99%