Interpolation resolved In linear algebra terms, the FFT multiplies an arbitrary n-dimensional vector which we have been calling the coef cient representation by the n n matrix Mn(!) = 2 66 66 66 66 66 4 1 1 1 1 1 ! !2 !n 1 1 !2 !4 !2(n 1) ... 1 !j !2j !(n 1)j ... 1 !(n 1) !2(n 1) !(n 1)(n 1) 3 77 77 77 77 77 5 row for !0 = 1 ! !2 ... !j ... !n 1 where ! is a complex nth root of unity, and n is a p