“…There exist several fast algorithms for matrix-vector multiplication that can be used to enhance the efficiency of the solution, such as fast multipole method (FMM) [7][8][9], conjugate gradient fast Fourier transform (CGFFT) [10,11], precorrected FFT (PFFT) [12], the sparse matrix/canonical grid (SMCG) method [13], adaptive integral method (AIM) [14], and MLGFIM [15,16] and so on. Among them, FMM is a fast algorithm with O(N ) complexity, CGFFT, PFFT, SMCG, and AIM are FFT based methods with O(N log N ) complexity, while MLGFIM is based on a hierarchical structure which is similar to FMM but using the Green's function matrix interpolation method with QR [17] factorization technique.…”