Abstract
AbstractIn this work, a new optimal iterative algorithm is presented with fourth-order accuracy for root-finding of real functions. It uses only function as well as derivative evaluation. The algorithm is obtained as a combination of existing third-order methods by specifying a parameter involved. The algorithm is based on local and semilocal analysis and has been specifically designed to improve efficiency and accuracy. The proposed algorithm represents a significant improvement over existing iterative algorithms. In particular, it is tested on a range of polynomial functions and was found to produce accurate and efficient results, with improved performance over existing algorithms in terms of both speed and accuracy. The results demonstrate the effectiveness of the proposed algorithm and suggest that it has great potential for use in a wide range of applications in polynomiography and other areas of mathematical analysis.
Publisher
Springer Science and Business Media LLC
Reference29 articles.
1. Abro, H., Shaikh, M.: A new time-efficient and convergent nonlinear solver. Appl. Math. Comput. 355, 516–536 (2019). https://doi.org/10.1016/j.amc.2019.03.012
2. Andreev, F., Kalantari, B., Kalantari, I.: Measuring the average performance of root-finding algorithms and imaging it through polynomiography. In: Proceedings of 17th IMACS World Congress, Scientific Computation, Applied Mathematics and Simulation. Paris, France (2005)
3. Ardelean, G., Cosma, O., Balog, L.: A comparison of some fixed point iteration procedures by using the basins of attraction. Carpathian J. Math. 32(3), 277–284 (2016)
4. Argyros, I.: Unified convergence criteria for iterative Banach space valued methods with applications. Mathematics 9(16), 1942 (2021). https://doi.org/10.3390/math9161942
5. Argyros, I., Szidarovszky, F.: The theory and applications of iteration methods. CRC Press, Boca Raton (1993)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献