Computational and Memory Complexities of Greengard-Rokhlin's Fast Multipole Algorithm(Electromagnetic Theory)
スポンサーリンク
概要
- 論文の詳細を見る
This paper describes an estimation of the computational and memory complexities of Greengard-Rokhlin's Fast Multipole Algorithm (GRFMA). GRFMA takes a quad tree structure and six calculation processes. We consider a perfect α-ary tree structure and the number of floating-point operations for each calculation process. The estimation for both complexities shows that the perfect quad tree is the best and the perfect binary tree is the worst. When we apply GRFMA to the computation of realistic problems, volume scattering are the best case and surface scattering are the worst case. In the worst case, the computational and memory complexities of GRFMA are O(L log^2 L) and O(L log L), respectively. The computational complexity of GRFMA is higher than that of the multilevel fast multipole algorithm.
- 社団法人電子情報通信学会の論文
- 2005-07-01
著者
-
Tateiba Mitsuo
Ariake National Coll. Of Technol. Omuta‐shi Jpn
-
Tateiba Mitsuo
Department Of Computer Science And Communication Engineering Graduate School Of Information Science
-
NAKASHIMA Norimasa
Department of Computer Science and Communication Engineering, Kyushu University
-
Nakashima Norimasa
Fac. Of Isee Kyushu Univ.
-
Nakashima Norimasa
Department Of Computer Science And Communication Engineering Kyushu University
関連論文
- Level Crossing Rate and Average Fade Duration Analysis in Ku-band Satellite Link(System Engineering-I)
- Scattering by Conducting Bodies in Random Media
- FVTD Simulation for Random Rough Dielectric Surface Scattering at Low Grazing Angle(Special Issue on Problems of Random Scattering and Electromagnetic Wave Sensing)
- Numerical Analysis of Bastatic Cross-Sections of Conducting Circular Cylinders Embedded in Continuous Random Media(Special Issue on Problems of Random Scattering and Electromagnetic Wave Sensing)
- Empirical study on mobile satellite link using portable GPS receiver(Advanced Technology-I)
- Theoretical Study on Wave Propagation and Scattering in Random Media and Its Application
- A Comparative Study on Iterative Progressive Numerical Methods for Boundary Element Analysis of Electromagnetic Multiple Scattering
- An Activity Report on Electromagnetic Wave Sensing in Random Media and High Data Rate Satellite Communications, Pursued in a Research Laboratory
- Computational and Memory Complexities of Greengard-Rokhlin's Fast Multipole Algorithm(Electromagnetic Theory)
- Greengard-Rokhlin's Fast Multipole Algorithm for Numerical Calculation of Scattering by N Conducting Circular Cylinders(Analytical and Simulation Methods for Electromagnetic Wave Problems)
- Comparison of Scattered Power from a Layer with Randomly Distributed Lossy Spheres of High Dielectric Constant by Using Radiative Transfer Theory(Special Issue on Problems of Random Scattering and Electromagnetic Wave Sensing)