polynomial multiplication using fastfourier transform

Posted by mawia on Stack Overflow See other posts from Stack Overflow or by mawia
Published on 2009-08-10T20:24:43Z Indexed on 2010/05/30 18:32 UTC
Read the original article Hit count: 454

i am going through the above topic from CLRS(CORMEN) (page 834) and I got stuck at this point.

Can anybody please explain how the following expression,

A(x)=A^{[0]}(x^2) +xA^{[1]}(x^2)

follows from,

n-1                       `
 S  a_j x^j
j=0

Where,

A^{[0]} = a_0 + a_2x + a_4a^x ... a_{n-2}x^{\frac{n}{2-1}}
A^{[1]} = a_1 + a_3x + a_5a^x ... a_{n-1}x^{\frac{n}{2-1}}

WITH REGARDS

THANKS

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about homework