Chebyshev Interpolation for Function in 1D

TL;DR

This paper explores using Chebyshev Interpolation to efficiently find all roots of a function within an interval, demonstrating its effectiveness through numerical results.

Contribution

It introduces a Chebyshev Interpolation method specifically for root-finding in one-dimensional functions, highlighting its ability to compute multiple roots simultaneously.

Findings

Chebyshev Interpolation accurately finds roots in 1D functions.

Numerical results confirm the method's efficiency and reliability.

The approach outperforms traditional root-finding techniques in certain scenarios.

Abstract

This research is concerned with finding the roots of a function in an interval using Chebyshev Interpolation. Numerical results of Chebyshev Interpolation are presented to show that this is a powerful way to simultaneously calculate all the roots in an interval.