Complexity of FFT for matrix-matrix multiplication

N

nhuda

New member
Joined
Apr 14, 2019
Messages
6
Hello,
Let A and B are kxk square matrices. The computational complexity of matrix C = AXB is O(K^3).
What is the computational complexity for the Fast Fourier Transform (FFT) of matrix C, FFT(C)?
 
This is not a free homework site. It is rather a free math help forum where we help students solve their problems. What exactly do you need help with? Can we see the work you have done so far? if you had read the posting guidelines you would have known that we requested this information from you. You also would have received help by now if you had followed the posting rules/
 
You must log in or register to reply here.
Top