{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:24:30Z","timestamp":1760149470717,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,8,6]],"date-time":"2023-08-06T00:00:00Z","timestamp":1691280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Technical University of Cluj-Napoca"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In this paper, we have constructed new families of derivative-free three- and four-parametric methods with and without memory for finding the roots of nonlinear equations. Error analysis verifies that the without-memory methods are optimal as per Kung\u2013Traub\u2019s conjecture, with orders of convergence of 4 and 8, respectively. To further enhance their convergence capabilities, the with-memory methods incorporate accelerating parameters, elevating their convergence orders to 7.5311 and 15.5156, respectively, without introducing extra function evaluations. As such, they exhibit exceptional efficiency indices of 1.9601 and 1.9847, respectively, nearing the maximum efficiency index of 2. The convergence domains are also analysed using the basins of attraction, which exhibit symmetrical patterns and shed light on the fascinating interplay between symmetry, dynamic behaviour, the number of diverging points, and efficient root-finding methods for nonlinear equations. Numerical experiments and comparison with existing methods are carried out on some nonlinear functions, including real-world chemical engineering problems, to demonstrate the effectiveness of the new proposed methods and confirm the theoretical results. Notably, our numerical experiments reveal that the proposed methods outperform their existing counterparts, offering superior precision in computation.<\/jats:p>","DOI":"10.3390\/sym15081546","type":"journal-article","created":{"date-parts":[[2023,8,6]],"date-time":"2023-08-06T10:01:53Z","timestamp":1691316113000},"page":"1546","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Families of Multi-Point Iterative Methods and Their Self-Acceleration with Memory for Solving Nonlinear Equations"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4521-0058","authenticated-orcid":false,"given":"G","family":"Thangkhenpau","sequence":"first","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Manipur, Imphal 795004, Manipur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6860-5220","authenticated-orcid":false,"given":"Sunil","family":"Panday","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Manipur, Imphal 795004, Manipur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3539-0750","authenticated-orcid":false,"given":"Liviu C.","family":"Bolundu\u0163","sequence":"additional","affiliation":[{"name":"Department of Physics and Chemistry, Technical University of Cluj-Napoca, 103-105 Muncii Blvd., 400641 Cluj-Napoca, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8524-743X","authenticated-orcid":false,"given":"Lorentz","family":"J\u00e4ntschi","sequence":"additional","affiliation":[{"name":"Department of Physics and Chemistry, Technical University of Cluj-Napoca, 103-105 Muncii Blvd., 400641 Cluj-Napoca, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,6]]},"reference":[{"key":"ref_1","unstructured":"Traub, J.F. (1982). Iterative Methods for the Solution of Equations, American Mathematical Society."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s40324-019-00191-0","article-title":"Optimal fourth order methods with its multi-step version for nonlinear equation and their Basins of attraction","volume":"76","author":"Sivakumar","year":"2019","journal-title":"SeMA"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1016\/j.jksus.2018.12.001","article-title":"Optimal fourth- and eighth-order of convergence derivative-free modifications of King\u2019s method","volume":"31","author":"Solaiman","year":"2019","journal-title":"J. King Saud Univ. Sci."},{"key":"ref_4","first-page":"335","article-title":"Optimal Eight Order Derivative-Free Family of Iterative Methods for Solving Nonlinear Equations","volume":"50","author":"Thangkhenpau","year":"2023","journal-title":"IAENG Int. J. Comput. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.18576\/amis\/100125","article-title":"A class of optimal eighth-order Steffensen-type iterative methods for solving nonlinear equations and their basins of attraction","volume":"10","author":"Singh","year":"2016","journal-title":"Appl. Math. Inf. Sci."},{"key":"ref_6","first-page":"574","article-title":"Efficient Families of Multipoint Iterative Methods for Solving Nonlinear Equations","volume":"31","author":"Thangkhenpau","year":"2023","journal-title":"Eng. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/321850.321860","article-title":"Optimal order of one-point and multipoint iteration","volume":"21","author":"Kung","year":"1974","journal-title":"J. Am. Comput. Mach."},{"key":"ref_8","unstructured":"Ortega, J.M., and Rheinboldt, W.G. (1970). Iterative Solution of Nonlinear Equations in Several Variables, Academic Press."},{"key":"ref_9","unstructured":"Ostrowski, A.M. (1966). Solution of Equations and Systems of Equations, Academic Press."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Awadalla, M., Qureshi, S., Soomro, A., and Abuasbeh, K. (2023). A Novel Three-Step Numerical Solver for Physical Models under Fractal Behavior. Symmetry, 15.","DOI":"10.3390\/sym15020330"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Akram, S., Khalid, M., Junjua, M.-U.-D., Altaf, S., and Kumar, S. (2023). Extension of King\u2019s Iterative Scheme by Means of Memory for Nonlinear Equations. Symmetry, 15.","DOI":"10.3390\/sym15051116"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s11075-012-9641-3","article-title":"On efficient two-parameter methods for solving nonlinear equations","volume":"63","year":"2013","journal-title":"Numer. Algorithms"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Agrawal, P., Mohapatra, R., Singh, U., and Srivastava, H. (2015). Mathematical Analysis and Its Applications, Springer.","DOI":"10.1007\/978-81-322-2485-3"},{"key":"ref_14","first-page":"100243","article-title":"New efficient bi-parametric families of iterative methods with engineering applications and their basins of attraction","volume":"12","author":"Thangkhenpau","year":"2023","journal-title":"Res. Control Optim.."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1410","DOI":"10.22436\/jnsa.009.04.01","article-title":"Construction of tri-parametric derivative free fourth order with and without memory iterative method","volume":"9","author":"Zafara","year":"2016","journal-title":"J. Nonlinear Sci. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.33993\/jnaat501-1230","article-title":"A two-point eighth-order method based on the weight function for solving nonlinear equations","volume":"50","author":"Torkashvand","year":"2021","journal-title":"J. Numer. Anal. Approx. Theory"},{"key":"ref_17","first-page":"452","article-title":"Several iterative methods with memory using self-accelerators","volume":"254","author":"Soleymani","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"e1024","DOI":"10.1002\/cmm4.1024","article-title":"A class of four parametric with- and without-memory root finding methods","volume":"1","author":"Zafar","year":"2019","journal-title":"Comput. Math. Methods"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/8093673","article-title":"Efficient four parametric with and without-memory iterative methods possessing high efficiency indices","volume":"2018","author":"Cordero","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_20","unstructured":"Chapra, S.C. (2012). Applied Numerical Methods with MATLAB\u00ae for Engineers and Scientists, McGraw-Hill. [3rd ed.]."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"99287","DOI":"10.1109\/ACCESS.2021.3095941","article-title":"Numerical methods with engineering applications and their visual analysis via polynomiography","volume":"9","author":"Naseem","year":"2021","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"6643514","DOI":"10.1155\/2021\/6643514","article-title":"Inverse numerical iterative technique for finding all roots of non-linear equations with engineering applications","volume":"2021","author":"Shams","year":"2021","journal-title":"J. Math."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1137\/100805340","article-title":"Remarks on \u201cOn a general class of multipoint root-finding methods of high computational efficiency\u201d","volume":"49","year":"2011","journal-title":"SIAM J. Numer. Math."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/8\/1546\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:26:47Z","timestamp":1760128007000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/8\/1546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,6]]},"references-count":23,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["sym15081546"],"URL":"https:\/\/doi.org\/10.3390\/sym15081546","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2023,8,6]]}}}