Construction of optimal derivative-free techniques without memory
Summary: The construction of iterative processes without memory, which are both optimal according to the Kung-Traub hypothesis (cf. [\textit{H. T. Kung} and \textit{J. F. Traub}, J. Assoc. Comput. Mach. 21, 643--651 (1974; Zbl 0289.65023)]) 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 \textit{Q. Zheng} et al. [Appl. Math. Comput. 217, No. 23, 9592--9597 (2011; Zbl 1227.65044)]. This procedure also provides an \(n\)-step family using \(n + 1\) function evaluations per full cycle to possess the optimal order \(2^{n}\). 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.
scientific article; zbMATH DE number 6169925
scientific article