{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:32:11Z","timestamp":1649086331718},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T00:00:00Z","timestamp":1339027200000},"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":[[2012,10]]},"DOI":"10.1007\/s11075-012-9596-4","type":"journal-article","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T07:11:25Z","timestamp":1338966685000},"page":"189-208","source":"Crossref","is-referenced-by-count":3,"title":["Computing high precision Matrix Pad\u00e9 approximants"],"prefix":"10.1007","volume":"61","author":[{"given":"Bernhard","family":"Beckermann","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Bessis","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Perotti","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Vrinceanu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,7]]},"reference":[{"key":"9596_CR1","volume-title":"Pad\u00e9 approximants. Encyclopedia of Mathematics","author":"GA Baker","year":"1995","unstructured":"Baker, G.A., Graves-Morris, P.R.: Pad\u00e9 approximants. Encyclopedia of Mathematics, 2nd edn. Cambridge University Press, New York (1995)","edition":"2"},{"key":"9596_CR2","first-page":"565","volume":"22","author":"E Bareiss","year":"1968","unstructured":"Bareiss, E.: Sylvester\u2019s Identity and multistep integer-preserving Gaussian elimination. Math. Comput. 22, 565\u2013578 (1968)","journal-title":"Math. Comput."},{"key":"9596_CR3","first-page":"125","volume-title":"Proceedings of ISSAC\u201997, Maui","author":"B Beckermann","year":"1997","unstructured":"Beckermann, B., Cabay, S., Labahn, G.: Fraction-free computation of matrix pade systems. In: Proceedings of ISSAC\u201997, Maui, pp.\u00a0125\u2013132. ACM, New York (1997)"},{"key":"9596_CR4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1009942122633","volume":"6","author":"B Beckermann","year":"2000","unstructured":"Beckermann, B., Labahn, G.: Numeric and symbolic computation of problems defined by structured linear systems. Reliab. Comput. 6, 365\u2013390 (2000)","journal-title":"Reliab. Comput."},{"key":"9596_CR5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/S0895479897326912","volume":"22","author":"B Beckermann","year":"2000","unstructured":"Beckermann, B., Labahn, G.: Fraction-free computation of matrix rational interpolants and matrix GCD\u2019s. SIAM J. Matrix Anal. Appl. 22, 114\u2013144 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9596_CR6","doi-asserted-by":"crossref","first-page":"365202","DOI":"10.1088\/1751-8113\/42\/36\/365202","volume":"42","author":"D Bessis","year":"2009","unstructured":"Bessis, D., Perotti, L.: Universal analytic properties of noise: introducing the J-matrix formalism. J. Phys. A 42, 365202 (2009)","journal-title":"J. Phys. A"},{"key":"9596_CR7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","volume":"18","author":"W Brown","year":"1971","unstructured":"Brown, W., Traub, J.F.: On Euclid\u2019s algorithm and the theory of subresultants. J. ACM 18, 505\u2013514 (1971)","journal-title":"J. ACM"},{"key":"9596_CR8","first-page":"875","volume":"35","author":"A Bultheel","year":"1980","unstructured":"Bultheel, A.: Recusive algorithms for the matrix Pad\u00e9 problem. Math. Comput. 35, 875\u2013892 (1980)","journal-title":"Math. Comput."},{"key":"9596_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0747-7171(08)80038-7","volume":"10","author":"S Cabay","year":"1990","unstructured":"Cabay, S., Kossowski, P.: Power Series reminder sequences and Pad\u00e9 fractions over an integral domain. J. Symbol. Comput. 10, 139\u2013163 (1990)","journal-title":"J. Symbol. Comput."},{"key":"9596_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","volume":"14","author":"G Collins","year":"1967","unstructured":"Collins, G.: Subresultant and reduced polynomial remainder sequences. J. ACM 14, 128\u2013142 (1967)","journal-title":"J. ACM"},{"key":"9596_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/b102438","volume-title":"Algorithms for Computer algebra","author":"KO Geddes","year":"1992","unstructured":"Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer algebra. Kluwer, Boston (1992)"},{"key":"9596_CR12","volume-title":"Linear Systems","author":"T Kailath","year":"1980","unstructured":"Kailath, T.: Linear Systems. Prentice Hall, Englewood Cliffs (1980)"},{"key":"9596_CR13","volume-title":"Analytic Theory of Continued Fractions","author":"HS Wall","year":"1973","unstructured":"Wall, H.S.: Analytic Theory of Continued Fractions. Chelsea, Bronx (1973)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9596-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9596-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9596-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:18Z","timestamp":1559351298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9596-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,7]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9596"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9596-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,7]]}}}