Tag Archives: fourier transform

Polynomial Multiplication, Karatsuba and Fast Fourier Transform

Let’s say you want to write a short program to multiply two linear functions f(x) = ax+b and g(x) = cx+d and compute the coefficients of the resulting product: You might think it’ll take 4 multiplications (for ac, ad, bc and bd) and 1 addition (for ad+bc), but there’s … Continue reading

Posted in Notes | Tagged , , , , , | Leave a comment

Linear Algebra: Inner Products

[ Background required: basic knowledge of linear algebra, e.g. the previous post. Updated on 6 Dec 2011: added graphs in Application 2, courtesy of wolframalpha.] Those of you who already know inner products may roll your eyes at this point, … Continue reading

Posted in Notes | Tagged , , , , , , , | Leave a comment