{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:24:01Z","timestamp":1768883041469,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031812408","type":"print"},{"value":"9783031812415","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_13","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:44Z","timestamp":1735652744000},"page":"182-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GPU Acceleration of\u00a0the\u00a0Enhanced Jaya Optimization Algorithm for\u00a0Solving Large Systems of\u00a0Nonlinear Equations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6032-2317","authenticated-orcid":false,"given":"Bruno","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6145-8520","authenticated-orcid":false,"given":"Luiz","family":"Guerreiro Lopes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"13_CR1","unstructured":"Bodon, E., Del Popolo, A., Luk\u0161an, L., Spedicato, E.: Numerical performance of ABS codes for systems of nonlinear equations. Technical Report DMSIA 01\/2001, Universit\u00e1 degli Studi di Bergamo, Bergamo (2001)"},{"key":"13_CR2","volume-title":"Professional CUDA\u00ae C Programming","author":"J Cheng","year":"2014","unstructured":"Cheng, J., Grossman, M., McKercher, T.: Professional CUDA\u00ae C Programming. Wiley, Indianapolis (2014)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.camwa.2022.04.013","volume":"117","author":"H Choi","year":"2022","unstructured":"Choi, H., Kim, S.D., Shin, B.C.: Choice of an initial guess for Newton\u2019s method to solve nonlinear differential equations. Comput. Math. with Appl. 117, 69\u201373 (2022). https:\/\/doi.org\/10.1016\/j.camwa.2022.04.013","journal-title":"Comput. Math. with Appl."},{"issue":"15","key":"13_CR4","doi-asserted-by":"publisher","first-page":"8121","DOI":"10.1016\/j.amc.2013.02.017","volume":"219","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu, P.: Backtracking search optimization algorithm for numerical optimization problems. Appl. Math. Comput. 219(15), 8121\u20138144 (2013). https:\/\/doi.org\/10.1016\/j.amc.2013.02.017","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/10556789708805664","volume":"8","author":"A Friedlander","year":"1997","unstructured":"Friedlander, A., Gomes-Ruggiero, M.A., Kozakevich, D.N., Mart\u00ednez, J.M., Santos, S.A.: Solving nonlinear systems of equations by means of quasi-Newton methods with a nonmonotone strategy. Optim. Methods Softw. 8(1), 25\u201351 (1997). https:\/\/doi.org\/10.1080\/10556789708805664","journal-title":"Optim. Methods Softw."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Gao, K., Mei, G., Piccialli, F., Cuomo, S., Tu, J., Huo, Z.: Julia language in machine learning: algorithms, applications, and open issues. Comput. Sci. Rev. 37, 100254 (2020). https:\/\/doi.org\/10.1016\/j.cosrev.2020.100254","DOI":"10.1016\/j.cosrev.2020.100254"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Gogoli\u0144ska, A., Mikulski, \u0141., Pi\u0105tkowski, M.: GPU Computations and Memory Access Model Based on Petri Nets, LNCS, vol. 11090, pp. 136\u2013157. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58381-4_7","DOI":"10.1007\/978-3-662-58381-4_7"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.3934\/jimo.2011.7.497","volume":"7","author":"CT Kelley","year":"2011","unstructured":"Kelley, C.T., Qi, L., Tong, X., Yin, H.: Finding a stable solution of a system of nonlinear equations. J. Ind. Manag. Optim. 7(2), 497\u2013521 (2011). https:\/\/doi.org\/10.3934\/jimo.2011.7.497","journal-title":"J. Ind. Manag. Optim."},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Kotsireas, I.S., Pardalos, P.M., Semenov, A., Trevena, W.T., Vrahatis, M.N.: Survey of methods for solving systems of nonlinear equations, Part I: root-finding approaches (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.08530","DOI":"10.48550\/arXiv.2208.08530"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981). https:\/\/doi.org\/10.1145\/355934.355936","journal-title":"ACM Trans. Math. Softw."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5267\/j.ijiec.2015.8.004","volume":"7","author":"RV Rao","year":"2016","unstructured":"Rao, R.V.: Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int. J. Ind. Eng. Comput. 7, 19\u201334 (2016). https:\/\/doi.org\/10.5267\/j.ijiec.2015.8.004","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Ribeiro, S., Silva, B., Lopes, L.G.: Solving systems of nonlinear equations using Jaya and Jaya-based algorithms: a computational comparison. In: Yadav, A., Nanda, S.J., Lim, M.H. (eds.) Proceedings of International Conference on Paradigms of Communication, Computing and Data Analytics: PCCDA 2023, pp. 119\u2013136. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-4626-6_10","DOI":"10.1007\/978-981-99-4626-6_10"},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107555","volume":"233","author":"Y Zhang","year":"2021","unstructured":"Zhang, Y., Chi, A., Mirjalili, S.: Enhanced Jaya algorithm: a simple but efficient optimization method for constrained engineering design problems. Knowl. Based Syst. 233, 107555 (2021). https:\/\/doi.org\/10.1016\/j.knosys.2021.107555","journal-title":"Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:03:35Z","timestamp":1735653815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}