کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
522432 867828 2007 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Adaptive spatial decomposition in fast multipole method
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Adaptive spatial decomposition in fast multipole method
چکیده انگلیسی

This work presents a new adaptive node-cluster algorithm for fast multipole method. In the algorithm, we use rectangular boxes instead of cubes, subdivide a box based on its shape, and tighten the child boxes at each subdivision step. More importantly, we determine the number of expansion terms in multipole to local translations according to the distance between the two interaction boxes. Our method is tested using benchmark examples for three-dimensional potential problems. The results obtained show that the new algorithm can solve a problem with 100 thousands nodes in about 20 min, and runs nearly three times faster than the standard algorithm. The proposed algorithm is especially suitable for treating slender and shell-like structures.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational Physics - Volume 226, Issue 1, 10 September 2007, Pages 17–28
نویسندگان
, ,