{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:50:10Z","timestamp":1782003010911,"version":"3.54.5"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031087509","type":"print"},{"value":"9783031087516","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08751-6_45","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T02:03:15Z","timestamp":1655776995000},"page":"623-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a\u00a0New Generalised Iteration Method in\u00a0the\u00a0PSO-Based Newton-Like Method"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1315-6082","authenticated-orcid":false,"given":"Ireneusz","family":"Go\u015bciniak","sequence":"first","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"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"issue":"1","key":"45_CR1","first-page":"61","volume":"8","author":"R Agarwal","year":"2007","unstructured":"Agarwal, R., O\u2019Regan, D., Sahu, D.: Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 8(1), 61\u201379 (2007)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"3","key":"45_CR2","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."},{"key":"45_CR3","volume-title":"Numerical Mathematics and Computing","author":"W Cheney","year":"2007","unstructured":"Cheney, W., Kincaid, D.: Numerical Mathematics and Computing, 6th edn. Brooks\/Cole, Pacific Groove (2007)","edition":"6"},{"issue":"11","key":"45_CR4","first-page":"1263","volume":"17","author":"G Das","year":"1986","unstructured":"Das, G., Debata, J.: Fixed points of quasinonexpansive mappings. Indian J. Pure Appl. Math. 17(11), 1263\u20131269 (1986)","journal-title":"Indian J. Pure Appl. Math."},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.amc.2017.02.038","volume":"307","author":"K Gdawiec","year":"2017","unstructured":"Gdawiec, K., Kotarski, W.: Polynomiography for the polynomial infinity norm via Kalantari\u2019s formula and nonstandard iterations. Appl. Math. Comput. 307, 17\u201330 (2017). https:\/\/doi.org\/10.1016\/j.amc.2017.02.038","journal-title":"Appl. Math. Comput."},{"issue":"7","key":"45_CR6","doi-asserted-by":"publisher","first-page":"734","DOI":"10.3390\/e22070734","volume":"22","author":"I Go\u015bciniak","year":"2020","unstructured":"Go\u015bciniak, I., Gdawiec, K.: Visual analysis of dynamics behaviour of an iterative method depending on selected parameters and modifications. Entropy 22(7), 734 (2020). https:\/\/doi.org\/10.3390\/e22070734","journal-title":"Entropy"},{"key":"45_CR7","unstructured":"Howes, L., Munshi, A.: The OpenCL specification (2015). http:\/\/www.khronos.org\/registry\/OpenCL\/specs\/opencl-2.0.pdf"},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1090\/S0002-9939-1974-0336469-5","volume":"44","author":"S Ishikawa","year":"1974","unstructured":"Ishikawa, S.: Fixed points by a new iteration method. Proc. Am. Math. Soc. 44(1), 147\u2013150 (1974). https:\/\/doi.org\/10.1090\/S0002-9939-1974-0336469-5","journal-title":"Proc. Am. Math. Soc."},{"key":"45_CR9","doi-asserted-by":"publisher","unstructured":"Kalantari, B.: Polynomial Root-Finding and Polynomiography. World Scientific, Singapore (2009). https:\/\/doi.org\/10.1142\/9789812811837","DOI":"10.1142\/9789812811837"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s12190-010-0381-z","volume":"35","author":"S Khan","year":"2011","unstructured":"Khan, S., Cho, Y., Abbas, M.: Convergence to common fixed points by a modified iteration process. J. Appl. Math. Comput. 35(1), 607\u2013616 (2011). https:\/\/doi.org\/10.1007\/s12190-010-0381-z","journal-title":"J. Appl. Math. Comput."},{"issue":"3","key":"45_CR11","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1090\/S0002-9939-1953-0054846-3","volume":"4","author":"W Mann","year":"1953","unstructured":"Mann, W.: Mean value methods in iteration. Proc. Am. Math. Soc. 4(3), 506\u2013510 (1953). https:\/\/doi.org\/10.1090\/S0002-9939-1953-0054846-3","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"45_CR12","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"},{"issue":"4","key":"45_CR13","first-page":"145","volume":"6","author":"E Picard","year":"1890","unstructured":"Picard, E.: M\u00e9moire sur la th\u00e9orie des \u00e9quations aux d\u00e9riv\u00e9es partielles et la m\u00e9thode des approximations successives. J. de Math\u00e9matiques Pures et Appliqu\u00e9es 6(4), 145\u2013210 (1890)","journal-title":"J. de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"45_CR14","unstructured":"Wall, M.: GAlib, a C++ library of genetic algorithm components (2008). http:\/\/lancet.mit.edu\/ga\/"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08751-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:15:01Z","timestamp":1782000901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08751-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087509","9783031087516"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08751-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"474","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"175","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}