{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:59Z","timestamp":1772119799768,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T00:00:00Z","timestamp":1721865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T00:00:00Z","timestamp":1721865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["KP-06-N62\/4"],"award-info":[{"award-number":["KP-06-N62\/4"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["KP-06-N62\/4"],"award-info":[{"award-number":["KP-06-N62\/4"]}],"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":[[2025,6]]},"DOI":"10.1007\/s11075-024-01897-7","type":"journal-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T04:01:54Z","timestamp":1721880114000},"page":"791-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computation of polynomial and rational approximations in complex domains by the $$\\tau $$-method"],"prefix":"10.1007","volume":"99","author":[{"given":"Irina","family":"Georgieva","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Hofreither","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,25]]},"reference":[{"issue":"1","key":"1897_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/imamat\/17.1.85","volume":"17","author":"JP Coleman","year":"1976","unstructured":"Coleman, J.P.: The Lanczos tau-method. IMA J. Appl. Math. 17(1), 85\u201397 (1976). https:\/\/doi.org\/10.1093\/imamat\/17.1.85","journal-title":"IMA J. Appl. Math."},{"key":"1897_CR2","doi-asserted-by":"publisher","unstructured":"Coleman, J.P.: Polynomial approximations in the complex plane. J. Comput. Appl. Math. 18(2), 193\u2013211 (1987). ISSN 0377-0427. https:\/\/doi.org\/10.1016\/0377-0427(87)90016-1","DOI":"10.1016\/0377-0427(87)90016-1"},{"issue":"179","key":"1897_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/s0025-5718-1987-0890264-4","volume":"49","author":"JP Coleman","year":"1987","unstructured":"Coleman, J.P., Smith, R.A.: The Faber polynomials for circular sectors. Math. Comput. 49(179), 231\u2013241 (1987). https:\/\/doi.org\/10.1090\/s0025-5718-1987-0890264-4","journal-title":"Math. Comput."},{"issue":"6","key":"1897_CR4","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1080\/00029890.1971.11992813","volume":"78","author":"JH Curtiss","year":"1971","unstructured":"Curtiss, J.H.: Faber polynomials and the Faber series. American Math. Monthly. 78(6), 577\u2013596 (1971). https:\/\/doi.org\/10.1080\/00029890.1971.11992813","journal-title":"American Math. Monthly."},{"issue":"1","key":"1897_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1515\/cmam-2022-0033","volume":"23","author":"E Denich","year":"2023","unstructured":"Denich, E., Novati, P.: A Gaussian method for the square root of accretive operators. Comput. Methods Appl. Math. 23(1), 127\u2013143 (2023). https:\/\/doi.org\/10.1515\/cmam-2022-0033","journal-title":"Comput. Methods Appl. Math."},{"key":"1897_CR6","doi-asserted-by":"publisher","unstructured":"Driscoll, T.A.,\u00a0Nakatsukasa, Y., Trefethen, L.N.: AAA rational approximation on a continuum. SIAM J. Scientific Comput. 46(2), A929\u2013A952 (2024). ISSN 1095-7197. https:\/\/doi.org\/10.1137\/23m1570508","DOI":"10.1137\/23m1570508"},{"key":"1897_CR7","doi-asserted-by":"publisher","unstructured":"Ellacott, S.W.: Computation of Faber series with application to numerical polynomial approximation in the complex plane. Math. Comput. 40(162), 575\u2013587 (1983). ISSN 00255718, 10886842. https:\/\/doi.org\/10.1090\/S0025-5718-1983-0689474-7","DOI":"10.1090\/S0025-5718-1983-0689474-7"},{"key":"1897_CR8","doi-asserted-by":"publisher","unstructured":"Faber, G.: \u00dcber polynomische Entwickelungen. Mathematische Annalen. 57, 389\u2013408 (1903). ISSN 14321807. https:\/\/doi.org\/10.1007\/BF01444293","DOI":"10.1007\/BF01444293"},{"key":"1897_CR9","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1007\/s11075-022-01487-5","volume":"93","author":"I Georgieva","year":"2023","unstructured":"Georgieva, I., Hofreither, C.: A newton method for best uniform rational approximation. Numerical Algorithms. 93, 1741\u20131758 (2023). https:\/\/doi.org\/10.1007\/s11075-022-01487-5","journal-title":"Numerical Algorithms."},{"key":"1897_CR10","doi-asserted-by":"publisher","unstructured":"Gopal, A., Trefethen, L.N.: Representation of conformal maps by rational functions. Numerische Mathematik. 142(2), 359\u2013382 (2019). ISSN 0945-3245. https:\/\/doi.org\/10.1007\/s00211-019-01023-z","DOI":"10.1007\/s00211-019-01023-z"},{"issue":"160","key":"1897_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1090\/S0025-5718-1982-0669652-2","volume":"39","author":"U Grothkopf","year":"1982","unstructured":"Grothkopf, U., Opfer, G.: Complex Chebyshev polynomials on circular sectors with degree six or less. Math. Comput. 39(160), 599\u2013615 (1982)","journal-title":"Math. Comput."},{"issue":"2","key":"1897_CR12","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":"1897_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-020-01042-0","author":"C Hofreither","year":"2021","unstructured":"Hofreither, C.: An algorithm for best rational approximation based on barycentric rational interpolation. Numerical Algorithms (2021). https:\/\/doi.org\/10.1007\/s11075-020-01042-0","journal-title":"Numerical Algorithms"},{"key":"1897_CR14","doi-asserted-by":"publisher","unstructured":"Khajah, H.G., Ortiz E.L.: Rational approximations: A tau method approach. In Topics in Polynomials of One and Several Variables and Their Applications, pages 323\u2013333. World Scientific, (1993). https:\/\/doi.org\/10.1142\/9789814360296_0020","DOI":"10.1142\/9789814360296_0020"},{"key":"1897_CR15","doi-asserted-by":"publisher","unstructured":"K\u00f6vari, T., Pommerenke, C.: On Faber polynomials and Faber expansions. Math. Zeitschrift 99(3), 193\u2013206 (1967). ISSN 1432-1823. https:\/\/doi.org\/10.1007\/bf01112450","DOI":"10.1007\/bf01112450"},{"issue":"1\u20134","key":"1897_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/sapm1938171123","volume":"17","author":"C Lanczos","year":"1938","unstructured":"Lanczos, C.: Trigonometric interpolation of empirical and analytical functions. J. Math. Phys. 17(1\u20134), 123\u2013199 (1938). https:\/\/doi.org\/10.1002\/sapm1938171123","journal-title":"J. Math. Phys."},{"issue":"4","key":"1897_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1137\/0103016","volume":"3","author":"YL Luke","year":"1955","unstructured":"Luke, Y.L.: Remarks on the $$\\tau $$-method for the solution of linear differential equations with rational coefficients. J. Soc. Indust. Appl. Math. 3(4), 179\u2013191 (1955). https:\/\/doi.org\/10.1137\/0103016","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"1897_CR18","unstructured":"Luke, Y.L.: Special Functions and Their Approximations: v. 2. Elsevier Science, (1969). ISBN 9780080955612"},{"issue":"3","key":"1897_CR19","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. Scientific Comput. 40(3), A1494\u2013A1522 (2018). https:\/\/doi.org\/10.1137\/16m1106122","journal-title":"SIAM J. Scientific Comput."},{"key":"1897_CR20","doi-asserted-by":"crossref","unstructured":"Walsh, J.L.: Interpolation and approximation by rational functions in the complex domain, volume\u00a020. American Mathematical Soc., (1935)","DOI":"10.1090\/coll\/020"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01897-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01897-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01897-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T03:51:04Z","timestamp":1746849064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01897-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,25]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1897"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01897-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4441013\/v1","asserted-by":"object"}]},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,25]]},"assertion":[{"value":"18 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2024","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"No ethical issues arise in connection with our work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}}]}}