{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:06:23Z","timestamp":1751871983739},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf02140679","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T12:03:51Z","timestamp":1126785831000},"page":"145-159","source":"Crossref","is-referenced-by-count":12,"title":["A compound matrix algorithm for the computation of the Smith form of a polynomial matrix"],"prefix":"10.1007","volume":"7","author":[{"given":"M.","family":"Mitrouli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Kalogeropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02140679_CR1","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1090\/S0025-5718-1971-0301909-X","volume":"25","author":"G. Bradley","year":"1971","unstructured":"G. Bradley, Algorithms for Hermite and Smith normal matrices and linear diophantine equations, Math. Comp. 25 (1971) 897\u2013907.","journal-title":"Math. Comp."},{"key":"BF02140679_CR2","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1109\/TAC.1979.1102104","volume":"24","author":"V. Ramachandran","year":"1979","unstructured":"V. Ramachandran, Exact reduction of a polynomial matrix to the Smith normal form, IEEE Trans. Auto. Contr. AC-24 (1979) 638\u2013641.","journal-title":"IEEE Trans. Auto. Contr. AC"},{"key":"BF02140679_CR3","unstructured":"G. Gantmacher,Theory of Matrices, Vol. 1, 2 (Chelsea, 1963)."},{"key":"BF02140679_CR4","unstructured":"G. Golub and F. Van Loan,Matrix Computations (The Johns Hopkins University Press, Baltimore and London)."},{"key":"BF02140679_CR5","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/0608057","volume":"8","author":"E. Kaltofen","year":"1987","unstructured":"E. Kaltofen, M. Krishnamoorthy and B. Saunders Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM J. Alg. Discr. Meth. 8 (1987) 683\u2013690.","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"BF02140679_CR6","unstructured":"N. Karcanias and M. Mitrouli, A matrix pencil based numerical method for the computation of the gcd of polynomials, IEEE Trans. Auto. Contr. (1992), to appear."},{"key":"BF02140679_CR7","volume-title":"A Survey of Matrix Theory and Matrix Inequalities","author":"M. Marcus","year":"1964","unstructured":"M. Marcus and M. Minc,A Survey of Matrix Theory and Matrix Inequalities (Allyn and Bacon, Boston, 1964)."},{"key":"BF02140679_CR8","volume-title":"Proc. IMA Int. Conf. on Control","author":"M. Mitrouli","year":"1992","unstructured":"M. Mitrouli and N. Karcanias, A survey of matrix-based numerical methods for the computation of the ged of several polynomials,Proc. IMA Int. Conf. on Control, Manchester, England (1992)."},{"key":"BF02140679_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/00207179308922998","volume":"58","author":"M. Mitrouli","year":"1993","unstructured":"M. Mitrouli and N. Karcanias, Computation of the gcd of polynomials using Gaussian transformations and shifting, Int. J. Control 58 (1993) 211\u2013228.","journal-title":"Int. J. Control"},{"key":"BF02140679_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1080\/00207727408920109","volume":"5","author":"I.C. Pace","year":"1974","unstructured":"I.C. Pace and S. Barnett, Efficient algorithms for linear system calculations. Part I\u2014Smith form and common divisor of polynomial matrices. Int. J. Syst. Sci. 5 (1974) 403\u2013411.","journal-title":"Int. J. Syst. Sci."},{"key":"BF02140679_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/00207727308920007","volume":"4","author":"I.C. Pace","year":"1973","unstructured":"I.C. Pace and S. Barnett, Comparison of algorithms for calculation of gcd of polynomials, Int. J. Syst. Sci. 4 (1973) 211\u2013226.","journal-title":"Int. J. Syst. Sci."},{"key":"BF02140679_CR12","volume-title":"Rounding Errors in Algebraic Processes","author":"J.H. Wilkinson","year":"1963","unstructured":"J.H. Wilkinson,Rounding Errors in Algebraic Processes (Her Majesty's Stationery Office, London, 1963)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02140679.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02140679\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02140679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T15:50:43Z","timestamp":1557849043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02140679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF02140679"],"URL":"https:\/\/doi.org\/10.1007\/bf02140679","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}