{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T13:25:51Z","timestamp":1781184351204,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In 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.<\/jats:p>","DOI":"10.1007\/s11075-023-01625-7","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T11:01:57Z","timestamp":1691060517000},"page":"1715-1745","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography"],"prefix":"10.1007","volume":"95","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7225-2309","authenticated-orcid":false,"given":"Sania","family":"Qureshi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9189-9298","authenticated-orcid":false,"given":"Ioannis K.","family":"Argyros","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5823-0170","authenticated-orcid":false,"given":"Amanullah","family":"Soomro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9434-9307","authenticated-orcid":false,"given":"Krzysztof","family":"Gdawiec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3084-922X","authenticated-orcid":false,"given":"Asif Ali","family":"Shaikh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6175-1455","authenticated-orcid":false,"given":"Evren","family":"Hincal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,3]]},"reference":[{"key":"1625_CR1","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.amc.2019.03.012","volume":"355","author":"H Abro","year":"2019","unstructured":"Abro, H., Shaikh, M.: A new time-efficient and convergent nonlinear solver. Appl. Math. Comput. 355, 516\u2013536 (2019). https:\/\/doi.org\/10.1016\/j.amc.2019.03.012","journal-title":"Appl. Math. Comput."},{"key":"1625_CR2","unstructured":"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)"},{"issue":"3","key":"1625_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.37193\/CJM.2016.03.03","volume":"32","author":"G Ardelean","year":"2016","unstructured":"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\u2013284 (2016)","journal-title":"Carpathian J. Math."},{"issue":"16","key":"1625_CR4","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.3390\/math9161942","volume":"9","author":"I Argyros","year":"2021","unstructured":"Argyros, I.: Unified convergence criteria for iterative Banach space valued methods with applications. Mathematics 9(16), 1942 (2021). https:\/\/doi.org\/10.3390\/math9161942","journal-title":"Mathematics"},{"key":"1625_CR5","volume-title":"The theory and applications of iteration methods","author":"I Argyros","year":"1993","unstructured":"Argyros, I., Szidarovszky, F.: The theory and applications of iteration methods. CRC Press, Boca Raton (1993)"},{"issue":"2","key":"1625_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.3390\/sym15020330","volume":"15","author":"M Awadalla","year":"2023","unstructured":"Awadalla, M., Qureshi, S., Soomro, A., Abuasbeh, K.: A novel three-step numerical solver for physical models under fractal behavior. Symmetry 15(2), 330 (2023). https:\/\/doi.org\/10.3390\/sym15020330","journal-title":"Symmetry"},{"key":"1625_CR7","volume-title":"Numerical analysis","author":"R Burden","year":"2015","unstructured":"Burden, R., Faires, J., Burden, A.: Numerical analysis, 10th edn. Cengage Learning Inc., Boston (2015)","edition":"10"},{"issue":"1","key":"1625_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11071-021-06306-5","volume":"104","author":"K Gdawiec","year":"2021","unstructured":"Gdawiec, K., Kotarski, W., Lisowska, A.: On the robust Newton\u2019s method with the Mann iteration and the artistic patterns from its dynamics. Nonlinear Dynamics 104(1), 297\u2013331 (2021). https:\/\/doi.org\/10.1007\/s11071-021-06306-5","journal-title":"Nonlinear Dynamics"},{"issue":"2","key":"1625_CR9","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s40995-016-0115-7","volume":"42","author":"J Jaiswal","year":"2018","unstructured":"Jaiswal, J.: Semilocal convergence of a computationally efficient eighth-order method in Banach spaces under w-continuity condition. Iranian J. Sci. Technol. Trans. A: Sci. 42(2), 819\u2013826 (2018). https:\/\/doi.org\/10.1007\/s40995-016-0115-7","journal-title":"Iranian J. Sci. Technol. Trans. A: Sci."},{"key":"1625_CR10","doi-asserted-by":"publisher","unstructured":"Jamali, K., Solangi, M., Qureshi, S.: A novel hybrid iterative method for applied mathematical models with time-efficiency. J. Appl. Math. Comput. Mech. 21(3), 19\u201329 (2022). https:\/\/doi.org\/10.17512\/jamcm.2022.3.02","DOI":"10.17512\/jamcm.2022.3.02"},{"issue":"2","key":"1625_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.amc.2006.05.181","volume":"184","author":"K Jisheng","year":"2007","unstructured":"Jisheng, K., Yitian, L., Xiuhua, W.: A composite fourth-order iterative method for solving non-linear equations. Appl. Math. Comput. 184(2), 471\u2013475 (2007). https:\/\/doi.org\/10.1016\/j.amc.2006.05.181","journal-title":"Appl. Math. Comput."},{"key":"1625_CR12","doi-asserted-by":"publisher","unstructured":"Kalantari, B.: Polynomial root-finding and polynomiography. World Scientific, Singapore (2009). https:\/\/doi.org\/10.1142\/6265","DOI":"10.1142\/6265"},{"key":"1625_CR13","volume-title":"Functional analysis in normed spaces","author":"L Kantorovich","year":"1964","unstructured":"Kantorovich, L., Akilov, G.: Functional analysis in normed spaces. Pergamon Press, Oxford (1964)"},{"issue":"5","key":"1625_CR14","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1137\/0710072","volume":"10","author":"R King","year":"1973","unstructured":"King, R.: A family of fourth order methods for nonlinear equations. SIAM J. Numeric. Anal. 10(5), 876\u2013879 (1973). https:\/\/doi.org\/10.1137\/0710072","journal-title":"SIAM J. Numeric. Anal."},{"issue":"4","key":"1625_CR15","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/321850.321860","volume":"21","author":"H Kung","year":"1974","unstructured":"Kung, H., Traub, J.: Optimal order of one-point and multipoint iteration. J. ACM 21(4), 643\u2013651 (1974). https:\/\/doi.org\/10.1145\/321850.321860","journal-title":"J. ACM"},{"issue":"2","key":"1625_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01731985","volume":"36","author":"W Luk","year":"1996","unstructured":"Luk, W.: Finding roots of a real polynomial simultaneously by means of Bairstow\u2019s method. BIT Numeric. Math. 36(2), 302\u2013308 (1996). https:\/\/doi.org\/10.1007\/BF01731985","journal-title":"BIT Numeric. Math."},{"issue":"2","key":"1625_CR17","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1016\/j.amc.2006.11.023","volume":"188","author":"K Noor","year":"2007","unstructured":"Noor, K., Noor, M.: Predictor-corrector Halley method for nonlinear equations. Appl. Math. Comput. 188(2), 1587\u20131591 (2007). https:\/\/doi.org\/10.1016\/j.amc.2006.11.023","journal-title":"Appl. Math. Comput."},{"issue":"8","key":"1625_CR18","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.5897\/IJPS11.425","volume":"6","author":"M Noor","year":"2011","unstructured":"Noor, M., Khan, W., Noor, K., Al-Said, E.: Higher-order iterative methods free from second derivative for solving nonlinear equations. Int. J. Phys. Sci. 6(8), 1887\u20131893 (2011). https:\/\/doi.org\/10.5897\/IJPS11.425","journal-title":"Int. J. Phys. Sci."},{"issue":"6","key":"1625_CR19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/S0893-9659(04)90104-8","volume":"17","author":"A \u00d6zban","year":"2004","unstructured":"\u00d6zban, A.: Some new variants of Newton\u2019s method. Appl. Math. Lett. 17(6), 677\u2013682 (2004). https:\/\/doi.org\/10.1016\/S0893-9659(04)90104-8","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"1625_CR20","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.2298\/FIL1904019P","volume":"33","author":"I Petkovi\u0107","year":"2019","unstructured":"Petkovi\u0107, I., Ran\u010di\u0107, L.: Computational geometry as a tool for studying root-finding methods. Filomat 33(4), 1019\u20131027 (2019). https:\/\/doi.org\/10.2298\/FIL1904019P","journal-title":"Filomat"},{"key":"1625_CR21","volume-title":"Nondiscrete induction and iterative processes","author":"F Potra","year":"1984","unstructured":"Potra, F., Ptak, V.: Nondiscrete induction and iterative processes. Pitman Advanced Publishing Program, Boston (1984)"},{"issue":"16","key":"1625_CR22","doi-asserted-by":"publisher","first-page":"1996","DOI":"10.3390\/math9161996","volume":"9","author":"S Qureshi","year":"2021","unstructured":"Qureshi, S., Ramos, H., Soomro, A.: A new nonlinear ninth-order root-finding method with error analysis and basins of attraction. Mathematics 9(16), 1996 (2021). https:\/\/doi.org\/10.3390\/math9161996","journal-title":"Mathematics"},{"key":"1625_CR23","doi-asserted-by":"publisher","unstructured":"Qureshi, S., Soomro, A., Shaikh, A., Hincal, E., Gokbulut, N.: A novel multistep iterative technique for models in medical sciences with complex dynamics. Comput. Math. Methods Med. 2022, Article ID 7656451 (2022). https:\/\/doi.org\/10.1155\/2022\/7656451","DOI":"10.1155\/2022\/7656451"},{"key":"1625_CR24","doi-asserted-by":"publisher","unstructured":"Rehman, M., Naseem, A., Abdeljawad, T.: Some novel sixth-order iteration schemes for computing zeros of nonlinear scalar equations and their applications in engineering. J. Function Spaces 2021, Article ID 5566379 (2021). https:\/\/doi.org\/10.1155\/2021\/5566379","DOI":"10.1155\/2021\/5566379"},{"issue":"10","key":"1625_CR25","doi-asserted-by":"publisher","first-page":"8207","DOI":"10.1016\/j.jksuci.2022.08.004","volume":"34","author":"R Sihwail","year":"2022","unstructured":"Sihwail, R., Solaiman, O., Ariffin, K.: New robust hybrid Jarratt\u2013Butterfly optimization algorithm for nonlinear models. J. King Saud University \u2013 Comput. Inf. Sci. 34(10), 8207\u20138220 (2022). https:\/\/doi.org\/10.1016\/j.jksuci.2022.08.004","journal-title":"J. King Saud University \u2013 Comput. Inf. Sci."},{"key":"1625_CR26","doi-asserted-by":"publisher","first-page":"95791","DOI":"10.1109\/ACCESS.2021.3094471","volume":"9","author":"R Sihwail","year":"2021","unstructured":"Sihwail, R., Solaiman, O., Omar, K., Ariffin, K., Alswaitti, M., Hashim, I.: A hybrid approach for solving systems of nonlinear equations using Harris hawks optimization and Newton\u2019s method. IEEE Access 9, 95791\u201395807 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3094471","journal-title":"IEEE Access"},{"issue":"2","key":"1625_CR27","doi-asserted-by":"publisher","first-page":"379","DOI":"10.32604\/iasc.2021.015285","volume":"27","author":"O Solaiman","year":"2021","unstructured":"Solaiman, O., Hashim, I.: Optimal eighth-order solver for nonlinear equations with applications in chemical engineering. Intell. Auto. Soft Comput. 27(2), 379\u2013390 (2021). https:\/\/doi.org\/10.32604\/iasc.2021.015285","journal-title":"Intell. Auto. Soft Comput."},{"issue":"6","key":"1625_CR28","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.3390\/math11061473","volume":"11","author":"O Solaiman","year":"2023","unstructured":"Solaiman, O., Sihwail, R., Shehadeh, H., Hashim, I., Alieyan, K.: Hybrid Newton-Sperm swarm optimization algorithm for nonlinear systems. Mathematics 11(6), 1473 (2023). https:\/\/doi.org\/10.3390\/math11061473","journal-title":"Mathematics"},{"key":"1625_CR29","doi-asserted-by":"publisher","unstructured":"Xiaojian, Z.: Modified Chebyshev-Halley methods free from second derivative. Appl. Math. Comput. 203(2), 824\u2013827 (2008). https:\/\/doi.org\/10.1016\/j.amc.2008.05.092","DOI":"10.1016\/j.amc.2008.05.092"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01625-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01625-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01625-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T08:20:42Z","timestamp":1710750042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01625-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1625"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01625-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"13 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}