Please use this identifier to cite or link to this item:
|Title:||A fast algorithm for three-dimensional electrostatics analysis: Fast Fourier Transform on Multipoles (FFTM)||Authors:||Ong, E.T.
|Keywords:||Boundary element method
Fast Fourier transform on multipoles
Fast Fourier transforms
Fast multipole method
|Issue Date:||7-Oct-2004||Citation:||Ong, E.T., Lee, K.H., Lim, K.M. (2004-10-07). A fast algorithm for three-dimensional electrostatics analysis: Fast Fourier Transform on Multipoles (FFTM). International Journal for Numerical Methods in Engineering 61 (5) : 633-656. ScholarBank@NUS Repository. https://doi.org/10.1002/nme.1081||Abstract:||In this paper, we propose a new fast algorithm for solving large problems using the boundary element method (BEM). Like the fast multipole method (FMM), the speed-up in the solution of the BEM arises from the rapid evaluations of the dense matrix-vector products required in iterative solution methods. This fast algorithm, which we refer to as fast Fourier transform on multipoles (FFTM), uses the fast Fourier transform (FFT) to rapidly evaluate the discrete convolutions in potential calculations via multipole expansions. It is demonstrated that FFTM is an accurate method, and is generally more accurate than FMM for a given order of multipole expansion (up to the second order). It is also shown that the algorithm has approximately linear growth in the computational complexity, implying that FFTM is as efficient as FMM. © 2004 John Wiley and Sons, Ltd.||Source Title:||International Journal for Numerical Methods in Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/54123||ISSN:||00295981||DOI:||10.1002/nme.1081|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 18, 2019
WEB OF SCIENCETM
checked on Jun 11, 2019
checked on May 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.