{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:23:22Z","timestamp":1758824602197},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"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":[[2010,7]]},"DOI":"10.1007\/s11075-009-9336-6","type":"journal-article","created":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T08:02:57Z","timestamp":1254297777000},"page":"297-324","source":"Crossref","is-referenced-by-count":10,"title":["On rank and null space computation of the generalized Sylvester matrix"],"prefix":"10.1007","volume":"54","author":[{"given":"Dimitrios","family":"Triantafyllou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marilena","family":"Mitrouli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,1]]},"reference":[{"key":"9336_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0024-3795(87)90219-9","volume":"85","author":"AM Kurt","year":"1987","unstructured":"Kurt, A.M., Uriel, R.G.: Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and drazin inverse. Linear Algebra Appl. 85, 221\u2013239 (1987)","journal-title":"Linear Algebra Appl."},{"key":"9336_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1080\/03081088008817332","volume":"8","author":"S Barnett","year":"1980","unstructured":"Barnett, S.: Greatest common divisor of several polynomials. Linear Multilinear Algebra 8, 271\u2013279 (1980)","journal-title":"Linear Multilinear Algebra"},{"key":"9336_CR3","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.cam.2007.01.032","volume":"213","author":"B Li","year":"2008","unstructured":"Li, B., Liu, Z., Zhi, L.: A structured rank-revealing method for Sylvester matrix. J. Comput. Appl. Math. 213, 212\u2013223 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"9336_CR4","doi-asserted-by":"crossref","unstructured":"Bini, D., Boito, P.: Structured matrix-based methods for polynomial \u03b5-gcd: analysis and comparisons, ISSAC\u201907. In: Proc. Internat. Symp. Symbolic Algebraic Comput., pp. 9\u201316 (2007)","DOI":"10.1145\/1277548.1277551"},{"issue":"6","key":"9336_CR5","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1109\/TAC.1978.1101890","volume":"23","author":"RR Bitmead","year":"1978","unstructured":"Bitmead, R.R., Kung, S.Y., Anderson, B.D.O., Kailath, T.: Greatest common divisors via generalized Sylvester and Bezout matrices. IEEE Trans. Automat. Contr. AC 23(6), 1043\u20131047 (1978)","journal-title":"IEEE Trans. Automat. Contr. AC"},{"key":"9336_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88\/89","author":"T Chan","year":"1987","unstructured":"Chan, T.: Rank revealing QR factorizations. Linear Algebra Appl. 88\/89, 67\u201382 (1987)","journal-title":"Linear Algebra Appl."},{"issue":"12","key":"9336_CR7","doi-asserted-by":"crossref","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)","journal-title":"IEEE Trans. Signal Process."},{"key":"9336_CR8","volume-title":"Numerical Linear Algebra and Applications","author":"BN Datta","year":"1995","unstructured":"Datta, B.N.: Numerical Linear Algebra and Applications, 2nd edn. Brooks\/Cole, USA (1995)","edition":"2"},{"key":"9336_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0024-3795(86)90115-1","volume":"74","author":"L Foster","year":"1984","unstructured":"Foster, L.: Rank and null space calculations using matrix decomposition without column interchanges. Linear Algebra Appl. 74, 47\u201371 (1984)","journal-title":"Linear Algebra Appl."},{"key":"9336_CR10","first-page":"248","volume-title":"Matrix Computations","author":"GH Golub","year":"1989","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn, pp 248\u2013254. The John Hopkins Univercity Press, Baltimore (1989)","edition":"3"},{"issue":"1","key":"9336_CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/S0895479889169042","volume":"15","author":"T Kailath","year":"1994","unstructured":"Kailath, T., Chun, J.: Generalized displacement structure for block-Toeplitz, Toeplitz-block and Toeplitz-derived matrices. SIAM J. Matrix Anal. Appl. 15(1), 114\u2013128 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9336_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-0427(96)00092-1","volume":"76","author":"N Karcanias","year":"1996","unstructured":"Karcanias, N., Mitrouli, M., Koukouvinos, C.: Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix -based methodologies. J. Comput. Appl. Math. 76, 89\u2013112 (1996)","journal-title":"J. Comput. Appl. Math."},{"key":"9336_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0898-1221(03)80016-0","volume":"45","author":"N Karcanias","year":"2003","unstructured":"Karcanias, N., Mitrouli, M.: Normal factorization of polynomials and computational issues. Comput. Math. Appl. 45, 229\u2013245 (2003)","journal-title":"Comput. Math. Appl."},{"key":"9336_CR14","doi-asserted-by":"crossref","unstructured":"Zhi, L.: Displacement structure in computing approximate gcd of univariate polynomials mathematics, World scientific. In: Lecture Notes Series on Computing, pp. 288\u2013298 (2003)","DOI":"10.1142\/9789812704436_0024"},{"key":"9336_CR15","first-page":"188","volume":"18","author":"M Ana","year":"2004","unstructured":"Ana, M., Jose-Javier, M.: A new source of structured singular value decomposition problems. ETNA 18, 188\u2013197 (2004)","journal-title":"ETNA"},{"key":"9336_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/00207727308920007","volume":"4","author":"IS Pace","year":"1973","unstructured":"Pace, I.S., Barnett, S.: Comparison of algorithms for calculation of GCD of polynomials. Int. J. Syst. Sci. 4, 211\u2013226 (1973)","journal-title":"Int. J. Syst. Sci."},{"key":"9336_CR17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/978-3-540-31852-1_63","volume":"3401","author":"D Triantafyllou","year":"2005","unstructured":"Triantafyllou, D., Mitrouli, M.: Two resultant based methods computing the greatest common divisor of two polynomials. Lect. Notes Comput. Sci. 3401, 519\u2013526 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9336_CR18","doi-asserted-by":"crossref","unstructured":"Trefethen, L.N., Bau, D.: Numerical linear algebra, III. In: SIAM, pp. 234\u2013239 (1997)","DOI":"10.1137\/1.9780898719574"},{"key":"9336_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0377-0427(90)90260-7","volume":"33","author":"V Huffel","year":"1990","unstructured":"Huffel, V.: Partial singular value decomposition algorithm. J. Comput. Appl. Math. 33, 105\u2013112 (1990)","journal-title":"J. Comput. Appl. Math."},{"key":"9336_CR20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0377-0427(87)90201-9","volume":"19","author":"V Huffel","year":"1987","unstructured":"Huffel, V., Vandewalle J.: An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values. J. Comput. Appl. Math. 19, 313\u2013330 (1987)","journal-title":"J. Comput. Appl. Math."},{"key":"9336_CR21","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TAC.1973.1100283","volume":"18","author":"S Wang","year":"1973","unstructured":"Wang, S., Davison, E.J.: A minimization algorithm for the design of linear multivariable systems. IEEE Trans. Automat. Contr. 18, 220\u2013225 (1973)","journal-title":"IEEE Trans. Automat. Contr."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-009-9336-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-009-9336-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-009-9336-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:14Z","timestamp":1559365694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-009-9336-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9336"],"URL":"https:\/\/doi.org\/10.1007\/s11075-009-9336-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,1]]}}}