By Herbert E. Salzer
Communications of the ACM,
May 1969,
Vol. 12 No. 5, Page 271
10.1145/362946.362980
Comments
All the zeros x2m,i, i = 1(1)2m, of the Chebyshev polynomials T2m(x), m = 0(1)n, are found recursively just by taking n2n-1 real square roots. For interpolation or integration of ƒ(x), given ƒ(x2m,i), only x2m,i is needed to calculate (a) the (2m - 1)-th degree Lagrange interpolation polynomial, and (b) the definite integral over [-1, 1], either with or without the weight function (1 - x2)-1/2, the former being exact for ƒ(x) of degree 2m+1 - 1.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
