Chebyshev interpolation and quadrature f
โ
Salzer, Herbert E.
๐
Article
๐
1969
๐
Association for Computing Machinery
๐
English
โ 73 KB
All the zeros x 2 m , i , i = 1(1)2 m , of the Chebyshev polynomials T 2 m ( x ), m = 0(1) n , are found recursively just by taking n 2 n -1 real square roots. For interpolation or integration of ฦ( x ), given ฦ( x 2 m , i ), only x 2 m , i is needed to calculate (a) the (2 m - 1)-th degree