Please use this identifier to cite or link to this item:
|Title:||A fast algorithm for three-dimensional potential fields calculation: Fast Fourier Transform on Multipoles||Authors:||Ong, E.T.
|Keywords:||Fast Fourier transform
Fast Fourier Transform on Multipoles
Multipole translation operators
|Issue Date:||20-Nov-2003||Citation:||Ong, 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. https://doi.org/10.1016/j.jcp.2003.07.004||Abstract:||In 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.||Source Title:||Journal of Computational Physics||URI:||http://scholarbank.nus.edu.sg/handle/10635/84777||ISSN:||00219991||DOI:||10.1016/j.jcp.2003.07.004|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 6, 2021
WEB OF SCIENCETM
checked on Feb 24, 2021
checked on Feb 28, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.