Abstract
Kung and Traub (1974)[4] conjectured that an iteration method without memory based on n+1 evaluations could achieve optimal convergence order 2 n. Hence, based on this conjecture, we derive two optimal three-step eighth-order classes of methods in which there are only four evaluations per full cycle. Analytical proofs of the presented derivative-involved classes are provided. Finally, a number of numerical examples are also proposed to illustrate the accuracy of the contributed methods by comparing with the new existing optimal eighth-order methods without memory in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 1373-1380 |
| Number of pages | 8 |
| Journal | Mathematical and Computer Modelling |
| Volume | 55 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Feb 2012 |
| Externally published | Yes |
Keywords
- Eighth-order convergence
- Iterative methods
- Kung-Traub conjecture
- Multi-point iterations
- Simple root
Fingerprint
Dive into the research topics of 'Some modifications of King's family with optimal eighth order of convergence'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver