An optimal and efficient general eighth-order derivative free scheme for simple roots

作者:

Highlights:

摘要

The main motivation of this study is to present an optimal scheme in a general way that can be applied to any existing optimal multipoint fourth-order iterative scheme whose first substep employs Steffensen’s method or Steffensen like method to further produce optimal eighth-order iterative schemes. A rational function approximation approach is used in the construction of proposed scheme. In addition, we also discussed the theoretical and computational properties of our scheme. Each member of the presented scheme satisfies the optimality conjecture for multipoint iterative methods without memory which was given by Kung and Traub in 1970. Finally, we also concluded on the basis of obtained numerical results that our methods have faster convergence in contrast to the existing methods of same order because they have minimum residual errors, minimum error difference between two consecutive iterations and minimum asymptotic error constants corresponding to the considered test function.

论文关键词:65G99,65J15,49M15,Nonlinear equations,Simple roots,Computational order of convergence,Steffensen’s type method

论文评审过程:Received 31 December 2016, Revised 11 June 2017, Accepted 27 July 2017, Available online 12 August 2017, Version of Record 29 October 2017.

论文官网地址:https://doi.org/10.1016/j.cam.2017.07.036