{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:48:17Z","timestamp":1673146097241},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":[[1992,12]]},"DOI":"10.1007\/bf02141948","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T07:28:46Z","timestamp":1126769326000},"page":"411-418","source":"Crossref","is-referenced-by-count":5,"title":["Numerical factorization of a polynomial by rational Hermite interpolation"],"prefix":"10.1007","volume":"3","author":[{"given":"Tetsuya","family":"Sakurai","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Sugiura","sequence":"additional","affiliation":[]},{"given":"Tatsuo","family":"Torii","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02141948_CR1","unstructured":"L. Bairstow, The solution of algebraic equations with numerical coefficients in the case where several pairs of complex roots exist, Advisory Committee for Aeronautics, Technical Report for 1914\u201315 (1915) pp. 239\u2013252."},{"key":"BF02141948_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02142382","volume":"1","author":"F. Cordellier","year":"1991","unstructured":"F. Cordellier, On the use of Kronecker's algorithm in the generalized rational interpolation problem, Numer. Algorithms 1 (1991) 401\u2013413.","journal-title":"Numer. Algorithms"},{"key":"BF02141948_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0377-0427(90)90006-L","volume":"30","author":"T.L. Freeman","year":"1990","unstructured":"T.L. Freeman, A divide and conquer method for polynomial zeros, J. Comput. Appl. Math. 30 (1990) 71\u201379.","journal-title":"J. Comput. Appl. Math."},{"key":"BF02141948_CR4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/0134048","volume":"34","author":"R.J. McEliece","year":"1978","unstructured":"R.J. McEliece and J.B. Shearer, A property of Euclid's algorithm and an application to Pad\u00e9 approximation, SIAM J. Appl. Math. 34 (1978) 611\u2013615.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02141948_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01932271","volume":"16","author":"A.W. Nourein","year":"1976","unstructured":"A.W. Nourein, Root determination by use of Pad\u00e9 approximants, BIT 16 (1976) 291\u2013297.","journal-title":"BIT"},{"key":"BF02141948_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02239167","volume":"46","author":"T. Sakurai","year":"1991","unstructured":"T. Sakurai, H. Sugiura and T. Torii, An iterative method for algebraic equation by Pad\u00e9 approximation, Computing 46 (1991) 131\u2013141.","journal-title":"Computing"},{"key":"BF02141948_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-0427(91)90184-L","volume":"38","author":"T. Sakurai","year":"1991","unstructured":"T. Sakurai, H. Sugiura and T. Torii, A high order iterative formula for simultaneous determination of zeros of a polynomial, J. Comput. Appl. Math. 38 (1991) 387\u2013397.","journal-title":"J. Comput. Appl. Math."},{"key":"BF02141948_CR8","first-page":"277","volume":"1","author":"S. Sonoda","year":"1991","unstructured":"S. Sonoda, T. Sakurai, H. Sugiura and T. Torii, Numerical factorization of a polynomial by the divide and conquer method, Trans. Japan SIAM 1 (1991) 277\u2013290 (in Japanese).","journal-title":"Trans. Japan SIAM"},{"key":"BF02141948_CR9","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BF02163273","volume":"13","author":"G.W. Stewart","year":"1969","unstructured":"G.W. Stewart, Some iterations for factoring a polynomial, Numer. Math. 13 (1969) 458\u2013471.","journal-title":"Numer. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02141948.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02141948\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02141948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:44:55Z","timestamp":1557827095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02141948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF02141948"],"URL":"https:\/\/doi.org\/10.1007\/bf02141948","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}