{"title":"用 $$\\tau$ 方法计算复域中的多项式和有理近似值","authors":"Irina Georgieva, Clemens Hofreither","doi":"10.1007/s11075-024-01897-7","DOIUrl":null,"url":null,"abstract":"<p>We investigate numerical methods for computation of polynomial and rational approximations of functions in complex domains based on Faber polynomials and the Lanczos <span>\\(\\tau \\)</span>-method. Our interest is motivated by applications in fractional partial differential equations. We give an overview of previous results related to the basis of Faber polynomials associated with a complex domain, Faber expansion, and the Lanczos <span>\\(\\tau \\)</span>-method. We also collect numerical algorithms for the computational realization of these concepts. Our main new contribution is a <span>\\(\\tau \\)</span>-method for rational approximation in complex domains which uses Faber polynomials in the perturbation term. We realize it via a novel hybrid symbolic-numeric algorithm which can be applied to arbitrary functions satisfying a suitable differential equation. We present some numerical examples, where we use sectors lying in the complex plane as our domains of interest. We compare results for the various polynomial and rational approximation techniques outlined above; in particular, we observe exponential convergence with respect to the rational degree for our proposed method.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"15 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computation of polynomial and rational approximations in complex domains by the $$\\\\tau $$ -method\",\"authors\":\"Irina Georgieva, Clemens Hofreither\",\"doi\":\"10.1007/s11075-024-01897-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We investigate numerical methods for computation of polynomial and rational approximations of functions in complex domains based on Faber polynomials and the Lanczos <span>\\\\(\\\\tau \\\\)</span>-method. Our interest is motivated by applications in fractional partial differential equations. We give an overview of previous results related to the basis of Faber polynomials associated with a complex domain, Faber expansion, and the Lanczos <span>\\\\(\\\\tau \\\\)</span>-method. We also collect numerical algorithms for the computational realization of these concepts. Our main new contribution is a <span>\\\\(\\\\tau \\\\)</span>-method for rational approximation in complex domains which uses Faber polynomials in the perturbation term. We realize it via a novel hybrid symbolic-numeric algorithm which can be applied to arbitrary functions satisfying a suitable differential equation. We present some numerical examples, where we use sectors lying in the complex plane as our domains of interest. We compare results for the various polynomial and rational approximation techniques outlined above; in particular, we observe exponential convergence with respect to the rational degree for our proposed method.</p>\",\"PeriodicalId\":54709,\"journal\":{\"name\":\"Numerical Algorithms\",\"volume\":\"15 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Numerical Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11075-024-01897-7\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01897-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Computation of polynomial and rational approximations in complex domains by the $$\tau $$ -method
We investigate numerical methods for computation of polynomial and rational approximations of functions in complex domains based on Faber polynomials and the Lanczos \(\tau \)-method. Our interest is motivated by applications in fractional partial differential equations. We give an overview of previous results related to the basis of Faber polynomials associated with a complex domain, Faber expansion, and the Lanczos \(\tau \)-method. We also collect numerical algorithms for the computational realization of these concepts. Our main new contribution is a \(\tau \)-method for rational approximation in complex domains which uses Faber polynomials in the perturbation term. We realize it via a novel hybrid symbolic-numeric algorithm which can be applied to arbitrary functions satisfying a suitable differential equation. We present some numerical examples, where we use sectors lying in the complex plane as our domains of interest. We compare results for the various polynomial and rational approximation techniques outlined above; in particular, we observe exponential convergence with respect to the rational degree for our proposed method.
期刊介绍:
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.