用 $$\tau$ 方法计算复域中的多项式和有理近似值

IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED
Irina Georgieva, Clemens Hofreither
{"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}
引用次数: 0

摘要

我们研究了基于法布尔多项式和 Lanczos (\tau \)方法计算复域中函数的多项式和有理近似的数值方法。我们的兴趣源于分数偏微分方程中的应用。我们概述了与复数域相关的法布尔多项式基础、法布尔展开和 Lanczos (\tau \)方法有关的先前结果。我们还收集了计算实现这些概念的数值算法。我们的主要新贡献是在复杂域中使用法布尔多项式进行有理逼近的(\(\tau \)-method)扰动项。我们通过一种新颖的符号-数值混合算法来实现它,这种算法可以应用于满足适当微分方程的任意函数。我们介绍了一些数值示例,其中我们使用复平面内的扇形作为我们感兴趣的域。我们比较了上述各种多项式和有理近似技术的结果;特别是,我们观察到我们提出的方法在有理程度上呈指数收敛。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Computation of polynomial and rational approximations in complex domains by the $$\tau $$ -method

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Numerical Algorithms
Numerical Algorithms 数学-应用数学
CiteScore
4.00
自引率
9.50%
发文量
201
审稿时长
9 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信