Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleA fast algorithm for three-dimensional potential fields calculation: Fast Fourier Transform on Multipoles
dc.contributor.authorOng, E.T.
dc.contributor.authorLim, K.M.
dc.contributor.authorLee, K.H.
dc.contributor.authorLee, H.P.
dc.identifier.citationOng, E.T., Lim, K.M., Lee, K.H., Lee, H.P. (2003-11-20). A fast algorithm for three-dimensional potential fields calculation: Fast Fourier Transform on Multipoles. Journal of Computational Physics 192 (1) : 244-261. ScholarBank@NUS Repository.
dc.description.abstractIn this paper, we present a fast algorithm for rapid calculation of the potential fields in three dimensions. This method arises from an observation that potential evaluation using the multipole to local expansion translation operator can be expressed as a series discrete convolutions of the multipole moments with their associated spherical harmonics functions. The high efficiency of the algorithm is primarily due to the use of FFT algorithms to evaluate the numerous discrete convolutions. We refer to it as the Fast Fourier Transform on Multipoles (FFTM) method. It is demonstrated that FFTM is an accurate method. It is significantly more accurate than FMM for a given order of expansion. It is also shown that the algorithm has computational complexity of O(Na), where a ranges from 1.0 to 1.3. © 2003 Elsevier B.V. All rights reserved.
dc.subjectFast Fourier transform
dc.subjectFast Fourier Transform on Multipoles
dc.subjectLaplace equation
dc.subjectMultipole translation operators
dc.contributor.departmentMECHANICAL ENGINEERING
dc.description.sourcetitleJournal of Computational Physics
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.