Abstract
Fourier transform of discontinuous functions are often encountered in computational electromagnetics and other areas. In this work, a highly accurate, fast conformal Fourier transform (CFT) algorithm is proposed to evaluate the finite Fourier transform of 3D discontinuous functions. A curved tetrahedron mesh combined with curvilinear coordinate transform, instead of the Cartesian grid, is adopted to flexibly model an arbitrary shape of the discontinuity boundary. This enables us to take full advantages of high order interpolation and Gaussian quadrature methods to achieve highly accurate Fourier integration results with a low sampling density. The 3D nonuniform fast Fourier transform (NUFFT) helps to keep the complexity of the proposed algorithm to that similar to the traditional 3D FFT algorithm. Therefore, the proposed CFT algorithm can achieve order of magnitude higher accuracy than 3D FFT with lower sampling density and similar computation time. The convergence is proved and verified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
