Construction of Optimal Derivative‐Free Techniques without Memory

F. Soleymani, D. K. R. Babajee, S. Shateyi and S. S. Motsa

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: Construction of iterative processes without memory, which are both optimal according to the Kung‐Traub hypothesis and derivative‐free, is considered in this paper. For this reason, techniques with four and five function evaluations per iteration, which reach to the optimal orders eight and sixteen, respectively, are discussed theoretically. These schemes can be viewed as the generalizations of the recent optimal derivative‐free family of Zheng et al. in (2011). This procedure also provides an n‐step family using n + 1 function evaluations per full cycle to possess the optimal order 2n. The analytical proofs of the main contributions are given and numerical examples are included to confirm the outstanding convergence speed of the presented iterative methods using only few function evaluations. The second aim of this work will be furnished when a hybrid algorithm for capturing all the zeros in an interval has been proposed. The novel algorithm could deal with nonlinear functions having finitely many zeros in an interval.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/497023

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:497023

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().