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

Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 22 publications
0
18
0
Order By: Relevance
“…From the numerical and analytical point of view, there are several methods to compute transcendental functions like this; for example, Chapeau-Blondeau [10] and Corless et al [5] proposed to evaluate the Lambert W branches using approximate analytical expressions and increasing accuracy with the Halley numerical method [35,[63][64][65]. Other proposals to obtain an analytic approximation of the Lambert W function are [11,[66][67][68].…”
Section: = +mentioning
confidence: 99%
“…From the numerical and analytical point of view, there are several methods to compute transcendental functions like this; for example, Chapeau-Blondeau [10] and Corless et al [5] proposed to evaluate the Lambert W branches using approximate analytical expressions and increasing accuracy with the Halley numerical method [35,[63][64][65]. Other proposals to obtain an analytic approximation of the Lambert W function are [11,[66][67][68].…”
Section: = +mentioning
confidence: 99%
“…where R n depends on n and the functions W f and d are defined by (7) and (11), respectively. Initial conditions of the type (66) were considered for the first time by Proinov [14,15].…”
Section: Discussionmentioning
confidence: 99%
“…On the basis of this theory lays the notion function of initial conditions of T since the convergence of any iterative method of the type (1) is studied with respect to some function of initial conditions (see [35,36]). Some applications of this theory can be found in [1,2,5,7,8,[14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][35][36][37][38]. Let R n be equipped with coordinate-wise ordering defined by:…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…ere is another class of derivative-free iterative methods which approximates all roots of (1) simultaneously. e simultaneous iterative methods for approximating all roots of (1) are very popular due to their global convergence and parallel implementation on computer (see, e.g., Weierstrass [3], Kanno [4], Proinov [5], Petkovi´c [6], Mir [7], Nourein [8], Aberth [9], and reference cited there in [10][11][12][13][14][15][16][17][18][19][20][21][22]).…”
Section: (2)mentioning
confidence: 99%