The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Topic: Closed expression for coefficients Chebychev polynomial
Replies: 1   Last Post: Jun 14, 1996 8:10 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View  
robert bristow-johnson

Posts: 19
Registered: 12/7/04
Re: Closed expression for coefficients Chebychev polynomial
Posted: Jun 14, 1996 8:10 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <4prj8q$>, Hauke Reddmann ( writes:
>I could err (must look up my math dictionary),
>but wasn't simply Tn(x)=sin(n*arccos(x)),Un(x)=cos(thesame)?

i think you switched the Tn and Un.

T[n](x) = cos( n*arccos(x) ) for |x| <= 1
= cosh( n*arccosh(x) ) for |x| >= 1

it is what you say but it is also a polynomial (because T[0](x) = 1, T[1](x) =
x, and there is this cool recursion formula, T[n+1](x) = 2*x*T[n](x) - T[n-1])
and the original poster (and myself) want to know if there is a closed form
expression for the kth coefficient of T[n](x) that is a simple function of n
and k. i suppose there is (that can be inductively proven using the recursion
formula and boundary conditions above) but i have never seen it.

r b-j
wave mechanics, inc. or

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2017. All Rights Reserved.