Code covered by the BSD License  

Highlights from
Inverse fast Chebyshev transform

Be the first to rate this file! 10 Downloads (last 30 days) File Size: 1.41 KB File ID: #44033 Version: 1.1

Inverse fast Chebyshev transform


Matt (view profile)


21 Oct 2013 (Updated )

Fast computation of the inverse Chebyshev transform

| Watch this File

File Information

ifcht(V) computes the inverse Chebyshev transform of a N+1 by 1 array A. If A corresponds to the weights of a linear combination of Chebyshev polynomials, then ifcht(a) computes the dataset interpolated by A at the Chebyshev–Gauss–Lobatto points cos(pi*(0:N)/N).
  Suppose A = [3; 2; 1]. Then the function
              f(x) = A(1)*1 + A(2)*x + A(3)*(2*x^2 - 1)
  evaluated at x = cos(pi*(0:2)/2) = [1,0,-1] is given by ifcht(A).
  x = cos(pi*(0:2)/2); %create Chebyshev grid of three points
  xx = linspace(-1,1); % create dense grid over domain
  A = [3; 2; 1];
  f = A(1)*1 + A(2)*xx + A(3)*(2*xx.^2 - 1);

Required Products MATLAB
MATLAB release MATLAB 8.1 (R2013a)
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
22 Oct 2013 1.1

matched usual naming convention

Contact us