{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:55:08Z","timestamp":1743152108709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_24","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"336-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Cauchy Sum Algorithms for\u00a0Polynomial Zeros and\u00a0Matrix Eigenvalues"],"prefix":"10.1007","author":[{"given":"Victor Y.","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soo","family":"Go","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Luan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"24_CR1","unstructured":"Ahlfors, L.: Complex Analysis. McGraw-Hill Series in Mathematics. McGraw-Hill (2000). ISBN: 0-07-000657-1"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: ACM-SIAM SODA 2021, pp. 522\u2013539. SIAM (2021)","DOI":"10.1137\/1.9781611976465.32"},{"key":"24_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. Symbolic Comput. 86, 51\u201396 (2018). https:\/\/doi.org\/10.1016\/j.jsc.2017.03.009","journal-title":"J. Symbolic Comput."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Pan, V.Y.: Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, computers and mathematics (with Applications), 8(1), 23\u201334 (1982)","DOI":"10.1016\/0898-1221(82)90037-2"},{"key":"24_CR5","unstructured":"Henrici, P.: Applied and Computational Complex Analysis. Volume 1: Power Series, Integration, Conformal Mapping, Location of Zeros. Wiley, New York (1974)"},{"key":"24_CR6","unstructured":"Imbach, R., Pan, V.Y.: New progress in univariate polynomial root-finding. In: Proceedings of ACM-SIGSAM ISSAC 2020, pp. 249\u2013256, Kalamata, Greece, 20\u201323 July 2020. ACM Press (2020). ISBN: 978-1-4503-7100-1\/20\/07"},{"key":"24_CR7","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":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-031-14788-3_9","volume-title":"Computer Algebra in Scientific Computing","author":"R Imbach","year":"2022","unstructured":"Imbach, R., Pan, V.Y.: Accelerated subdivision for clustering roots of polynomials given by evaluation oracles. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2022. LNCS, vol. 13366, pp. 143\u2013164. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14788-3_9"},{"key":"24_CR9","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":"24_CR10","doi-asserted-by":"publisher","unstructured":"Karstadt, E., Schwartz, O.: Matrix multiplication, a little faster. J. ACM 67(1), 1\u201331 (2020). MR 4061328, S2CID 211041916. https:\/\/doi.org\/10.1145\/3364504","DOI":"10.1145\/3364504"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1006\/jcom.1998.0481","volume":"14","author":"P Kirrinnis","year":"1998","unstructured":"Kirrinnis, P.: Polynomial factorization and partial fraction decomposition by simultaneous Newton\u2019s iteration. J. Complex. 14, 378\u2013444 (1998)","journal-title":"J. Complex."},{"key":"24_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 2. Addison-Wesley (1981) (2nd edn.) (1997) (3rd edn.)"},{"key":"24_CR13","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":"24_CR14","doi-asserted-by":"publisher","unstructured":"Louis, A., Vempala, S.S.: Accelerated Newton iteration: roots of black box polynomials and matrix eigenvalues. In: IEEE FOCS 2016, vol. 1, pp. 732\u2013740, January 2016. arXiv:1511.03186. https:\/\/doi.org\/10.1109\/FOCS.2016.83","DOI":"10.1109\/FOCS.2016.83"},{"key":"24_CR15","unstructured":"McNamee, J.M.: Numerical Methods for Roots of Polynomials, Part I, XIX+354 p. Elsevier (2007). ISBN: 044452729X, ISBN-13: 9780444527295"},{"key":"24_CR16","unstructured":"McNamee, J.M., Pan, V.Y.: Numerical Methods for Roots of Polynomials, Part II, XXI+728 p. Elsevier (2013). ISBN: 9780444527301"},{"key":"24_CR17","doi-asserted-by":"publisher","DOI":"10.1177\/027046769201200316","volume-title":"A History of Mathematics","author":"UC Merzbach","year":"2011","unstructured":"Merzbach, U.C., Boyer, C.B.: A History of Mathematics, 5th edn. Wiley, New York (2011). https:\/\/doi.org\/10.1177\/027046769201200316","edition":"5"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Pan, V.Y.: Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. In: ACM STOC 1995, pp. 741\u2013750 (1995)","DOI":"10.1145\/225058.225292"},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/S0036144595288554","volume":"39","author":"VY Pan","year":"1997","unstructured":"Pan, V.Y.: Solving a polynomial equation: some history and recent progress. SIAM Rev. 39(2), 187\u2013220 (1997). https:\/\/doi.org\/10.1137\/S0036144595288554","journal-title":"SIAM Rev."},{"issue":"1","key":"24_CR20","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":"24_CR21","doi-asserted-by":"publisher","unstructured":"Pan, V.Y.: Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. J. Symb. Comput. 33(5), 701\u2013733 (2002). Proceedings Version in ACM ISSAC 2001, pp. 253\u2013267 (2001). https:\/\/doi.org\/10.1006\/jsco.2002.0531","DOI":"10.1006\/jsco.2002.0531"},{"key":"24_CR22","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":"24_CR23","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":"24_CR24","unstructured":"Pan, V.Y.: New progress in polynomial root-finding. arXiv 1805.12042, 30 May 2018. Accessed 31 Aug 2022"},{"key":"24_CR25","unstructured":"Pan, V.Y., Fast subdivision root-finder for a black box polynomial and matrix eigen-solvers accelerated with compression. Preprint (2023)"},{"key":"24_CR26","unstructured":"Pan, V.Y.: Fast subdivision root-finders for a black box polynomial and matrix eigen-solvers with novel exclusion tests. Preprint (2023)"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Pan, V.Y., Go, S., Luan, Q., Zhao, L.: Fast approximation of polynomial zeros and matrix eigenvalues. arXiv 2301.11268 (2022). Accessed 2023","DOI":"10.1007\/978-3-031-30448-4_24"},{"key":"24_CR28","unstructured":"Reinke, B.: Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders. arXiv 2011.01660, 20 November 2020"},{"issue":"2","key":"24_CR29","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":"24_CR30","unstructured":"Sch\u00f6nhage, A.: The fundamental theorem of algebra in terms of computational complexity. Math. Dept., University of T\u00fcbingen, T\u00fcbingen, Germany (1982)"},{"issue":"4","key":"24_CR31","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.jco.2005.04.002","volume":"21","author":"A Storjohann","year":"2005","unstructured":"Storjohann, A.: The shifted number system for fast linear algebra on integer matrices. J. Complex. 21(4), 609\u2013650 (2005)","journal-title":"J. Complex."},{"key":"24_CR32","unstructured":"Strassen, V.: Some results in algebraic complexity theory. In: James, R.D. (ed.) Proceedings of the International Congress of Mathematicians, Vancouver, vol. 1, pp. 497\u2013501. Canadian Mathematical Society (1974)"},{"key":"24_CR33","doi-asserted-by":"publisher","unstructured":"Weyl, H.: Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra und Grundlagen der Mathematik. Mathematische Zeitschrift 20, 131\u2013150 (1924). https:\/\/doi.org\/10.1007\/BF01188076","DOI":"10.1007\/BF01188076"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:05:10Z","timestamp":1684191910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"25","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":"51% - 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","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":"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":"3 invited papers","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)"}}]}}