Loading...
Please wait, while we are loading the content...
Similar Documents
Using Fast Fourier Transform in the 3-d Multilevel Fast Multipole Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Nevanlinna, Rolf |
| Copyright Year | 2002 |
| Abstract | In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates θ and φ by trigonometric polynomials and the fast Fourier transform (FFT) in the 3-D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation and anterpolation, and has the high numerical efficiency of FFT. A numerical comparison suggests that the proposed method is equally or more efficient, depending on the desired accuracy, than the method of using spherical harmonics and polynomial interpolation in interpolation and anterpolation. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ursi.org/Proceedings/ProcGA02/papers/p0782.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |