{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:45:02Z","timestamp":1760060702623,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T00:00:00Z","timestamp":1757721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"IMU-CDC and Simons Foundation"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>A new hybrid of a Steffensen-type method and genetic algorithm is developed for the efficient simultaneous computation of roots of nonlinear equations, particularly in all cases involving non-differentiable functions and multiple roots. Traditional numerical methods often fail to handle these complexities effectively, highlighting the need for a more robust solution. The proposed algorithm combines the global search strength of the genetic algorithm (GA) with the local refinement capabilities of a derivative-free optimal fourth-order Steffensen method. This integration enhances both exploration and exploitation capabilities, leading to improved convergence and computational accuracy. By uniting the GA\u2019s global optimization with the local refinement of iterative solvers, the algorithm forms a higher-order framework capable of locating all roots concurrently. This study validates the performance of this hybrid strategy through diverse applications in biomedical engineering problems.<\/jats:p>","DOI":"10.3390\/a18090582","type":"journal-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T11:51:43Z","timestamp":1757937103000},"page":"582","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Steffensen\u2013Genetic Algorithm for Finding Multi-Roots of Nonlinear Equations and Applications to Biomedical Engineering"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0552-2783","authenticated-orcid":false,"given":"Fiza","family":"Zafar","sequence":"first","affiliation":[{"name":"Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan 60800, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7462-9173","authenticated-orcid":false,"given":"Alicia","family":"Cordero","sequence":"additional","affiliation":[{"name":"I.U. de Matematica Multidisciplinar, Universitat Polit\u00e8cnica de Val\u00e8ncia, Cami de Vera s\/n, 46022 Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadia","family":"Mujtaba","sequence":"additional","affiliation":[{"name":"Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan 60800, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9893-0761","authenticated-orcid":false,"given":"Juan R.","family":"Torregrosa","sequence":"additional","affiliation":[{"name":"I.U. de Matematica Multidisciplinar, Universitat Polit\u00e8cnica de Val\u00e8ncia, Cami de Vera s\/n, 46022 Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,9,13]]},"reference":[{"key":"ref_1","first-page":"64","article-title":"Remarks on iteration","volume":"6","author":"Steffensen","year":"1933","journal-title":"Skand. Aktuarietidskr."},{"key":"ref_2","first-page":"206","article-title":"A class of two step Steffensen type methods with fourth order of convergence","volume":"209","author":"Ren","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Behl, R. (2022). A derivative free fourth-order optimal scheme for applied science problems. Mathematics, 10.","DOI":"10.3390\/math10091372"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s11075-013-9715-x","article-title":"Algorithm for forming derivative-free optimal methods","volume":"65","author":"Khattri","year":"2014","journal-title":"Numer. Algor."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Sharma, E., Panday, S., Mittal, S.K., Joita, D.M., Pruteanu, L.L., and Jantschi, L. (2023). Derivative-free families of with-and without-memory iterative methods for solving nonlinear equations and their engineering applications. Mathematics, 11.","DOI":"10.3390\/math11214512"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s40324-022-00288-z","article-title":"A new class of derivative-free root solvers with increasing optimal convergence order and their complex dynamics","volume":"80","author":"Sharma","year":"2023","journal-title":"SeMA J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.33993\/jnaat491-1179","article-title":"Comparison of some optimal derivative-free three-point iterations","volume":"49","author":"Zhanlav","year":"2020","journal-title":"J. Numer. Anal. Approx. Theory"},{"key":"ref_8","first-page":"251","article-title":"Neuer beweis des satzes, dass jede ganze rationale funktion einer veranderlichen dargestellt werden kann als ein product aus linearen funktionen derstelben veranderlichen","volume":"3","year":"1903","journal-title":"Ges. Werke"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02162564","article-title":"Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen","volume":"8","author":"Kerner","year":"1966","journal-title":"Numer. Math."},{"key":"ref_10","first-page":"279","article-title":"Solutions numeriques des equations algebriques Tom 1: Equation du tupe F (I) = 0","volume":"2030","author":"Durand","year":"1960","journal-title":"Racines D\u2019um Polnome Masson"},{"key":"ref_11","first-page":"136","article-title":"Modified Newton method for the simultaneous computation of all roots of a given algebraic equation","volume":"5","author":"Dochev","year":"1962","journal-title":"Bulg. Phys. Math. J. Bulg. Acad. Sci."},{"key":"ref_12","first-page":"862","article-title":"Un proc\u00e9d\u00e9 it\u00e9ratif pour la factorisation des polyn\u00f4mes","volume":"262","author":"Presic","year":"1966","journal-title":"CR Acad. Sci. Paris"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0041-5553(64)90148-X","article-title":"Certain modifications of Newton\u2019s method for the approximate solution of algebraic equations","volume":"4","author":"Dochev","year":"1964","journal-title":"USSR Comput. Math. Math. Phy."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/BF01385904","article-title":"A posteriori error bounds for the zeros of polynomials","volume":"5","year":"1963","journal-title":"Numer. Math."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/363067.363115","article-title":"A modified Newton method for polynomials","volume":"10","author":"Ehrlich","year":"1967","journal-title":"Comm. ACM"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0025-5718-1973-0329236-7","article-title":"Iteration methods for finding all zeros of a polynomial simultaneously","volume":"27","author":"Aberth","year":"1973","journal-title":"Math. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/00207167708803141","article-title":"An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial","volume":"6","author":"Anourein","year":"1977","journal-title":"Int. J. Comp. Math."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"4402","DOI":"10.1137\/090758763","article-title":"On a general class of multipoint root-finding methods of high computational efficiency","volume":"47","year":"2010","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1016\/j.aej.2020.04.009","article-title":"Derivative free iterative simultaneous method for finding distinct roots of polynomial equation","volume":"59","author":"Mir","year":"2020","journal-title":"Alex. Eng. J."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Cordero, A., Garrido, N., Torregrosa, J.R., and Triguero-Navarro, P. (2022). Iterative schemes for finding all roots simultaneously of nonlinear equations. Appl. Math. Lett., 134.","DOI":"10.1016\/j.aml.2022.108325"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Shams, M., and Carpentieri, B. (2023). Efficient inverse fractional neural network-based simultaneous schemes for nonlinear engineering applications. Fractal Fract., 7.","DOI":"10.3390\/fractalfract7120849"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Elsadany, A.A., Adel, W., and Sabbar, Y. (2025). On hybrid parallel scheme for biomedical engineering problems. Biology and Sustainable Development Goals, Springer.","DOI":"10.1007\/978-981-96-3094-3"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.aej.2024.07.078","article-title":"Artificial hybrid neural network-based simultaneous scheme for solving nonlinear equations: Applications in engineering","volume":"108","author":"Shams","year":"2024","journal-title":"Alex. Eng. J."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1007\/s10910-014-0460-8","article-title":"Determination of multiple roots of nonlinear equations and applications","volume":"53","author":"Hueso","year":"2015","journal-title":"J. Math. Chem."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Kansal, M., Alshomrani, A.S., Bhalla, S., Behl, R., and Salimi, M. (2020). One parameter optimal derivative-free family to find the multiple roots of algebraic nonlinear equations. Mathematics, 8.","DOI":"10.3390\/math8122223"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Kumar, S., Kumar, D., Sharma, J.R., Cesarano, C., Agarwal, P., and Chu, Y.M. (2020). An optimal fourth order derivative-free numerical algorithm for multiple roots. Symmetry, 12.","DOI":"10.3390\/sym12061038"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1515\/ijnsns-2020-0161","article-title":"An efficient class of fourth-order derivative-free method for multiple-roots","volume":"24","author":"Kumar","year":"2023","journal-title":"Int. J. Nonlinear Sci. Numer."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Kumar, D., Sharma, J.R., and Argyros, I.K. (2020). Optimal one-point iterative function free from derivatives for multiple roots. Mathematics, 8.","DOI":"10.3390\/math8050709"},{"key":"ref_29","first-page":"1","article-title":"New fourth-order Schr\u00f6der-type methods for finding zeros of nonlinear equations having unknown multiplicity","volume":"13","author":"Thukral","year":"2016","journal-title":"J. Adv. Math. Com. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1016\/j.aml.2009.07.013","article-title":"A derivative free iterative method for finding multiple roots of nonlinear equations","volume":"22","author":"Yun","year":"2009","journal-title":"Appl. Math. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Haupt, R.L., and Haupt, S.E. (2004). Practical Genetic Algorithms, John Wiley & Sons, Inc.","DOI":"10.1002\/0471671746"},{"key":"ref_32","unstructured":"Deb, K. (2001). Multiobjective Optimization Using Evolutionary Algorithms, Wiley."},{"key":"ref_33","unstructured":"Ortega, J.M., and Rheinboldt, W.C. (1970). Iterative Solution of Nonlinear Equations in Several Variables, Academic Press."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Solaiman, O.S., Sihwail, R., Shehadeh, H., Hashim, I., and Alieyan, K. (2023). Hybrid Newton\u2013Sperm swarm optimization algorithm for nonlinear systems. Mathematics, 11.","DOI":"10.3390\/math11061473"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.2478\/amns.2022.2.0161","article-title":"A hybrid computational intelligence method of Newton\u2019s method and genetic algorithm for solving compatible nonlinear equations","volume":"8","author":"Wang","year":"2023","journal-title":"Appl. Math. Nonlinear Sci."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Qiu, T., Hu, H., Chen, R., Zhou, Q., Guan, Q., and Li, X. (2021). A multi-root solver for discontinuous and non-differentiable equations by integrating genetic algorithm and derivative-free iterative methods. Appl. Soft Comput., 109.","DOI":"10.1016\/j.asoc.2021.107493"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"King, M.R., and Mody, N.A. (2010). Numerical and Statistical Methods for Bioengineering: Applications in MATLAB, Cambridge University Press.","DOI":"10.1017\/CBO9780511780936"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/9\/582\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:45:16Z","timestamp":1760035516000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/9\/582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,13]]},"references-count":37,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["a18090582"],"URL":"https:\/\/doi.org\/10.3390\/a18090582","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,9,13]]}}}