Abstract
The multilevel fast multipole algorithm (MLFMA) is an algorithm employed to speed up the matrix-vector multiplication required to solve equations using an iterative method. In this algorithm, the Green's function is approximated by an expression that separates the receiver point from the source point. Each problem has a unique Green's function, which means derivations are required to get the approximation. As a result, although the algorithm is the same for all problems, each problem requires a new code. To solve these issues, the MLFMA is executed by approximating the Green's function using a Fourier series. The proposed approach is to finding the approximation is straightforward. In addition, the code will always be the same regardless of the problem. In this study, electromagnetic wave scattering from two- and three-dimensional perfect electric conductor surfaces was solved using the proposed approach, the conventional approach, and the method of moments. The results revealed that the suggested method is precise and faster compared to the method of moments and slightly slower than the MLFMA for a large number of unknowns.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call