Chebyshev’s coding based on Algorithm
function [R] = ChebyshevRatApprox(f,m,n)
syms theta x
N = m+n;
a = zeros(1,N+m+1);
a(1) = (2/pi)*(int(f(cos(theta)),theta,[0 pi]));
for i = 2:N+m+1
a(i) = (2/pi)*(int(f(cos(theta))*cos((i-1)*theta),theta,[0 pi]));
end
p = zeros(1,n+1); q = zeros(1,m+1);
A = zeros(N+1); b = zeros(1,N+1);
q(1) = 1;
for i = 1:N+1
for j = 1:i
if j<=n+1
A(i,j) = 0;
end
if i<=n+1
A(i,i) = 1;
end
for j = i+1:n+1
A(i,j) = 0;
end
for j = n+2:N+1
if i~=1
if abs(i-j+n+1)==0
A(i,j) = -(a(i+j-n-1)+a(2))/2;
