[CSC 335] Matrix question in Proj 2

[Andrew J. Pounds]

I think you have answered your own question.   In the literature you 
will many times see matrices used in this way to simplify the 
presentation.  The discrete fourier transform filtering in matrix form 
is actually

${\bf y}=  {\bf \widehat{Z^{-1}}}{\bf \widehat{G}}{\bf \widehat{Z}} {\bf 
y}$.

Only by dissecting the pieces and actually writing the code can you 
sometimes spot the shortcuts.


On 12/04/13 21:25, Tapas Misra wrote:
> Dr. Pounds,
>
> There are three parts of the DFT filtering process:
>
>     1.) The actual Discrete Fourier Transform - in the project specs 
> handout ( c = Z * y)
>
>     2.) The attentuation process - (c = G * c)
>
>     3.) The Inverse Transform - three methods specified in handout
>
> I know parts 1 and 3 must be implemented via matrix methods as per 
> your instruction. My question is, does part #2 need to be implemented 
> with Matrix-Vector Multiplication? Since G is a diagonal matrix, is it 
> acceptable to simply multiply each component of c by its corresponding 
> attenuation factor without actually constructing a G matrix?


-- 
Andrew J. Pounds, Ph.D.  (pounds_aj at mercer.edu)
Professor of Chemistry and Computer Science
Mercer University,  Macon, GA 31207   (478) 301-5627
http://faculty.mercer.edu/pounds_aj

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://theochem.mercer.edu/pipermail/csc335/attachments/20131205/2cd156ac/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: tblatex-4.png
Type: image/png
Size: 1245 bytes
Desc: not available
URL: <http://theochem.mercer.edu/pipermail/csc335/attachments/20131205/2cd156ac/attachment.png>