NobleBlocks
Public

Computing Chebyshev polynomials using the complex Remez algorithm

Published in arXiv (Cornell University) • May 8, 2024
NobleIDNI8P77W05R85S64
Authors:
Lennart Aljoscha Hübner
,
Olof Rubin

Abstract

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, c...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!