Intel® oneAPI Math Kernel Library
Ask questions and share information with other developers who use Intel® Math Kernel Library.
6981 Discussions

DFTI_UNIMPLEMENTED for 3D real-to-complex transform

Henry_G_Intel
Employee
539 Views
Hello,
I'm trying to do a 3D real-to-complex DFT using the following code:
SUBROUTINE FFTBRC(C,N,ISN)
USE prec
USE MKL_DFTI
TYPE (DFTI_DESCRIPTOR), POINTER :: dfti_handle
INTEGER :: status, N(3), ISN
COMPLEX(q) :: C(*)
LOGICAL ::class_error
CHARACTER(DFTI_MAX_MESSAGE_LENGTH) :: error_message
status = DftiCreateDescriptor &
(dfti_handle, &
DFTI_DOUBLE, &
DFTI_REAL, 3, N)
if (status .ne. 0) then
error_message = DftiErrorMessage (status)
print*, 'DftiCreateDesriptor ', error_message
endif

status = DftiCommitDescriptor (dfti_handle)
status = DftiComputeForward (dfti_handle, C)
status = DftiFreeDescriptor (dfti_handle)
RETURN
END
The error message returned after the call to DftiCreateDescriptor is DFTI_UNIMPLEMENTED. In case it matters, the input grid is 4 x 4 x 4. I'm using MKL 7.0 beta (l_mkl_b1_7.0.007), the Intel 8.0 Fortran compiler, and Red Hat Linux 7.3.
Can you give an estimate of when the MKL DFTI will be able to do 3D real-to-complex transforms?
Thanks,
Henry
0 Kudos
9 Replies
Todd_R_Intel
Employee
539 Views

Henry,

1D real-to-complex transforms are currently supported and the plan is to implement 2D real-to-complex transforms for the MKL 7.0 gold release. I don't know whatcurrent plans there are to implement the 3D case.

Doesanyone else on the forum have need of a 3D real-to-complex DFT? What sort of applications are making use of these transforms?

Todd

0 Kudos
Henry_G_Intel
Employee
539 Views

Todd,

Bad luck for me. Obviously, I think 3D real-to-complex DFT's are useful. The computational chemistry application that I'm tuning performs 3D real-to-complex transforms. I've also worked on molecular docking applications that perform Fourier correlation using real coordinates. Most of the scientific libraries that I've used have 3D real-to-complex DFT routines.

Henry

0 Kudos
Todd_R_Intel
Employee
539 Views
Perhaps bad luck and perhaps not. The development team is considering this request for support of 3D real-to-complex implementation.
And thanks for the further detail. Anyone else out there looking for 3D real-to-complex DFT routines?
-Todd
0 Kudos
heinono1
Beginner
539 Views
I also need 3D real-to-complex FFT.
Am I correct that 3D real-to-complex FFT is not implemented
on MKL 6.1? I can create a descriptor and commit the descriptor, but the results are just garbage.
0 Kudos
Intel_C_Intel
Employee
539 Views
3D r2c is not implemented in 6.1. Unfortunately the software did not return the correct information.
This will be one of the next areas we give attention to.
Bruce
0 Kudos
heinono1
Beginner
539 Views
Ooops, my bad. My MKL version is 6.1.1.004. The descriptor is committed
alright without error messages, but I cannot make sense of the fft numbers.
I am just curious if there are known problems with 3D r2c DFT in mkl 6.1.1.004.
Thanks,
Olle
0 Kudos
Henry_G_Intel
Employee
539 Views

Hi,

I'm surprised that the call to DftiCreateDescriptor doesn't return DFTI_UNIMPLEMENTED for your 3D r2c.

Can you tell us something about your application? I'm just curious about other algorithms that do 3D r2c transforms.

Thanks,

Henry

0 Kudos
heinono1
Beginner
539 Views

Hi. I do micromagnetic simulations. A quick and easy way to calculate magnetostatic interactions involves using FFT (the equations for the magnetostatic fields are convolutions in real space). Since the quantities are all real it can potentially cut down on memory usage and CPU time by using real2complex FFT. I have implemented the fftw library - the 3D r2c fftw works fine in terms of memory reduction, but the best performance in speed I have obtained is many times slower (!) than using the c2c fft from mkl 6.1.1. This involved various trials using the threaded fftw library (very slow!) or the non-threaded fftw library. My final(?) fix in lieu of intel fixing the multi-dimensional r2c invloved a workaround with temporary storage in complex form to use the mkl c2c fft, then repacking only the independent elements in a real matrix, do the matrix multiplication and then carefully repack the result in a temporary complex array to do the back-transform. The performance in the end is about the same as using the c2c fft but memory usage is reduced (not by 50% but but about 30 - 40%).

Olle
0 Kudos
Intel_C_Intel
Employee
539 Views

Thanks for the explanation on your usage of the 3D real transform. Unfortunately we cannot in the short term be helpful to you. However, we have demand for this feature from several customers and realize the importance of completing this feature.

Bruce

0 Kudos
Reply