Computing Chebyshev polynomials using the complex Remez algorithm
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908443565096960 |
|---|---|
| author | Hübner, Lennart Aljoscha Rubin, Olof |
| author_facet | Hübner, Lennart Aljoscha Rubin, Olof |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_05067 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computing Chebyshev polynomials using the complex Remez algorithm Hübner, Lennart Aljoscha Rubin, Olof Complex Variables 41A50, 65E05, 30C10 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. |
| title | Computing Chebyshev polynomials using the complex Remez algorithm |
| topic | Complex Variables 41A50, 65E05, 30C10 |
| url | https://arxiv.org/abs/2405.05067 |