{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:45:12Z","timestamp":1755218712221,"version":"3.43.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1023\/a:1009979130810","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"439-457","source":"Crossref","is-referenced-by-count":8,"title":["Numerical Computation of the Least Common Multiple of a Set of Polynomials"],"prefix":"10.1007","volume":"6","author":[{"given":"Nicos","family":"Karcanias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marilena","family":"Mitrouli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"278408_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1006\/jsco.1998.0234","volume":"26","author":"B. Beckermann","year":"1998","unstructured":"Beckermann, B. and Labahn, G.: When Are Two Numerical Polynomials Relatively Prime?, J. of Symbolic Computation\n26 (1998), pp. 677-689.","journal-title":"J. of Symbolic Computation"},{"issue":"1","key":"278408_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0609006","volume":"9","author":"T. Beelen","year":"1988","unstructured":"Beelen, T. and Van Dooren, P.: A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular Matrix, SIAM J. on Matrix Analysis and Appl.\n9(1) (1988), pp. 77-89.","journal-title":"SIAM J. on Matrix Analysis and Appl."},{"key":"278408_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0313029","volume":"13","author":"G. D. Forney","year":"1975","unstructured":"Forney, G. D.: Minimal Bases of Rational Vector Spaces with Applications to Multivariable Linear Systems, SIAM J. Control\n13 (1975), pp. 493-520.","journal-title":"SIAM J. Control"},{"key":"278408_CR4","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1989","unstructured":"Golub, G. H. and Van Loan, C. F.: Matrix Computations, Second edition, The Johns Hopkins University Press, Baltimore, London, 1989.","edition":"Second edition"},{"key":"278408_CR5","volume-title":"Linear Systems","author":"T. Kailath","year":"1980","unstructured":"Kailath, T.: Linear Systems, Prentice Hall, Englewood Cliffs, New Jersey, 1980."},{"key":"278408_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imamci\/13.1.1","volume":"13","author":"N. Karcanias","year":"1996","unstructured":"Karcanias, N.: Geometric Properties Invariants and the Toeplitz Structure of Minimal Bases of Rational Vector Spaces, IMA Journal of Math. Control and Information\n13 (1996), pp. 1-11.","journal-title":"IMA Journal of Math. Control and Information"},{"key":"278408_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0024-3795(89)90660-5","volume":"122\/123\/124","author":"N. Karcanias","year":"1989","unstructured":"Karcanias, N. and Giannakopoulos, C.: Necessary and Sufficient Conditions for Zero Assignment by Constant Squaring Down, Lin. Alg. and Its Appl., Special Issue on Control Theory\n122\/123\/124 (1989), pp. 415-446.","journal-title":"Lin. Alg. and Its Appl., Special Issue on Control Theory"},{"key":"278408_CR8","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1080\/00207178308933141","volume":"38","author":"N. Karcanias","year":"1983","unstructured":"Karcanias, N., Giannakopoulos, C., and Hubbard, M.: Almost Zeros of a Set of Polynomials of \u211c[s], Int. J. Control\n38 (1983), pp. 1213-1238.","journal-title":"Int. J. Control"},{"key":"278408_CR9","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1109\/9.284874","volume":"39","author":"N. Karcanias","year":"1994","unstructured":"Karcanias, N. and Mitrouli, M.: A Matrix Pencil Based Numerical Method for the Computation of the GCD of Polynomials, IEEE Trans. Autom. Cont.\n39 (1994), pp. 977-981.","journal-title":"IEEE Trans. Autom. Cont."},{"key":"278408_CR10","series-title":"Research report","volume-title":"Numerical Computation of the Least Common Multiple of a Set of Polynomials","author":"N. Karcanias","year":"1999","unstructured":"Karcanias, N. and Mitrouli, M.: Numerical Computation of the Least Common Multiple of a Set of Polynomials, Research report, Control Engineering Centre, City University, London, 1999."},{"key":"278408_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/00207179308922998","volume":"58","author":"M. Mitrouli","year":"1993","unstructured":"Mitrouli, M. and Karcanias, N.: Computation of the GCD of Polynomials Using Gaussian Transformation and Shifting, Int. Journ. Control\n58 (1993), pp. 211-228.","journal-title":"Int. Journ. Control"},{"key":"278408_CR12","first-page":"65","volume":"50","author":"M. Mitrouli","year":"1996","unstructured":"Mitrouli, M., Karcanias, N., and Koukouvinos, C.: Further Numerical Aspects of the ERES Algorithm for the Computation of the Greatest Common Divisor of Polynomials and Comparison with Other Existing Methodologies, Utilitas Mathematica\n50 (1996), pp. 65-84.","journal-title":"Utilitas Mathematica"},{"key":"278408_CR13","first-page":"5","volume":"126","author":"M. Mitrouli","year":"1997","unstructured":"Mitrouli, M., Karcanias, N., and Koukouvinos, C.: Numerical Aspects for Nongeneric Computations in Control Problems, Congressus Numerantium\n126 (1997), pp. 5-19.","journal-title":"Congressus Numerantium"},{"key":"278408_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-0427(96)00092-1","volume":"76","author":"M. Mitrouli","year":"1996","unstructured":"Mitrouli, M., Karcanias, N., and Koukouvinos, C.: Numerical Performance of the Matrix Pencil Algorithm Computing the Greatest Common Divisor of Polynomials and Comparison with Other Matrix-Based Methodologies, Journ. of Computational and Appl. Math.\n76 (1996), pp. 89-112.","journal-title":"Journ. of Computational and Appl. Math."},{"key":"278408_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-0427(91)90180-R","volume":"38","author":"M. Noda","year":"1991","unstructured":"Noda, M. and Sasaki, T.: Approximate GCD and Its Applications to Ill-Conditioned Algebraic Equations, Jour. of Comp. and Appl. Math.\n38 (1991), pp. 335-351.","journal-title":"Jour. of Comp. and Appl. Math."},{"key":"278408_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/00207727308920007","volume":"4","author":"I. S. Pace","year":"1973","unstructured":"Pace, I. S. and Barnett, S.: Comparison of Algorithms for Calculation of GCD of Polynomials, Int. Journ. System Scien.\n4 (1973), pp. 211-226.","journal-title":"Int. Journ. System Scien."},{"key":"278408_CR17","volume-title":"State Space and Multivariable Theory","author":"H. H. Rosenbrock","year":"1970","unstructured":"Rosenbrock, H. H.: State Space and Multivariable Theory, Nelson, London, 1970."},{"key":"278408_CR18","volume-title":"Linear Multivariable Control: A Geometric Approach","author":"W. M. Wonham","year":"1984","unstructured":"Wonham, W. M.: Linear Multivariable Control: A Geometric Approach, Springer Verlag, New York, Sec. Edit, 1984.","edition":"Sec. Edit"}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009979130810.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009979130810\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009979130810.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:32:33Z","timestamp":1754472753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009979130810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["278408"],"URL":"https:\/\/doi.org\/10.1023\/a:1009979130810","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}