{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T08:09:00Z","timestamp":1746864540565,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T00:00:00Z","timestamp":1672099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T00:00:00Z","timestamp":1672099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 33956-NBL"],"award-info":[{"award-number":["P 33956-NBL"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["KP-06-Austria\/8\/2019"],"award-info":[{"award-number":["KP-06-Austria\/8\/2019"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11075-022-01487-5","type":"journal-article","created":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T11:03:41Z","timestamp":1672139021000},"page":"1741-1758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Newton method for best uniform rational approximation"],"prefix":"10.1007","volume":"93","author":[{"given":"Irina","family":"Georgieva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6616-5081","authenticated-orcid":false,"given":"Clemens","family":"Hofreither","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,27]]},"reference":[{"issue":"2","key":"1487_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:ACAP.0000013855.14971.91","volume":"80","author":"P-A Absil","year":"2004","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Riemannian geometry of Grassmann manifolds with a view on algorithmic computation. Acta Appl. Math. 80(2), 199\u2013220 (2004). https:\/\/doi.org\/10.1023\/b:acap.0000013855.14971.91https:\/\/doi.org\/10.1023\/b:acap.0000013855.14971.91","journal-title":"Acta Appl. Math."},{"key":"1487_CR2","unstructured":"Achieser, N.I.: Theory of approximation. dover books on advanced mathematics. Dover Publications. ISBN 9780486671291 (1992)"},{"issue":"2","key":"1487_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0377-0427(96)00163-X","volume":"78","author":"J-P Berrut","year":"1997","unstructured":"Berrut, J.-P., Mittelmann, H.D.: Matrices for the direct determination of the barycentric weights of rational interpolation. J Comput. Appl. Math 78 (2), 355\u2013370 (1997). https:\/\/doi.org\/10.1016\/s0377-0427(96)00163-x","journal-title":"J Comput. Appl. Math"},{"issue":"3","key":"1487_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0036144502417715","volume":"46","author":"J-P Berrut","year":"2004","unstructured":"Berrut, J.-P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46 (3), 501\u2013517 (2004). https:\/\/doi.org\/10.1137\/s0036144502417715","journal-title":"SIAM Rev."},{"key":"1487_CR5","doi-asserted-by":"publisher","unstructured":"Berrut, J.-P., Baltensperger, R., Mittelmann, H.D.: Recent developments in barycentric rational interpolation. In: Trends and applications in constructive approximation, pp. 27\u201351. Birkh\u00e4user Basel. https:\/\/doi.org\/10.1007\/3-7643-7356-3_3 (2005)","DOI":"10.1007\/3-7643-7356-3_3"},{"key":"1487_CR6","doi-asserted-by":"publisher","unstructured":"Braess, D.: Nonlinear approximation theory. Springer Berlin Heidelberg. ISBN 978-3-642-64883-0. https:\/\/doi.org\/10.1007\/978-3-642-61609-9 (1986)","DOI":"10.1007\/978-3-642-61609-9"},{"key":"1487_CR7","doi-asserted-by":"publisher","unstructured":"Carpenter, A.J., Ruttan, A., Varga, R.S: Extended numerical computations on the 1\/9 conjecture in rational approximation theory. In: Rational approximation and interpolation, pp. 383\u2013411. Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/bfb0072427 (1984)","DOI":"10.1007\/bfb0072427"},{"key":"1487_CR8","doi-asserted-by":"publisher","unstructured":"Danczul, T., Hofreither, C.: On rational Krylov and reduced basis methods for fractional diffusion. Journal of Numerical Mathematics. https:\/\/doi.org\/10.1515\/jnma-2021-0032 (2021)","DOI":"10.1515\/jnma-2021-0032"},{"key":"1487_CR9","unstructured":"Danczul, T., Hofreither, C., Sch\u00f6berl, J.: A unified rational Krylov method for elliptic and parabolic fractional diffusion problems. Technical Report arXiv:2103.13068. https:\/\/arxiv.org\/abs\/2103.13068 (2021)"},{"issue":"1\u20133","key":"1487_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0024-3795(99)00134-2","volume":"299","author":"J Demmel","year":"1999","unstructured":"Demmel, J., Gu, M., Eisenstat, S., Slapni\u010dar, I., Veseli\u0107, K., Drma\u010d, Z.: Computing the singular value decomposition with high relative accuracy. Linear Algebra. Appl 299(1\u20133), 21\u201380 (1999). https:\/\/doi.org\/10.1016\/s0024-3795(99)00134-2","journal-title":"Linear Algebra. Appl"},{"key":"1487_CR11","unstructured":"Driscoll, T.A., Hale, N., Trefethen, L.N.: Chebfun Guide. Pafnuty Publications. http:\/\/www.chebfun.org\/docs\/guide\/ (2014)"},{"issue":"2","key":"1487_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/s0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998). https:\/\/doi.org\/10.1137\/s0895479895290954","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"1487_CR13","doi-asserted-by":"publisher","first-page":"A2427","DOI":"10.1137\/17M1132409","volume":"40","author":"S-I Filip","year":"2018","unstructured":"Filip, S.-I., Nakatsukasa, Y., Trefethen, L.N., Beckermann, B.: Rational minimax approximation via adaptive barycentric representations. SIAM J. Sci. Comput 40(4), A2427\u2013A2455 (2018). https:\/\/doi.org\/10.1137\/17m1132409","journal-title":"SIAM J. Sci. Comput"},{"key":"1487_CR14","unstructured":"Georgieva, I., Hofreither, C.: A newton\u2019s method for best uniform polynomial approximation. Technical Report 2021-46, RICAM. https:\/\/www.ricam.oeaw.ac.at\/files\/reports\/21\/rep21-46.pdf (2021)"},{"key":"1487_CR15","unstructured":"Giles, M.: An extended collection of matrix derivative results for forward and reverse mode automatic differentiation. Technical report, University of Oxford. https:\/\/ora.ox.ac.uk\/objects\/uuid:8d0c0a29-c92b-4153-a1d2-38b276e93124 (2008)"},{"issue":"1","key":"1487_CR16","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1002\/gamm.201310002","volume":"36","author":"S G\u00fcttel","year":"2013","unstructured":"G\u00fcttel, S.: Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection. GAMM-Mitteilungen 36(1), 8\u201331 (2013). https:\/\/doi.org\/10.1002\/gamm.201310002","journal-title":"GAMM-Mitteilungen"},{"issue":"5","key":"1487_CR17","doi-asserted-by":"publisher","first-page":"e2167","DOI":"10.1002\/nla.2167","volume":"25","author":"S Harizanov","year":"2018","unstructured":"Harizanov, S., Lazarov, R., Margenov, S., Marinov, P., Vutov, Y.: Optimal solvers for linear systems with fractional powers of sparse SPD matrices. Numerical Linear Algebra with Applications 25 (5), e2167 (2018). https:\/\/doi.org\/10.1002\/nla.2167","journal-title":"Numerical Linear Algebra with Applications"},{"key":"1487_CR18","unstructured":"Harizanov, S., Lazarov, R., Margenov, S., Marinov, P.: The best uniform rational approximation: applications to solving equations involving fractional powers of elliptic operators. Number 9 in Lectures Notes in Computer Science and Technologies of the IICT-BAS. Institute of Information and Communication Technologies at the Bulgarian Academy of Sciences. https:\/\/pa.iict.bas.bg\/lcst\/2019\/09-2019-HLMM.pdf(2019)"},{"key":"1487_CR19","doi-asserted-by":"publisher","first-page":"109285","DOI":"10.1016\/j.jcp.2020.109285","volume":"408","author":"S Harizanov","year":"2020","unstructured":"Harizanov, S., Lazarov, R., Margenov, S., Marinov, P., Pasciak, J.: Analysis of numerical methods for spectral fractional elliptic equations based on the best uniform rational approximation. Chin J. Comput. Phys 408, 109285 (2020). https:\/\/doi.org\/10.1016\/j.jcp.2020.109285","journal-title":"Chin J. Comput. Phys"},{"issue":"1\u20133","key":"1487_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0024-3795(99)00230-X","volume":"309","author":"NJ Higham","year":"2000","unstructured":"Higham, N.J.: QR factorization with complete pivoting and accurate computation of the SVD. Linear Algebra. Appl. 309 (1\u20133), 153\u2013174 (2000). https:\/\/doi.org\/10.1016\/s0024-3795(99)00230-x","journal-title":"Linear Algebra. Appl."},{"issue":"4","key":"1487_CR21","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1093\/imanum\/24.4.547","volume":"24","author":"NJ Higham","year":"2004","unstructured":"Higham, N.J.: The numerical stability of barycentric Lagrange interpolation. IMA J. Numer. Anal 24(4), 547\u2013556 (2004). https:\/\/doi.org\/10.1093\/imanum\/24.4.547","journal-title":"IMA J. Numer. Anal"},{"issue":"2","key":"1487_CR22","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.camwa.2019.07.025","volume":"80","author":"C Hofreither","year":"2020","unstructured":"Hofreither, C.: A unified view of some numerical methods for fractional diffusion. Comput. Math. Appl 80(2), 332\u2013350 (2020). https:\/\/doi.org\/10.1016\/j.camwa.2019.07.025","journal-title":"Comput. Math. Appl"},{"key":"1487_CR23","doi-asserted-by":"publisher","unstructured":"Hofreither, C.: An algorithm for best rational approximation based on barycentric rational interpolation. Numerical Algorithms. https:\/\/doi.org\/10.1007\/s11075-020-01042-0 (2021)","DOI":"10.1007\/s11075-020-01042-0"},{"key":"1487_CR24","volume-title":"Lagrange Rational Interpolation and its Applications to Approximation of Large-Scale Dynamical Systems","author":"AC Ionit\u0103","year":"2013","unstructured":"Ionit\u0103, A.C.: Lagrange Rational Interpolation and its Applications to Approximation of Large-Scale Dynamical Systems. PhD Thesis, Rice University, Houston (2013)"},{"key":"1487_CR25","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1109\/LSP.2007.913583","volume":"15","author":"L Knockaert","year":"2008","unstructured":"Knockaert, L.: A simple and accurate algorithm for barycentric rational interpolation. IEEE Signal Process. Lett. 15, 154\u2013157 (2008). https:\/\/doi.org\/10.1109\/lsp.2007.913583","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"1487_CR26","doi-asserted-by":"publisher","first-page":"A1494","DOI":"10.1137\/16M1106122","volume":"40","author":"Y Nakatsukasa","year":"2018","unstructured":"Nakatsukasa, Y., S\u00e8te, O., Trefethen, L.N.: The AAA algorithm for rational approximation. SIAM J. Sci. Comput 40(3), A1494\u2013A1522 (2018). https:\/\/doi.org\/10.1137\/16m1106122","journal-title":"SIAM J. Sci. Comput"},{"issue":"175","key":"1487_CR27","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0025-5718-1986-0842136-8","volume":"47","author":"C Schneider","year":"1986","unstructured":"Schneider, C., Werner, W.: Some new aspects of rational interpolation. Math. Comput. 47(175), 285\u2013285 (1986). https:\/\/doi.org\/10.1090\/s0025-5718-1986-0842136-8","journal-title":"Math. Comput."},{"key":"1487_CR28","unstructured":"Trefethen, L.N.: Approximation Theory and Approximation Practice. Other Titles in Applied Mathematics. SIAM. ISBN 9781611972405 (2013)"},{"issue":"2","key":"1487_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02145384","volume":"2","author":"RS Varga","year":"1992","unstructured":"Varga, R.S., Carpenter A.J.: Some numerical results on best uniform rational approximation of x\u03b1 on [0, 1]. Numerical Algorithms 2(2), 171\u2013185 (1992). https:\/\/doi.org\/10.1007\/bf02145384","journal-title":"Numerical Algorithms"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01487-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01487-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01487-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T09:07:25Z","timestamp":1690016845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01487-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,27]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1487"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01487-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,12,27]]},"assertion":[{"value":"3 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}