{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:13Z","timestamp":1740123673844,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11075-020-00956-z","type":"journal-article","created":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T01:02:31Z","timestamp":1592096551000},"page":"19-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Backward error measures for roots of polynomials"],"prefix":"10.1007","volume":"87","author":[{"given":"Simon","family":"Telen","sequence":"first","affiliation":[]},{"given":"Sascha","family":"Timme","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7372-382X","authenticated-orcid":false,"given":"Marc","family":"Van Barel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"issue":"3","key":"956_CR1","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/140983434","volume":"36","author":"L Jared","year":"2015","unstructured":"Jared, L., Aurentz, T.M., Vandebril, R., Watkins, D.S.: Fast and backward stable computation of roots of polynomials. SIAM J. MATRIX ANAL. A. 36(3), 942\u2013973 (2015)","journal-title":"SIAM J. MATRIX ANAL. A."},{"issue":"4","key":"956_CR2","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1137\/120886741","volume":"34","author":"DA Bini","year":"2013","unstructured":"Bini, D.A., Noferini, V., Sharify, M.: Locating the eigenvalues of matrix polynomials. SIAM J. MATRIX ANAL. A. 34(4), 1708\u20131727 (2013)","journal-title":"SIAM J. MATRIX ANAL. A."},{"key":"956_CR3","doi-asserted-by":"crossref","unstructured":"Gaubert, S., Sharify, M.: Tropical scaling of polynomial matrices. In: Positive systems, volume 389 of Lecture Notes in Control and Information Sciences, pages 291\u2013303. Springer (2009)","DOI":"10.1007\/978-3-642-02894-6_28"},{"key":"956_CR4","doi-asserted-by":"crossref","unstructured":"Nicholas, J: Higham. Accuracy and stability of numerical algorithms, volume 80 Siam (2002)","DOI":"10.1137\/1.9780898718027"},{"key":"956_CR5","doi-asserted-by":"crossref","unstructured":"Maclagan, D., Sturmfels, B.: Introduction to tropical geometry, volume 161 American Mathematical Soc. (2015)","DOI":"10.1090\/gsm\/161"},{"key":"956_CR6","first-page":"73","volume":"44","author":"N Mastronardi","year":"2015","unstructured":"Mastronardi, N., Dooren, P.V.: Revisiting the stability of computing the roots of a quadratic polynomial. Electron. Trans. Numer. Anal. 44, 73\u201382 (2015)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1","key":"956_CR7","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/14096637X","volume":"36","author":"V Noferini","year":"2015","unstructured":"Noferini, V., Sharify, M., Tisseur, F.: Tropical roots as approximations to eigenvalues of matrix polynomials. SIAM J. MATRIX ANAL. A. 36(1), 138\u2013157 (2015)","journal-title":"SIAM J. MATRIX ANAL. A."},{"key":"956_CR8","unstructured":"Sharify, M.: Scaling algorithms and tropical methods in numerical matrix analysis: application to the optimal assignment problem and to the accurate computation of eigenvalues PhD thesis (2011)"},{"key":"956_CR9","doi-asserted-by":"crossref","unstructured":"Tisseur, F., Barel, M.V.: Min-max elementwise backward error for roots of polynomials and a corresponding backward stable root finder. arXiv:2001.05281 (2020)","DOI":"10.1016\/j.laa.2020.10.034"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00956-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00956-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00956-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:08:54Z","timestamp":1623625734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00956-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["956"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00956-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"23 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}