DocumentCode :
953658
Title :
A clustering algorithm for multilevel fast multipole methods
Author :
Barakat, K. ; Webb, J.P.
Author_Institution :
Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, Que., Canada
Volume :
40
Issue :
2
fYear :
2004
fDate :
3/1/2004 12:00:00 AM
Firstpage :
1072
Lastpage :
1075
Abstract :
The multilevel fast multipole method (MLFMM) speeds up the matrix-vector multiplication in the iterative solution of the matrix equation arising in the boundary-element method. It makes use of a spatial hierarchy of the elements; elements are arranged into groups, and those groups are arranged into higher level groups, and so on. Ideally, the groups should be widely separated clusters. If the clustering is not adequate, the MLFMM may perform no better than direct matrix-vector multiplication. An efficient clustering algorithm is proposed. It is applied to scattering of electromagnetic waves from buildings at cell-phone frequencies.
Keywords :
boundary-elements methods; electromagnetic wave scattering; matrix multiplication; boundary-element method; cellphone frequencies; clustering algorithm; electromagnetic wave scattering; iterative solution; matrix equation; matrix-vector multiplication; multilevel fast multipole method; Clustering algorithms; Computational efficiency; Costs; Electromagnetic fields; Electromagnetic scattering; Equations; Frequency; Helium; Iterative algorithms; Iterative methods;
fLanguage :
English
Journal_Title :
Magnetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9464
Type :
jour
DOI :
10.1109/TMAG.2004.824893
Filename :
1284603
Link To Document :
بازگشت