Related Experiment Video
Updated: Jun 20, 2026

The Generation of Higher-order Laguerre-Gauss Optical Beams for High-precision Interferometry
Published on: August 12, 2013
AUTOMATIC GENERATION OF FFT FOR TRANSLATIONS OF MULTIPOLE EXPANSIONS IN SPHERICAL HARMONICS
Jakub Kurzak1, Dragan Mirkovic, B Montgomery Pettitt
1DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, UNIVERSITY OF TENNESSEE, KNOXVILLE, TENNESSEE 37996 ( KURZAK@EECS.UTK.EDU ).
Abstract:
The fast multipole method (FMM) is an efficient algorithm for calculating electrostatic interactions in molecular simulations and a promising alternative to Ewald summation methods. Translation of multipole expansion in spherical harmonics is the most important operation of the fast multipole method and the fast Fourier transform (FFT) acceleration of this operation is among the fastest methods of improving its performance. The technique relies on highly optimized implementation of fast Fourier transform routines for the desired expansion sizes, which need to incorporate the knowledge of symmetries and zero elements in the input arrays. Here a method is presented for automatic generation of such, highly optimized, routines.
Related Concept Videos
Exponential Fourier series
Euler's identity...
Trigonometric Fourier series
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Properties of DTFT II
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
Properties of Fourier series II
A function f(t) is...
Basic signals of Fourier Transform
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...

