{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:04:20Z","timestamp":1760061860481},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T00:00:00Z","timestamp":1560384000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T00:00:00Z","timestamp":1560384000000},"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":["Found Comput Math"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10208-019-09422-2","type":"journal-article","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:02:31Z","timestamp":1560463351000},"page":"331-366","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Approximate Greatest Common Right Divisors of Differential Polynomials"],"prefix":"10.1007","volume":"20","author":[{"given":"Mark","family":"Giesbrecht","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Haraldson","sequence":"additional","affiliation":[]},{"given":"Erich","family":"Kaltofen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,13]]},"reference":[{"issue":"5","key":"9422_CR1","doi-asserted-by":"publisher","first-page":"5885","DOI":"10.1007\/s10958-005-0449-8","volume":"131","author":"S Abramov","year":"2005","unstructured":"Abramov S, Le H, Li Z (2005) Univariate Ore polynomial rings in computer algebra. J Math Sci 131(5):5885\u20135903","journal-title":"J Math Sci"},{"key":"9422_CR2","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1090\/tran\/6727","volume":"369","author":"J Bell","year":"2017","unstructured":"Bell J, Heinle A, Levandovskyy V (2017) On noncommutative finite factorization domains. Trans AMS 369:2675\u20132695","journal-title":"Trans AMS"},{"key":"9422_CR3","unstructured":"Botting B, Giesbrecht M, May J (2005) Using the Riemannian SVD for problems in approximate algebra. In: Proceedings workshop on symbolic-numeric computation (SNC\u201905), pp 209\u2013219"},{"key":"9422_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, New York"},{"key":"9422_CR5","first-page":"27","volume":"20","author":"M Bronstein","year":"1994","unstructured":"Bronstein M, Petkov\u0161ek M (1994) On Ore rings, linear operators and factorisation. Programmirovanie 20:27\u201345","journal-title":"Programmirovanie"},{"issue":"1","key":"9422_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(95)00173-5","volume":"157","author":"M Bronstein","year":"1996","unstructured":"Bronstein M, Petkov\u0161ek M (1996) An introduction to pseudo-linear algebra. Theor Comput Sci 157(1):3-33","journal-title":"Theor Comput Sci"},{"key":"9422_CR7","doi-asserted-by":"crossref","unstructured":"Corless RM, Gianni PM, Trager BM, Watt SM (1995) The singular value decomposition for polynomial systems. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC\u201995), pp 189\u2013205","DOI":"10.1145\/220346.220371"},{"key":"9422_CR8","doi-asserted-by":"publisher","unstructured":"Emiris IZ, Galligo A, Lombardi H (1997) Certified approximate univariate GCDs. J Pure Appl Algebra 117\u2013118:229\u2013251. https:\/\/doi.org\/10.1016\/S0022-4049(97)00013-3","DOI":"10.1016\/S0022-4049(97)00013-3"},{"key":"9422_CR9","doi-asserted-by":"crossref","unstructured":"Giesbrecht M, Haraldson J (2014) Computing GCRDs of approximate differential polynomials. In: Proceedings symposium on symbolic-numeric computation (SNC \u201914), pp 78\u201387","DOI":"10.1145\/2631948.2631964"},{"key":"9422_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.jalgebra.2012.11.033","volume":"376","author":"M Giesbrecht","year":"2013","unstructured":"Giesbrecht M, Kim M (2013) Computing the hermite form of a matrix of Ore polynomials. J Algebra 376:341\u2013362","journal-title":"J Algebra"},{"key":"9422_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jsc.2015.11.011","volume":"75","author":"M Giesbrecht","year":"2016","unstructured":"Giesbrecht M, Heinle A, Levandovskyy V (2016) Factoring linear partial differential operators in $$n$$ variables. J Symb Comput 75:127\u2013148","journal-title":"J Symb Comput"},{"issue":"1","key":"9422_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0747-7171(08)80034-X","volume":"10","author":"D Grigor\u2019ev","year":"1990","unstructured":"Grigor\u2019ev D (1990) Complexity of factoring and calculating the GCD of linear ordinary differential operators. J Symb Comput 10(1):7\u201337","journal-title":"J Symb Comput"},{"key":"9422_CR13","unstructured":"Haraldson J (2015) Computing approximate GCRDs of differential polynomials. Master\u2019s thesis, University of Waterloo"},{"key":"9422_CR14","doi-asserted-by":"crossref","unstructured":"Heinle A, Levandovskyy V (2016) A factorization algorithm for g-algebras and applications. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC 16), ACM Press, pp 263\u2013270","DOI":"10.1145\/2930889.2930906"},{"key":"9422_CR15","unstructured":"Kaltofen E, Yang Z, Zhi L (2005) Structured low rank approximation of a Sylvester matrix. In: Proceedings workshop on symbolic-numeric computation (SNC\u201905), pp 69\u201383"},{"key":"9422_CR16","doi-asserted-by":"crossref","unstructured":"Kaltofen E, Yang Z, Zhi L (2006) Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC\u201906), pp 169\u2013176","DOI":"10.1145\/1145768.1145799"},{"key":"9422_CR17","doi-asserted-by":"crossref","unstructured":"Kaltofen E, Yang Z, Zhi L (2007a) Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials, unpublished manuscript","DOI":"10.1145\/1145768.1145799"},{"key":"9422_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-7643-7984-1_5","volume-title":"Symbolic-numeric computation","author":"E Kaltofen","year":"2007","unstructured":"Kaltofen E, Yang Z, Zhi L (2007b) Structured low rank approximation of a sylvester matrix. In: Symbolic-numeric computation, Birkh\u00e4user Verlag, Basel, Switzerland, Trends in Mathematics, pp 69\u201383"},{"key":"9422_CR19","doi-asserted-by":"crossref","unstructured":"Karmarkar N, Lakshman YN (1996) Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC\u201996), pp 35\u201339","DOI":"10.1145\/236869.236892"},{"issue":"6","key":"9422_CR20","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1006\/jsco.1998.0232","volume":"26","author":"N Karmarkar","year":"1998","unstructured":"Karmarkar N, Lakshman YN (1998) On approximate GCDs of univariate polynomials. J Symb Comput 26(6):653\u2013666","journal-title":"J Symb Comput"},{"key":"9422_CR21","doi-asserted-by":"crossref","unstructured":"Li Z (1998) A subresultant theory for Ore polynomials with applications. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC\u201998), ACM, pp 132\u2013139","DOI":"10.1145\/281508.281594"},{"key":"9422_CR22","doi-asserted-by":"crossref","unstructured":"Li Z, Nemes I (1997) A modular algorithm for computing greatest common right divisors of Ore polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC\u201997), pp 282\u2013289","DOI":"10.1145\/258726.258812"},{"key":"9422_CR23","doi-asserted-by":"publisher","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"O Ore","year":"1933","unstructured":"Ore O (1933) Theory of non-commutative polynomials. Ann Math Second Ser 34:480\u2013508","journal-title":"Ann Math Second Ser"},{"key":"9422_CR24","series-title":"International series in pure and applied mathematics","volume-title":"Principles of mathematical analysis","author":"W Rudin","year":"1976","unstructured":"Rudin W (1976) Principles of mathematical analysis. . New York"},{"issue":"2","key":"9422_CR25","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/178365.178368","volume":"20","author":"B Salvy","year":"1994","unstructured":"Salvy B, Zimmermann P (1994) Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans Math Softw 20(2):163\u2013177","journal-title":"ACM Trans Math Softw"},{"key":"9422_CR26","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/271130.271131","volume":"31","author":"T Sasaki","year":"1997","unstructured":"Sasaki T, Sasaki M (1997) Polynomial remainder sequence and approximate GCD. ACM SIGSAM Bull 31:4\u201310","journal-title":"ACM SIGSAM Bull"},{"key":"9422_CR27","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 (1985) . J Complex 1:118\u2013137","journal-title":"J Complex"},{"issue":"2","key":"9422_CR28","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10208-015-9256-x","volume":"16","author":"\u00c9 Schost","year":"2016","unstructured":"Schost \u00c9, Spaenlehauer P (2016) A quadratically convergent algorithm for structured low-rank approximation. Found Comput Math 16(2):457\u2013492","journal-title":"Found Comput Math"},{"key":"9422_CR29","doi-asserted-by":"crossref","unstructured":"von zur Gathen J, Gerhard J (2013) Modern Computer Algebra, 3rd edn. Cambridge University Press, New York","DOI":"10.1017\/CBO9781139856065"},{"key":"9422_CR30","doi-asserted-by":"crossref","unstructured":"Zeng Z (2011) The numerical greatest common divisor of univariate polynomials. In: Randomization, relaxation, and complexity in polynomial equation solving, contemporary mathematics, vol 556. ACM Press, pp 187\u2013217","DOI":"10.1090\/conm\/556\/11014"},{"key":"9422_CR31","doi-asserted-by":"crossref","unstructured":"Zeng Z, Dayton BH (2004) The approximate GCD of inexact polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC\u201904), pp 320\u2013327","DOI":"10.1145\/1005285.1005331"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09422-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-019-09422-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09422-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T19:09:42Z","timestamp":1663700982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-019-09422-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,13]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9422"],"URL":"https:\/\/doi.org\/10.1007\/s10208-019-09422-2","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,13]]},"assertion":[{"value":"8 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}