Premium
Adaptive grouping for the higher‐order multilevel fast multipole method
Author(s) -
Borries Oscar,
Jørgensen Erik,
Meincke Peter,
Hansen Per Christian
Publication year - 2014
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.28611
Subject(s) - multipole expansion , polygon mesh , basis (linear algebra) , basis function , octree , reduction (mathematics) , fast multipole method , algorithm , computer science , microwave , function (biology) , order (exchange) , computational science , mathematics , physics , geometry , mathematical analysis , telecommunications , computer graphics (images) , finance , quantum mechanics , evolutionary biology , economics , biology
An alternative parameter‐free adaptive approach for the grouping of the basis function patterns in the multilevel fast multipole method is presented, yielding significant memory savings compared to the traditional Octree grouping for most discretizations, particularly when using higher‐order basis functions. Results from both a uniformly and nonuniformly meshed scatterer are presented, showing how the technique is worthwhile even for regular meshes, and demonstrating that there is no loss of accuracy in spite of the large reduction in memory requirements and the relatively low computational cost. © 2014 Wiley Periodicals, Inc. Microwave Opt Technol Lett 56:2451–2456, 2014