Koenig’s root-finding algorithms | ||||
| Delta Journal of Science | ||||
| Article 6, Volume 37, Issue 1, June 2016, Page 58-64 PDF (1.16 MB) | ||||
| Document Type: Research and Reference | ||||
| DOI: 10.21608/djs.2016.139918 | ||||
 View on SCiNiTO | ||||
| Author | ||||
| Omar Ismael El Hasadi | ||||
| Department of Mathematics, Faculty of Education, University of Omar Al Mukhtar, Branch Derna, Libya. | ||||
| Abstract | ||||
| In this paper, we first recall the definition of a family of Koenig’s rootfinding algorithms known as Koenig’s algorithms (𝐾,) for polynomials. In the whole paper p has degree 𝑑 ≥ 2 with real coefficients and real (and simple) zeros 𝑥 , 1 ≤ 𝑘 ≤ 𝑑 . Now we want to discuss Koenig’s algorithms in details where 𝑛 = 4, (𝐾,(𝑧)). | ||||
| Keywords | ||||
| Koenig’s function; derivative of Koenig; immediate basins of Koenig | ||||
|
Statistics Article View: 79 PDF Download: 209 |
||||
