Name
Abstract | ||
|---|---|---|
In this paper, we describe a general family of iterative methods for approximating a multiple root z with multiplicity m of a complex defined function. Almost of the family of the methods existing in the literature that use two-function and one-derivative evaluations are a special choice of this general method. We give some conditions to have the third order of convergence and we discuss how to choose a small asymptotic error constant which may be affect the speed of the convergence. Using Mathematica with its high precision compatibility, we present some numerical examples to confirm the theoretical results. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.amc.2014.01.108 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Newton’s method,Iterative methods,Order of convergence,Multiple roots | Convergence (routing),Mathematical optimization,Compatibility (mechanics),Iterative method,Mathematical analysis,Third order,Multiplicity (mathematics),Rate of convergence,Calculus,Mathematics,Newton's method | Journal |
Volume | ISSN | Citations |
233 | 0096-3003 | 6 |
PageRank | References | Authors |
0.45 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Driss Sbibih | 1 | 52 | 12.89 |
| A. Serghini | 2 | 13 | 3.53 |
| Ahmed Tijini | 3 | 20 | 5.11 |
| Ahmed Zidna | 4 | 44 | 11.33 |