2021
DOI: 10.3390/sym13050884
|View full text |Cite
|
Sign up to set email alerts
|

A General Optimal Iterative Scheme with Arbitrary Order of Convergence

Abstract: A general optimal iterative method, for approximating the solution of nonlinear equations, of (n+1) steps with 2n+1 order of convergence is presented. Cases n=0 and n=1 correspond to Newton’s and Ostrowski’s schemes, respectively. The basins of attraction of the proposed schemes on different test functions are analyzed and compared with the corresponding to other known methods. The dynamical planes showing the different symmetries of the basins of attraction of new and known methods are presented. The performa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 22 publications
(31 reference statements)
0
10
0
Order By: Relevance
“…In [11] Cordero et al, in 2021, proposed a method that consists of a four-step iterative method (O82) with the eighth-order of convergence. The efficiency index of this scheme is about 1.5157, which is better than NRM and some other existing methods.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In [11] Cordero et al, in 2021, proposed a method that consists of a four-step iterative method (O82) with the eighth-order of convergence. The efficiency index of this scheme is about 1.5157, which is better than NRM and some other existing methods.…”
Section: Methodsmentioning
confidence: 99%
“…The use and recommendation of higher-order nonlinear methods for scalar equations are also encouraged in previous and current articles. For example, the eighth-order method in [9][10][11], and fifteenth-order method in [14], have been devised. While solving nonlinear models, we have employed three methods known as the proposed method given in (12), the well-known Newton's method given in Eq.…”
Section: Mathematical Analysesmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we perform different numerical experiments in order to observe the behavior of the proposed methods. In this case, we modify, as discussed in the previous section, Newton's method, Steffensen's method [8], the N 4 and N 8 methods designed in [9], and the M 4 and M 6 schemes constructed in [10]. We denote these methods in the same way as in the previous section, that is, if the method is denoted by ϕ, then its variant with the added step is denoted by ϕ s .…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…The following Theorem is devoted to studying the order of convergence of MIP, for which the Taylor expansion technique has been used (e.g. see [52] for further details). Theorem 3.…”
Section: A Order Of Convergence Of Mipmentioning
confidence: 99%