Recursion function-Chebyshev polynomials
9 次查看(过去 30 天)
显示 更早的评论
Question:
Chebyshev polynomials are defined recursively. Chebyshev polynomials are separated into two kinds: first and second. Chebyshev polynomials of the first kind, Tn(x), and of the second kind, Un(x), are defined by the following recurrence relations:
Tn(x) = 1 if n = 0;
= x if n = 1;
= 2xTn−1(x) − Tn−2(x) otherwise;
Write a function with header [y] = myChebyshevPoly1(n,x), where y is the n-th Chebyshev polynomial of the first kind evaluated at x.Be sure your function can take array inputs for x. You may assume that x is a row vector. The output variable, y, must be a row vector also.
function [y] = myChebyshevPoly1(n,x)
% y = chebyshev polynimial
%Tn(x) = 1 if n=0
%Tn(x) =x if n=1
%Tn(x) = 2xTn-1(x) - Tn-2(x)
%function can take array
% get array x
xleng=length(x);
if n ==0
y=1;
elseif n==1
y = x;
else
for i= 1: xleng
y= 2*(x)*myChebyshevPoly1(n-1,x) - myChebyshevPoly1(n-2,x);
end
end
end
end
Comment: the code doesnt run because the array can't multiply together, how can I fix this?
0 个评论
采纳的回答
Walter Roberson
2016-9-4
Remember .* instead of *
But notice that in every iteration of your loop, you are overwriting all of y based on all of x. You need to rethink that loop.
2 个评论
更多回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Polynomials 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!