{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:07:11Z","timestamp":1753888031173,"version":"3.41.2"},"reference-count":38,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"vor","delay-in-days":332,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Nowadays, the use of computers is becoming very important in various fields of mathematics and engineering sciences. Many complex statistics can be sorted out easily with the help of different computer programs in seconds, especially in computational and applied Mathematics. With the help of different computer tools and languages, a variety of iterative algorithms can be operated in computers for solving different nonlinear problems. The most important factor of an iterative algorithm is its efficiency that relies upon the convergence rate and computational cost per iteration. Taking these facts into account, this article aims to design a new iterative algorithm that is derivative\u2010free and performs better. We construct this algorithm by applying the forward\u2010 and finite\u2010difference schemes on Golbabai\u2013Javidi\u2019s method which yields us an efficient and derivative\u2010free algorithm whose computational cost is low as per iteration. We also study the convergence criterion of the designed algorithm and prove its quartic\u2010order convergence. To analyze it numerically, we consider nine different types of numerical test examples and solve them for demonstrating its accuracy, validity, and applicability. The considered problems also involve some real\u2010life applications of civil and chemical engineering. The obtained numerical results of the test examples show that the newly designed algorithm is working better against the other similar algorithms in the literature. For the graphical analysis, we consider some different degrees\u2019 complex polynomials and draw the polynomiographs of the designed quartic\u2010order algorithm and compare it with the other similar existing methods with the help of a computer program. The graphical results reveal the better convergence speed and the other graphical characteristics of the designed algorithm over the other comparable ones.<\/jats:p>","DOI":"10.1155\/2021\/6369466","type":"journal-article","created":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:35:07Z","timestamp":1638218107000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Root\u2010Finding Algorithm for Solving Real\u2010World Problems and Its Complex Dynamics via Computer Technology"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7010-6810","authenticated-orcid":false,"given":"Amir","family":"Naseem","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8042-1619","authenticated-orcid":false,"given":"M. A.","family":"Rehman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7116-3251","authenticated-orcid":false,"given":"Jihad","family":"Younis","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,11,29]]},"reference":[{"volume-title":"Numerical Analysis","year":"1990","author":"Kincaid D. E.","key":"e_1_2_10_1_2"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0096-3003(03)00282-0"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906470"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/1706841"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"CebicD. PaunovicM. andRalevicN. M. A variant of sharma-arora\u2032s optimal eighth-order family of methods for finding A simple root of nonlinear equation Proceedings of the IEEE 16th International Symposium on Intelligent Systems and Informatics (SISY) September 2018 Subotica Serbia https:\/\/doi.org\/10.1109\/SISY.2018.8524857 2-s2.0-85057961843.","DOI":"10.1109\/SISY.2018.8524857"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/5070363"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5566379"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3091473"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/2816843"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2017.1367387"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/301718"},{"volume-title":"Iterative Methods for the Solution of Equations","year":"1982","author":"Traub J. F.","key":"e_1_2_10_12_2"},{"key":"e_1_2_10_13_2","article-title":"Some new iterative methods for solving nonlinear equations","volume":"20","author":"Noor M. A.","year":"2012","journal-title":"World Applied Sciences Journal"},{"key":"e_1_2_10_14_2","first-page":"30","article-title":"On Newton-type methods with fourth and fifth-order convergence","volume":"2","author":"Zhanlav T.","year":"2010","journal-title":"Discrete and Continuous Models and Applied Computational Science"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.02.079"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2017.612136"},{"volume-title":"Basic Transport Phenomena in Biomedical Engineering","year":"2007","author":"Fournier R. L.","key":"e_1_2_10_17_2"},{"key":"e_1_2_10_18_2","unstructured":"WaalsV. D.andDiderikJ. Over de Continuiteit van den Gas- en Vloeistoftoestand (on the continuity of the gas and liquid state 1873 University of Illinois Leiden The Netherlands Ph.D. thesis."},{"key":"e_1_2_10_19_2","first-page":"161","article-title":"On the flow of water in open channels and pipes","volume":"20","author":"Manning R.","year":"1891","journal-title":"Transactions of the Institution of Civil Engineers of Ireland"},{"volume-title":"The Theory of Heat Radiation","year":"1914","author":"Planck M.","key":"e_1_2_10_20_2"},{"key":"e_1_2_10_21_2","unstructured":"KalantariB. 2005 Method of Creating Graphical Works Based on Polynomials."},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1162\/0024094054029010"},{"volume-title":"Numerical Analysis","year":"1997","author":"Burden R. L.","key":"e_1_2_10_23_2"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(93)90137-4"},{"volume-title":"The Numerical Treatment of a Single Nonlinear Equation","year":"1970","author":"Householder A. S.","key":"e_1_2_10_25_2"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-017-3813-6"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym11091143"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.3390\/e22070734"},{"key":"e_1_2_10_29_2","unstructured":"KalantariB. An invitation to polynomiography via exponential series 2017 https:\/\/arxiv.org\/abs\/1707.09417."},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1080\/17513472.2019.1600959"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33179-4_30"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2892013"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.32604\/iasc.2021.019164"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3095941"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksus.2021.101457"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3049428"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.07.076"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.10.049"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6369466.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6369466.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6369466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:16:32Z","timestamp":1723241792000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6369466"}},"subtitle":[],"editor":[{"given":"Maricel","family":"Agop","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6369466"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6369466","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-09-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6369466"}}