Chebyshev Approximation Polynomial
Source inspiration: (Mathew 2000-2019).
Description
Chebyshev-node interpolation uses clustered nodes near interval endpoints to reduce oscillation compared with equally spaced interpolation at the same degree. This is why Chebyshev-based polynomial approximation is a standard remedy for Runge-type endpoint blow-up.
On an interval \([a,b]\), \(n\) Chebyshev nodes are the mapped roots
\[ x_k = \frac{a+b}{2} + \frac{b-a}{2}\cos\!\left(\frac{(2k-1)\pi}{2n}\right),\qquad k=1,\ldots,n. \]
Animations
Each animation increases polynomial degree one step at a time for a fixed function and approximation interval.
Case 01

Case 02

Case 03

Case 04

Case 05

Case 06

Case 07

Case 08

Case 09

Case 10

Case 11

Case 12

Case 13

Case 14

Case 15

Case 16

Case 17

Case 18

Case 19

Case 20

Case 21

Case 22

Case 23

Case 24

Case 25

Case 26

Case 27

Case 28

Case 29

References
Mathew, John H. 2000-2019. Numerical Analysis - Numerical Methods Modules. https://web.archive.org/web/20190808102217/http://mathfaculty.fullerton.edu/mathews/n2003/NumericalUndergradMod.html.