[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: chebyshev transform routines
From: |
Kamaraju S Kusumanchi |
Subject: |
Re: chebyshev transform routines |
Date: |
Sun, 17 Jun 2007 23:29:42 -0400 |
User-agent: |
KNode/0.10.4 |
Jordi Gutierrez Hermoso wrote:
> On 16/06/07, Kamaraju S Kusumanchi <address@hidden> wrote:
>> Are there any functions available in Octave for performing chebyshev
>> transforms?
>
> Is the Chebyshev transform the same thing as the Chebyshev series?
I was referring to the following.
U(x_j) = \sum_{k=0}^N ( Uhat(k) * T_k(x_j) )
where x_j for j=0:N are usually given by cos(pi*j/N). The reverse transform
is defined accordingly.
Currently, I am doing it by explicit matrix multiplications. You can also do
the transform efficiently by using fftws. I was asking if octave provides a
way to perform these transforms using fftw routines.
thanks
raju
--
Kamaraju S Kusumanchi
http://www.people.cornell.edu/pages/kk288/
http://malayamaarutham.blogspot.com/