Premium
Efficient matrix filling of multilevel simply sparse method via multilevel fast multipole algorithm
Author(s) -
Jiang Zhaoneng,
Xu Yuan,
Chen Rushan,
Fan Zhenhong,
Ding Dazhi
Publication year - 2011
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/2010rs004549
Subject(s) - multipole expansion , matrix (chemical analysis) , sparse matrix , algorithm , field (mathematics) , fast multipole method , computer science , multiplication (music) , mathematics , physics , materials science , quantum mechanics , combinatorics , pure mathematics , composite material , gaussian
In this paper, an improved multilevel simply sparse method (MLSSM) is proposed for solving electromagnetic scattering problems that are formulated using the electric field integral equation approach. Previously, the matrix filling procedure of the conventional MLSSM is based on the adaptive cross approximation (ACA) method. Although the ACA is more efficient than direct filling, it requires a longer filling time for the far‐field matrix than that of the multilevel fast multipole algorithm (MLFMA). Three problems with moderate electrical sizes are used to demonstrate that the far‐field matrix filling memory of the ACA is also higher than that of the MLFMA. Hence, the MLFMA is utilized to reduce both the far‐field matrix filling time and memory of the conventional MLSSM. Since the MLSSM recompresses the far‐field interaction matrix of the MLFMA, the matrix‐vector multiplication of the proposed method is more efficient than that of the MLFMA. Numerical results are presented to demonstrate the accuracy and efficiency of the proposed method.