{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:21:37Z","timestamp":1743045697590,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030600259"},{"type":"electronic","value":"9783030600266"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60026-6_25","type":"book-chapter","created":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T20:02:36Z","timestamp":1602964956000},"page":"431-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations"],"prefix":"10.1007","author":[{"given":"Qi","family":"Luan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor Y.","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wongeun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Zaderman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W Baur","year":"1983","unstructured":"Baur, W., Strassen, V.: On the complexity of partial derivatives. Theoret. Comput. Sci. 22, 317\u2013330 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR2","doi-asserted-by":"publisher","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. Symb. Comput. 86, 51\u201396 (2018), Proceedings version. In: ACM ISSAC, pp. 71\u201378 (2016). https:\/\/doi.org\/10.1016\/j.jsc.2017.03.009","DOI":"10.1016\/j.jsc.2017.03.009"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1019199917103","volume":"23","author":"DA Bini","year":"2000","unstructured":"Bini, D.A., Fiorentino, G.: Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numer. Algorithms 23, 127\u2013173 (2000). https:\/\/doi.org\/10.1023\/A:1019199917103","journal-title":"Numer. Algorithms"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1006\/jcom.1996.0030","volume":"12","author":"D Bini","year":"1996","unstructured":"Bini, D., Pan, V.Y.: Graeffe\u2019s, Chebyshev-like, and Cardinal\u2019s processes for splitting a polynomial into factors. J. Complex. 12, 492\u2013511 (1996)","journal-title":"J. Complex."},{"key":"25_CR5","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). https:\/\/doi.org\/10.1016\/j.cam.2013.04.037","journal-title":"J. Comput. Appl. Math."},{"issue":"51","key":"25_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2307\/1969500","volume":"2","author":"P Erd\u0151s","year":"1950","unstructured":"Erd\u0151s, P., Tur\u00e1n, P.: On the distribution of roots of polynomials. Ann. Math 2(51), 105\u2013119 (1950)","journal-title":"Ann. Math"},{"issue":"181","key":"25_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1090\/S0025-5718-1988-0917825-9","volume":"50","author":"A Gerasoulis","year":"1988","unstructured":"Gerasoulis, A.: A fast algorithm for the multiplication of generalized Hilbert matrices with vectors. Math. Comput. 50(181), 179\u2013188 (1988)","journal-title":"Math. Comput."},{"key":"25_CR8","unstructured":"Henrici, P.: Applied and Computational Complex Analysis, Vol. 1: Power Series, Integration, Conformal Mapping, Location of Zeros. Wiley, New York (1974)"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"464","DOI":"10.2307\/2310626","volume":"66","author":"AS Householder","year":"1959","unstructured":"Householder, A.S.: Dandelin, Lobachevskii, or Graeffe? Amer. Math. Mon. 66, 464\u2013466 (1959). https:\/\/doi.org\/10.2307\/2310626","journal-title":"Amer. Math. Mon."},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Imbach, R., Pan, V.Y.: New progress in univariate polynomial root-finding. In: Proceedings of ACM-SIGSAM ISSAC 2020, pp. 249\u2013256, July 20\u201323, 2020, Kalamata, Greece, ACM Press, New York (2020). ACM ISBN 978-1-4503-7100-1\/20\/07. https:\/\/doi.org\/10.1145\/3373207.3403979","DOI":"10.1145\/3373207.3403979"},{"key":"25_CR11","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":"25_CR12","doi-asserted-by":"publisher","unstructured":"Kobel, A., Rouillier, F., Sagralo, M.: Computing real roots of real polynomials... and now for real! In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), pp. 301\u2013310. ACM Press, New York (2016) https:\/\/doi.org\/10.1145\/2930889.2930937","DOI":"10.1145\/2930889.2930937"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01931367","volume":"16","author":"S Linnainmaa","year":"1976","unstructured":"Linnainmaa, S.: Taylor expansion of the accumulated rounding errors. BIT 16, 146\u2013160 (1976)","journal-title":"BIT"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/jcom.1999","volume":"16","author":"VY Pan","year":"2000","unstructured":"Pan, V.Y.: Approximation of complex polynomial zeros: modified quadtree (Weyl\u2019s) construction and improved Newton\u2019s iteration. J. Complex. 16(1), 213\u2013264 (2000). https:\/\/doi.org\/10.1006\/jcom.1999","journal-title":"J. Complex."},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Pan, V.Y.: Structured Matrices and Polynomials: Unified Superfast Algorithms. Birkh\u00e4user\/Springer, Boston\/New York (2001) https:\/\/doi.org\/10.1007\/978-1-4612-0129-8","DOI":"10.1007\/978-1-4612-0129-8"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Pan, V.Y.: Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. J. Symb. Comput. 33(5), 701\u2013733, : Proceedings version. ACM STOC 1995, 741\u2013750 (2002). https:\/\/doi.org\/10.1006\/jsco.2002.0531","DOI":"10.1006\/jsco.2002.0531"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Pan, V.Y.: Old and new nearly optimal polynomial root-Finding. In: England,M., Koepf, W., Sadykov, T.M., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC2019. LNCS, vol. 11661, pp, 393\u2013411. Springer, Nature Switzerland (2019) https:\/\/doi.org\/10.1007\/978-3-030-26831-2","DOI":"10.1007\/978-3-030-26831-2"},{"key":"25_CR18","unstructured":"Pan, V.Y.: New Acceleration of Univariate Polynomial Root-finders, August 2020. arXiv: 1805.12042"},{"key":"25_CR19","volume-title":"CASC 2020","author":"VY Pan","year":"2020","unstructured":"Pan, V.Y.: Acceleration of subdivision root-finding for sparse polynomials. to appear. In: Boulier, F., England, M., Sadikov, T.M., Vorozhtsov, E.V. (eds.) CASC 2020. Springer Nature, Switzerland (2020)"},{"key":"25_CR20","unstructured":"Pan, V.Y., Zhao, L.: Real root isolation by means of root radii approximation. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.), CASC 2015. LNCS, vol. 9301, pp. 347\u2013358. Springer, Heidelberg (2015). arXiv:1501.05386"},{"issue":"2","key":"25_CR21","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). https:\/\/doi.org\/10.1016\/0885-064X(87)90022-7","journal-title":"J. Complex."},{"key":"25_CR22","unstructured":"Sch\u00f6nhage, A.: The fundamental theorem of algebra in terms of computational complexity. Math. Dept., Univ. T\u00fcbingen, Germany (1982)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Weyl, H.: Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra und Grundlagen der Mathematik. Mathematische Zeitschrift 20, 131\u2013151 (1924)","DOI":"10.1007\/BF01188076"}],"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-030-60026-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T21:34:26Z","timestamp":1619300066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60026-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600259","9783030600266"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60026-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 October 2020","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":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","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":"casc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.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":"41","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":"34","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":"83% - 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.17","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.6","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":"The conference was held virtually due to the COVID-19 pandemic. Two invited talks are also included.","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)"}}]}}