Numer. Math. Theor. Meth. Appl., 5 (2012), pp. 592-601.
Published online: 2012-05
Cited by
- BibTex
- RIS
- TXT
We present a simple yet effective and applicable scheme, based on quadrature, for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve a maximum convergence order of $2^n$. Through quadrature, we develop optimal iterative methods of orders four and eight. The scheme can further be applied to develop iterative methods of even higher orders. Computational results demonstrate that the developed methods are efficient as compared with many well known methods.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2012.m1114}, url = {http://global-sci.org/intro/article_detail/nmtma/5951.html} }We present a simple yet effective and applicable scheme, based on quadrature, for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve a maximum convergence order of $2^n$. Through quadrature, we develop optimal iterative methods of orders four and eight. The scheme can further be applied to develop iterative methods of even higher orders. Computational results demonstrate that the developed methods are efficient as compared with many well known methods.