{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:40:54Z","timestamp":1762324854655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_10","type":"book-chapter","created":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T20:02:36Z","timestamp":1602964956000},"page":"170-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The GPGCD Algorithm with the B\u00e9zout Matrix"],"prefix":"10.1007","author":[{"given":"Boming","family":"Chi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0846-3643","authenticated-orcid":false,"given":"Akira","family":"Terui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,2]]},"reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1006\/jsco.1998.0235","volume":"26","author":"B Beckermann","year":"1998","unstructured":"Beckermann, B., Labahn, G.: A fast and numerically stable euclidean-like algorithm for detecting relatively prime numerical polynomials. J. Symb. Comput. 26(6), 691\u2013714 (1998). https:\/\/doi.org\/10.1006\/jsco.1998.0235","journal-title":"J. Symb. Comput."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Chi, B., Terui, A.: ct1counter\/bezout-gpgcd: Initial release (2020). https:\/\/doi.org\/10.5281\/zenodo.3965389","DOI":"10.5281\/zenodo.3965389"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Chin, P., Corless, R.M., Corliss, G.F.: Optimization strategies for the approximate GCD problem. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation. pp. 228\u2013235. ACM (1998). https:\/\/doi.org\/10.1145\/281508.281622","DOI":"10.1145\/281508.281622"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1006\/jsco.2001.0462","volume":"33","author":"EW Chionh","year":"2002","unstructured":"Chionh, E.W., Zhang, M., Goldman, R.N.: Fast computation of the Bezout and dixon resultant matrices. J. Symb. Comput. 33(1), 13\u201329 (2002). https:\/\/doi.org\/10.1006\/jsco.2001.0462","journal-title":"J. Symb. Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Corless, R.M., Gianni, P.M., Trager, B.M., Watt, S.M.: The singular value decomposition for polynomial systems. In: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation. pp. 195\u2013207. ACM (1995). https:\/\/doi.org\/10.1145\/220346.220371","DOI":"10.1145\/220346.220371"},{"issue":"12","key":"10_CR6","doi-asserted-by":"publisher","first-page":"3394","DOI":"10.1109\/TSP.2004.837413","volume":"52","author":"RM Corless","year":"2004","unstructured":"Corless, R.M., Watt, S.M., Zhi, L.: $$QR$$ factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Process. 52(12), 3394\u20133402 (2004). https:\/\/doi.org\/10.1109\/TSP.2004.837413","journal-title":"IEEE Trans. Signal Process."},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Demmel, J.W.: Applied numerical linear algebra. Society for Industrial and Applied Mathematics (1997). https:\/\/doi.org\/10.1137\/1.9781611971446","DOI":"10.1137\/1.9781611971446"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/jsco.2002.0542","volume":"34","author":"GM Diaz-Toca","year":"2002","unstructured":"Diaz-Toca, G.M., Gonzalez-Vega, L.: Barnett\u2019s theorems about the greatest common divisor of several univariate polynomials through bezout-like matrices. J. Symb. Comput. 34(1), 59\u201381 (2002). https:\/\/doi.org\/10.1006\/jsco.2002.0542","journal-title":"J. Symb. Comput."},{"issue":"118","key":"10_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0022-4049(97)00013-3","volume":"117","author":"IZ Emiris","year":"1997","unstructured":"Emiris, I.Z., Galligo, A., Lombardi, H.: Certified approximate univariate GCDs. J. Pure Appl. Algebra 117(118), 229\u2013251 (1997). https:\/\/doi.org\/10.1016\/S0022-4049(97)00013-3","journal-title":"J. Pure Appl. Algebra"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation. pp. 169\u2013176. ACM, New York, NY, USA (2006). https:\/\/doi.org\/10.1145\/1145768.1145799","DOI":"10.1145\/1145768.1145799"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Structured low rank approximation of a Sylvester matrix. In: Wang, D., Zhi, L. (eds.) Symbolic-Numeric Computation, pp. 69\u201383. Trends in Mathematics, Birkh\u00e4user (2007), https:\/\/doi.org\/10.1007\/978-3-7643-7984-1_5","DOI":"10.1007\/978-3-7643-7984-1_5"},{"issue":"6","key":"10_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1006\/jsco.1998.0232","volume":"26","author":"NK Karmarkar","year":"1998","unstructured":"Karmarkar, N.K., Lakshman, Y.N.: On approximate GCDs of univariate polynomials. J. Symb. Comput. 26(6), 653\u2013666 (1998). https:\/\/doi.org\/10.1006\/jsco.1998.0232","journal-title":"J. Symb. Comput."},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998). https:\/\/doi.org\/10.1145\/272991.272995","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00211-014-0635-z","volume":"129","author":"Y Nakatsukasa","year":"2014","unstructured":"Nakatsukasa, Y., Noferini, V., Townsend, A.: Computing the common zeros of two bivariate functions via B\u00e9zout resultants. Numer. Math. 129(1), 181\u2013209 (2014). https:\/\/doi.org\/10.1007\/s00211-014-0635-z","journal-title":"Numer. Math."},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.2001.3032","volume":"167","author":"VY Pan","year":"2001","unstructured":"Pan, V.Y.: Computation of approximate polynomial GCDs and an extension. Inf. and Comput. 167(2), 71\u201385 (2001). https:\/\/doi.org\/10.1006\/inco.2001.3032","journal-title":"Inf. and Comput."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0109044","volume":"9","author":"JB Rosen","year":"1961","unstructured":"Rosen, J.B.: The gradient projection method for nonlinear programming. II. Nonlinear constraints. J. Soc. Indust. Appl. Math. 9, 514\u2013532 (1961). https:\/\/doi.org\/10.1137\/0109044","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"2","key":"10_CR17","first-page":"159","volume":"12","author":"T Sasaki","year":"1989","unstructured":"Sasaki, T., Noda, M.T.: Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations. J. Inf. Process. 12(2), 159\u2013168 (1989)","journal-title":"J. Inf. Process."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0885-064X(85)90024-X","volume":"1","author":"A Sch\u00f6nhage","year":"1985","unstructured":"Sch\u00f6nhage, A.: Quasi-gcd computations. J. Complexity 1(1), 118\u2013137 (1985). https:\/\/doi.org\/10.1016\/0885-064X(85)90024-X","journal-title":"J. Complexity"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10208-015-9256-x","volume":"16","author":"\u00c9 Schost","year":"2015","unstructured":"Schost, \u00c9., Spaenlehauer, P.-J.: A quadratically convergent algorithm for structured low-rank approximation. Found. Comput. Math. 16(2), 457\u2013492 (2015). https:\/\/doi.org\/10.1007\/s10208-015-9256-x","journal-title":"Found. Comput. Math."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11786-007-0014-6","volume":"1","author":"D Sun","year":"2007","unstructured":"Sun, D., Zhi, L.: Structured low rank approximation of a bezout matrix. Math. Comput. Sci. 1(2), 427\u2013437 (2007). https:\/\/doi.org\/10.1007\/s11786-007-0014-6","journal-title":"Math. Comput. Sci."},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF00934495","volume":"30","author":"K Tanabe","year":"1980","unstructured":"Tanabe, K.: A geometric method in nonlinear programming. J. Optimiz. Theory Appl. 30(2), 181\u2013210 (1980). https:\/\/doi.org\/10.1007\/BF00934495","journal-title":"J. Optimiz. Theory Appl."},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Terui, A.: An iterative method for calculating approximate GCD of univariate polynomials. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation - ISSAC 2009. pp. 351\u2013358. ACM Press, New York, New York, USA (2009). https:\/\/doi.org\/10.1145\/1576702.1576750","DOI":"10.1145\/1576702.1576750"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2012.10.023","volume":"479","author":"A Terui","year":"2013","unstructured":"Terui, A.: GPGCD: an iterative method for calculating approximate gcd of univariate polynomials. Theor. Comput. Sci. 479, 127\u2013149 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.023","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"10_CR24","doi-asserted-by":"publisher","first-page":"3042","DOI":"10.1109\/78.875462","volume":"48","author":"CJ Zarowski","year":"2000","unstructured":"Zarowski, C.J., Ma, X., Fairman, F.W.: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients. IEEE Trans. Signal Process. 48(11), 3042\u20133051 (2000). https:\/\/doi.org\/10.1109\/78.875462","journal-title":"IEEE Trans. Signal Process."},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Zeng, Z.: The numerical greatest common divisor of univariate polynomials. In: Gurvits, L., P\u00e9bay, P., Rojas, J.M., Thompson, D. (eds.) Randomization, Relaxation, and Complexity in Polynomial Equation Solving, Contemporary Mathematics, vol. 556, pp. 187\u2013217. AMS (2011). https:\/\/doi.org\/10.1090\/conm\/556","DOI":"10.1090\/conm\/556"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Zhi, L.: Displacement structure in computing approximate GCD of univariate polynomials. In: Computer mathematics: Proceedings Six Asian Symposium on Computer Mathematics (ASCM 2003), Lecture Notes Series on Computing, vol. 10, pp. 288\u2013298. World Scientific Publishing, River Edge, NJ (2003), https:\/\/doi.org\/10.1142\/9789812704436_0024","DOI":"10.1142\/9789812704436_0024"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T21:32:13Z","timestamp":1619299933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60026-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600259","9783030600266"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60026-6_10","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)"}}]}}