Open AccessStaggered Grid Scheme for the FFT‐Based Methods
Author(s) -
Xie Jiaye,
Kong Weibin,
Pang Lili,
Song Weiju,
Huang Zhixiang,
Wu Xianliang
Publication year - 2019
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2019.06.002
Subject(s) - correctness , grid , cartesian coordinate system , scheme (mathematics) , computer science , matrix (chemical analysis) , regular grid , fast fourier transform , field (mathematics) , computational science , algorithm , parallel computing , mathematics , geometry , mathematical analysis , materials science , pure mathematics , composite material
A staggered grid scheme is proposed to reduce both the total memory requirement and the CPU time of generating the corrected near matrix in the FFTbased methods. Two sets of Cartesian grids are used to project the source points and the field points, respectively. The proposed method does not lower the efficiency of computing far matrix‐vector products, compared with the traditional uniform Cartesian grid scheme. Some numerical experiments are provided to demonstrate both the correctness and the efficiency of the proposed method.