{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:16:24Z","timestamp":1762323384938,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152733"},{"type":"electronic","value":"9783642152740"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15274-0_22","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T14:17:34Z","timestamp":1283609854000},"page":"238-249","source":"Crossref","is-referenced-by-count":1,"title":["GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials"],"prefix":"10.1007","author":[{"given":"Akira","family":"Terui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"22_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. Symbolic Comput.\u00a026(6), 691\u2013714 (1998), Symbolic numeric algebra for polynomials","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"22_CR2","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. Inform. Process.\u00a012(2), 159\u2013168 (1989)","journal-title":"J. Inform. Process."},{"issue":"1","key":"22_CR3","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\u00a01(1), 118\u2013137 (1985)","journal-title":"J. Complexity"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/220346.220371","volume-title":"Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation","author":"R.M. Corless","year":"1995","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, New York (1995)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Galligo, A., Lombardi, H.: Certified approximate univariate GCDs. J. Pure Appl. Algebra\u00a0117\/118, 229\u2013251 (1997), Algorithms for algebra (Eindhoven, 1996)","DOI":"10.1016\/S0022-4049(97)00013-3"},{"issue":"12","key":"22_CR6","doi-asserted-by":"publisher","first-page":"3394","DOI":"10.1109\/TSP.2004.837413","volume":"52","author":"R.M. 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.\u00a052(12), 3394\u20133402 (2004)","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"22_CR7","doi-asserted-by":"publisher","first-page":"3042","DOI":"10.1109\/78.875462","volume":"48","author":"C.J. 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.\u00a048(11), 3042\u20133051 (2000)","journal-title":"IEEE Trans. Signal Process."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Zhi, L.: Displacement structure in computing approximate GCD of univariate polynomials. In: Computer mathematics: Proc. Six Asian Symposium on Computer Mathematics (ASCM 2003), River Edge, NJ. Lecture Notes Ser. Comput., vol.\u00a010, pp. 288\u2013298. World Sci. Publ. (2003)","DOI":"10.1142\/9789812704436_0024"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.2001.3032","volume":"167","author":"V.Y. Pan","year":"2001","unstructured":"Pan, V.Y.: Computation of approximate polynomial GCDs and an extension. Inform. and Comput.\u00a0167(2), 71\u201385 (2001)","journal-title":"Inform. and Comput."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/281508.281622","volume-title":"Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation","author":"P. Chin","year":"1998","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, New York (1998) (electronic)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1145768.1145799","volume-title":"Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation","author":"E. Kaltofen","year":"2006","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 (2006)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-7643-7984-1_5","volume-title":"Symbolic-Numeric Computation. Trends in Mathematics","author":"E. Kaltofen","year":"2007","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Structured low rank approximation of a Sylvester matrix. In: Wang, D., Zhi, L. (eds.) Symbolic-Numeric Computation. Trends in Mathematics, pp. 69\u201383. Birkh\u00e4user, Basel (2007)"},{"issue":"6","key":"22_CR13","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1006\/jsco.1998.0232","volume":"26","author":"N.K. Karmarkar","year":"1998","unstructured":"Karmarkar, N.K., Lakshman, Y.N.: On approximate GCDs of univariate polynomials. J. Symbolic Comput.\u00a026(6), 653\u2013666 (1998), Symbolic numeric algebra for polynomials","journal-title":"J. Symbolic Comput."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Zeng, Z.: The approximate GCD of inexact polynomials, Part I: a univariate algorithm (extended abstract), 8 p. (2004) (preprint)","DOI":"10.1145\/1005285.1005331"},{"issue":"3","key":"22_CR15","first-page":"227","volume":"7","author":"N. Ohsako","year":"1997","unstructured":"Ohsako, N., Sugiura, H., Torii, T.: A stable extended algorithm for generating polynomial remainder sequence. Trans. Japan Soc. Indus. Appl. Math.\u00a07(3), 227\u2013255 (1997) (in Japanese)","journal-title":"Trans. Japan Soc. Indus. Appl. Math."},{"key":"22_CR16","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/1277500.1277525","volume-title":"SNC 2007: Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation","author":"M. Sanuki","year":"2007","unstructured":"Sanuki, M., Sasaki, T.: Computing approximate GCDs in ill-conditioned cases. In: SNC 2007: Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation, pp. 170\u2013179. ACM, New York (2007)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/1576702.1576750","volume-title":"Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation","author":"A. Terui","year":"2009","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, pp. 351\u2013358. ACM Press, New York (2009)"},{"issue":"2","key":"22_CR18","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. Optim. Theory Appl.\u00a030(2), 181\u2013210 (1980)","journal-title":"J. Optim. Theory Appl."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0109044","volume":"9","author":"J.B. Rosen","year":"1961","unstructured":"Rosen, J.B.: The gradient projection method for nonlinear programming. II. Nonlinear constraints. J. Soc. Indust. Appl. Math.\u00a09, 514\u2013532 (1961)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0022-4049(99)00014-6","volume":"139","author":"D. Rupprecht","year":"1999","unstructured":"Rupprecht, D.: An algorithm for computing certified approximate GCD of n univariate polynomials. J. Pure Appl. Algebra\u00a0139, 255\u2013284 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Terui, A.: GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients. In: Proceedings of the Joint Conference of ASCM 2009 and MACIS 2009. COE Lecture Note., Faculty of Mathematics, vol.\u00a022, pp. 212\u2013221. Kyushu University (December 2009)","DOI":"10.1145\/1576702.1576750"},{"key":"22_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446","volume-title":"Applied numerical linear algebra","author":"J.W. Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied numerical linear algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15274-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T05:07:37Z","timestamp":1685768857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15274-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152733","9783642152740"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15274-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}