{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:40:08Z","timestamp":1749508808601,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779603"},{"type":"electronic","value":"9783030779610"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77961-0_28","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:07:58Z","timestamp":1623352078000},"page":"330-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Acceleration of the Robust Newton Method by the Use of the S-iteration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9434-9307","authenticated-orcid":false,"given":"Krzysztof","family":"Gdawiec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5920-5161","authenticated-orcid":false,"given":"Wies\u0142aw","family":"Kotarski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0492-772X","authenticated-orcid":false,"given":"Agnieszka","family":"Lisowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"issue":"1","key":"28_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":"2","key":"28_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.37193\/CMI.2016.02.03","volume":"25","author":"G Ardelean","year":"2016","unstructured":"Ardelean, G., Balog, L.: A qualitative study of Agarwal et al. iteration procedure for fixed points approximation. Creative Math. Inf. 25(2), 135\u2013139 (2016)","journal-title":"Creative Math. Inf."},{"doi-asserted-by":"publisher","unstructured":"Deuflhard, P.: Newton Methods for Nonlinear Problems. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23899-4","key":"28_CR3","DOI":"10.1007\/978-3-642-23899-4"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1137\/S0036144596310033","volume":"40","author":"B Epureanu","year":"1998","unstructured":"Epureanu, B., Greenside, H.: Fractal basins of attraction associated with a damped Newton\u2019s method. SIAM Rev. 40(1), 102\u2013109 (1998). https:\/\/doi.org\/10.1137\/S0036144596310033","journal-title":"SIAM Rev."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1007\/s11071-017-3813-6","volume":"90","author":"K Gdawiec","year":"2017","unstructured":"Gdawiec, K.: Fractal patterns from the dynamics of combined polynomial root finding methods. Nonlinear Dyn. 90(4), 2457\u20132479 (2017). https:\/\/doi.org\/10.1007\/s11071-017-3813-6","journal-title":"Nonlinear Dyn."},{"key":"28_CR6","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":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11071-021-06306-5","volume":"104","author":"K Gdawiec","year":"2021","unstructured":"Gdawiec, K., Kotarski, W., Lisowska, A.: On the robust Newton\u2019s method with the Mann iteration and the artistic patterns from its dynamics. Nonlinear Dyn. 104(1), 297\u2013331 (2021). https:\/\/doi.org\/10.1007\/s11071-021-06306-5","journal-title":"Nonlinear Dyn."},{"doi-asserted-by":"publisher","unstructured":"Kalantari, B.: Polynomial Root-Finding and Polynomiography. World Scientific, Singapore (2009). https:\/\/doi.org\/10.1142\/9789812811837","key":"28_CR8","DOI":"10.1142\/9789812811837"},{"issue":"10","key":"28_CR9","doi-asserted-by":"publisher","first-page":"931","DOI":"10.4169\/amer.math.monthly.118.10.931","volume":"118","author":"B Kalantari","year":"2011","unstructured":"Kalantari, B.: A geometric modulus principle for polynomials. Am. Math. Mon. 118(10), 931\u2013935 (2011). https:\/\/doi.org\/10.4169\/amer.math.monthly.118.10.931","journal-title":"Am. Math. Mon."},{"unstructured":"Kalantari, B.: A globally convergent Newton method for polynomials. https:\/\/arxiv.org\/abs\/2003.00372 (2020)","key":"28_CR10"},{"doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","key":"28_CR11","DOI":"10.1007\/978-0-387-40065-5"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s11071-018-4357-0","volume":"94","author":"P Ouyang","year":"2018","unstructured":"Ouyang, P., Tang, X., Chung, K., Yu, T.: Spiral patterns of color symmetry from dynamics. Nonlinear Dyn. 94(1), 261\u2013272 (2018). https:\/\/doi.org\/10.1007\/s11071-018-4357-0","journal-title":"Nonlinear Dyn."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77961-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:02:47Z","timestamp":1749506567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77961-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779603","9783030779610"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77961-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","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":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","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":"156","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":"48","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":"14","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":"31% - 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.9","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":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}