{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:32Z","timestamp":1743049652491,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147876"},{"type":"electronic","value":"9783031147883"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14788-3_9","type":"book-chapter","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T14:24:42Z","timestamp":1660141482000},"page":"143-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Accelerated Subdivision for\u00a0Clustering Roots of\u00a0Polynomials Given by\u00a0Evaluation Oracles"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Imbach","sequence":"first","affiliation":[]},{"given":"Victor Y.","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"issue":"1\/2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2644288.2644291","volume":"48","author":"J Abbott","year":"2014","unstructured":"Abbott, J.: Quadratic interval refinement for real roots. ACM Commun. Comput. Algebra 48(1\/2), 3\u201312 (2014)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Xu, J., Yap, C.: Complexity analysis of root clustering for a complex polynomial. In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp. 71\u201378. ACM (2016)","DOI":"10.1145\/2930889.2930939"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jsc.2017.03.009","volume":"86","author":"R Becker","year":"2018","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symbol. Comput. 86, 51\u201396 (2018)","journal-title":"J. Symbol. Comput."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.cam.2013.04.037","volume":"272","author":"DA Bini","year":"2014","unstructured":"Bini, D.A., Robol, L.: Solving secular and polynomial equations: a multiprecision algorithm. J. Comput. Appl. Math. 272, 276\u2013292 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-43120-4_11","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"R Imbach","year":"2020","unstructured":"Imbach, R., Pan, V.Y.: New practical advances in polynomial root clustering. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds.) MACIS 2019. LNCS, vol. 11989, pp. 122\u2013137. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43120-4_11"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Imbach, R., Pan, V.Y.: New progress in univariate polynomial root finding. In: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, pp. 249\u2013256 (2020)","DOI":"10.1145\/3373207.3404063"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Imbach, R., Pan, V.Y.: Accelerated subdivision for clustering roots of polynomials given by evaluation oracles. arXiv preprint 2206.08622 (2022)","DOI":"10.1007\/978-3-031-14788-3_9"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-96418-8_28","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"R Imbach","year":"2018","unstructured":"Imbach, R., Pan, V.Y., Yap, C.: Implementation of a near-optimal complex root clustering algorithm. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 235\u2013244. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96418-8_28"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Louis, A., Vempala, S.S.: Accelerated Newton iteration: roots of black box polynomials and matrix eigenvalues. In: IEEE 57th Annual Symposium on Foundations of Computer Science, pp. 732\u2013740 (2016)","DOI":"10.1109\/FOCS.2016.83"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-030-60026-6_25","volume-title":"Computer Algebra in Scientific Computing","author":"Q Luan","year":"2020","unstructured":"Luan, Q., Pan, V.Y., Kim, W., Zaderman, V.: Faster numerical univariate polynomial root-finding by means of subdivision iterations. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2020. LNCS, vol. 12291, pp. 431\u2013446. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60026-6_25"},{"key":"9_CR11","unstructured":"Moroz, G.: Fast real and complex root-finding methods for well-conditioned polynomials. arXiv preprint 2102.04180 (2021)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/jcom.1999.0532","volume":"16","author":"VY Pan","year":"2000","unstructured":"Pan, V.Y.: Approximating complex polynomial zeros: modified Weyl\u2019s quadtree construction and improved Newton\u2019s iteration. J. Complex. 16, 213\u2013264 (2000)","journal-title":"J. Complex."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1006\/jsco.2002.0531","volume":"33","author":"VY Pan","year":"2002","unstructured":"Pan, V.Y.: Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding. J. Symbol. Comput. 33, 701\u2013733 (2002)","journal-title":"J. Symbol. Comput."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-26831-2_26","volume-title":"Computer Algebra in Scientific Computing","author":"VY Pan","year":"2019","unstructured":"Pan, V.Y.: Old and new nearly optimal polynomial root-finders. In: England, M., Koepf, W., Sadykov, T.M., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2019. LNCS, vol. 11661, pp. 393\u2013411. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26831-2_26"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-030-60026-6_27","volume-title":"Computer Algebra in Scientific Computing","author":"VY Pan","year":"2020","unstructured":"Pan, V.Y.: Acceleration of subdivision root-finding for sparse polynomials. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2020. LNCS, vol. 12291, pp. 461\u2013477. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60026-6_27"},{"key":"9_CR16","unstructured":"Pan, V.Y.: New progress in polynomial root-finding. arXiv preprint 1805.12042 (2022)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Reinke, B.: Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders. arXiv preprint 2011.01660 (2020)","DOI":"10.1090\/proc\/15715"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0885-064X(87)90022-7","volume":"3","author":"J Renegar","year":"1987","unstructured":"Renegar, J.: On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complex. 3(2), 90\u2013113 (1987)","journal-title":"J. Complex."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jsc.2015.03.004","volume":"73","author":"M Sagraloff","year":"2016","unstructured":"Sagraloff, M., Mehlhorn, K.: Computing real roots of real polynomials. J. Symbol. Comput. 73, 46\u201386 (2016)","journal-title":"J. Symbol. Comput."},{"key":"9_CR20","unstructured":"Sch\u00f6nhage, A.: The fundamental theorem of algebra in terms of computational complexity. Manuscript. University of T\u00fcbingen, Germany (1982)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14788-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:15:48Z","timestamp":1660259748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14788-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147876","9783031147883"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14788-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","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":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","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":"32","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":"20","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":"0","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":"63% - 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":"3.25","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":"5.1","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)"}}]}}