The degree-n Chebyshev polynomial is defined by
Tn(x) = cos[ncos-1(x)], -1 <= x <= 1.
These satisfy To(x) = 1, T1(x) = x, and the recursion relation
Tn+1(x) = 2xTn(x) - Tn-1(x), n >= 1.
Write a function Chebeval (x,N) that evaluates all of the Chebyshev polynomials of degree less than or equal to N at all of the points in column vector x. The result should be an array of size length (x) by N+1.
1
Expert's answer
2010-05-11T07:21:41-0400
Dear customer, your question is rather complex, please, submit your assignment to our site and we'll help you.
Numbers and figures are an essential part of our world, necessary for almost everything we do every day. As important…
APPROVED BY CLIENTS
"assignmentexpert.com" is professional group of people in Math subjects! They did assignments in very high level of mathematical modelling in the best quality. Thanks a lot
Comments
Leave a comment