arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.05067math.CV
收藏

使用复Remez算法计算切比雪夫多项式

Computing Chebyshev polynomials using the complex Remez algorithm

Lennart Aljoscha Hübner, Olof Rubin

AI总结:

本研究使用广义Remez算法对高次复切比雪夫多项式进行实验分析,揭示其范数与零点的重复模式,并提出切比雪夫与Faber多项式间的基本关系。

摘要:

我们采用由P. T. P. Tang最初提出的广义Remez算法,对复平面中的切比雪夫多项式进行实验研究。我们特别关注其范数和零点的检验。我们研究的独特之处在于所考虑的示例范围广泛,且所研究的次数远高于以往使用其他方法的研究。这些高次切比雪夫多项式的计算揭示了明显且重复的模式,表明切比雪夫多项式在一般情况下的典型行为。使用Tang算法可以实现精确计算,并在可量化的误差范围内保持准确性。此外,作为我们实验研究的结果,我们提出了我们认为与紧集相关的切比雪夫多项式和Faber多项式之间的基本关系。

英文摘要:

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What sets our study apart is the breadth of examples considered, coupled with the fact that the degrees under investigation are substantially higher than those in previous studies where other methods have been applied. These computations of Chebyshev polynomials of high degrees reveal discernible, repeating patterns, which indicate a typical behavior of Chebyshev polynomials in a general setting. The use of Tang's algorithm allows for computations executed with precision, maintaining accuracy within quantifiable margins of error. Additionally, as a result of our experimental study, we propose what we believe to be a fundamental relationship between Chebyshev and Faber polynomials associated with a compact set.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑