Multiple Scattering Study Using Supercomputers.
Final rept. Oct 91-Dec 94,
ILLINOIS UNIV AT URBANA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
Pagination or Media Count:
This report summarizes our study of multiple scattering using supercomputers. Our emphasis has been on using fast algorithms to solve such a class of problem so that the memory requirements and computational complexity are reduced compared to conventional methods. We have developed several algorithms to achieve this end. These include nested equivalence principle algorithm NEPAL, SCG-FFT algorithm, BCG-FFT T-matrix algorithm, the multilevel fast multipole algorithm MLFMA and the fast far field approximation algorithm FAFFA. All these algorithms account for multiple scattering effect within a volumetric scatterer or a surface scatterer with reduced computational complexity and memory requirements. Using BCG-FFT T-matrix algorithm, we have solve multiple scattering problem involving 10,000 particles on a SUN SPARC 10 workstation. AN
- Radiofrequency Wave Propagation