2019
DOI: 10.1142/s0219876218430119
|View full text |Cite
|
Sign up to set email alerts
|

A General Way to Construct a New Optimal Scheme with Eighth-Order Convergence for Nonlinear Equations

Abstract: In this paper, we present a new and interesting optimal scheme of order eight in a general way for solving nonlinear equations, numerically. The beauty of our scheme is that it is capable of producing further new and interesting optimal schemes of order eight from every existing optimal fourth-order scheme whose first substep employs Newton’s method. The construction of this scheme is based on rational functional approach. The theoretical and computational properties of the proposed scheme are fully investigat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…The expression of this index, I = p 1/d , involves the order of convergence of the method p and the number of functional evaluations in each iteration, d. The methods with higher convergence order are not necessarily the most efficient, as the complexity of the iterative expression also plays an important role. In [4], Kung and Traub established that the order of convergence of an iterative method without memory, which used n functional evaluations per iteration, is less than or equal to 2 n−1 . When an iterative scheme reaches this upper bound, it is said to be an optimal method.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The expression of this index, I = p 1/d , involves the order of convergence of the method p and the number of functional evaluations in each iteration, d. The methods with higher convergence order are not necessarily the most efficient, as the complexity of the iterative expression also plays an important role. In [4], Kung and Traub established that the order of convergence of an iterative method without memory, which used n functional evaluations per iteration, is less than or equal to 2 n−1 . When an iterative scheme reaches this upper bound, it is said to be an optimal method.…”
Section: Introductionmentioning
confidence: 99%
“….. This method is not optimal following the Kung-Traub conjecture [4]. We modify expression (2) to obtain an optimal iterative scheme of order 2 n+1 .…”
Section: Introductionmentioning
confidence: 99%
“…In order to improve the CO and EI of (1.2), many authors have used different techniques. A good review on some of these techniques such as the geometric, functional, composition, sampling, Adomain decomposition, rational function and weight function techniques can be found in [1,15,16,17] and reference therein. The Weerakoon and Fernando (W-F) method in [25] is one modified form of the NM (1.2), put forward by replacing the function f (x) in (1.2) with the arithmetic mean of the functions f (x) and f (w).…”
Section: Introductionmentioning
confidence: 99%