FFT-Based Method With Near-Matrix Compression

In this paper, a novel grouping scheme of the basis functions within the framework of the fast Fourier transform (FFT)-based method is proposed for creating a block-sparse structure for the near-matrix, and then FFT-based method with near-matrix compression is established for the efficient analysis...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on antennas and propagation Vol. 65; no. 11; pp. 5975 - 5983
Main Authors Kong, Wei-Bin, Zhou, Hou-Xing, Zheng, Kai-Lai, Mu, Xing, Hong, Wei
Format Journal Article
LanguageEnglish
Published IEEE 01.11.2017
Subjects
Adaptive cross approximation (ACA)
Antennas
Electric breakdown
electromagnetic scattering
fast Fourier transform (FFT)-based method
fitting Green’s function (FG)-FFT
Green's function methods
interpolative decomposition (ID)
matrix compression
Memory management
Method of moments
method of moments (MoM)
multiscale problem
precorrected FFT (P-FFT)
Scattering
Surface waves
Online AccessGet full text

Cover

More Information
Summary:In this paper, a novel grouping scheme of the basis functions within the framework of the fast Fourier transform (FFT)-based method is proposed for creating a block-sparse structure for the near-matrix, and then FFT-based method with near-matrix compression is established for the efficient analysis of multiscale problems. For a multiscale problem, if an FFT-based method is required to maintain both higher efficiency and higher accuracy at calculating the far interactions, then the near-matrix will be inevitably very large. Compared with the traditional FFT-based method, the proposed method can significantly reduce the near-matrix memory requirement without increasing the time spent. Several numerical examples are provided to demonstrate the correctness and the efficiency of the proposed method.
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2017.2754398