What is the computational complexity of the n-dimensional FFT with m points along each dimension?
What is the computational complexity of the n-dimensional FFT with m points along each
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What is the computational complexity of the n-dimensional FFT with m points along each dimension?
For a 1D FFT it’s
O(m log m).For a 2D FFT you have to do m x 1D FFTs in each axis so that’s
O(2 m^2 log m)=O(m^2 log m).It’s too early in the morning here to get my head round
n >= 3but I’m guessing it’s probably: