Chebyshev and The Fast Fourier Transform Methods for Signal Interpolation
<|reference_start|>Chebyshev and The Fast Fourier Transform Methods for Signal Interpolation: Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the Weierstrass approximation, and the Fourier approximation theorem. The limitations associated with various approximation methods are too crucial to ignore, and thus, the nature of a specific dataset may require using a specific approximation method for such estimates. In this report, we shall delve into Chebyshev's polynomials interpolation in detail as an alternative approach to reconstructing signals and compare the reconstruction to that of the Fourier polynomials. We will also explore the advantages and limitations of the Chebyshev polynomials and discuss in detail their mathematical formulation and equivalence to the cosine function over a given interval [a, b].<|reference_end|>
@article{amartey2024chebyshev,
    title={Chebyshev and The Fast Fourier Transform Methods for Signal
  Interpolation},
    author={Ishmael N. Amartey},
    journal={arXiv preprint arXiv:2404.00414},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.00414},
    primaryClass={math.NA cs.NA eess.SP}
}