Block Size Optimization of CBFM for Scattering Problems

Citations

WEB OF SCIENCE

13
Citations

SCOPUS

16

초록

The characteristic basis function method (CBFM) was developed as an algorithm to accelerate the analysis based on direct matrix solver. In CBFM, the optimum block size greatly influences the overall analysis time. In this paper, we propose a guideline for setting the optimal block size that can be applied to every algorithm based on CBFM. Rough estimation of the rough optimal block size is L-B(rough) approximate to 0.05N(6/29), and the exact optimal block size can be determined through preprocessing based on rough estimation. Numerical results of electromagnetic scattering problems are shown to demonstrate the performance of the proposed method.

키워드

Characteristic basis function method (CBFM)method of moment (MoM)optimizationsingular value decompositionNONSYMMETRIC LINEAR-SYSTEMSCONJUGATE-GRADIENT METHODFAST-MULTIPOLE ALGORITHMELECTROMAGNETIC SCATTERINGMATRIX EQUATIONSCONVERGENCEANTENNASMOM
제목
Block Size Optimization of CBFM for Scattering Problems
저자
Park, Chan-SunJeong, Yi-RuHong, Ic-PyoYook, Jong-Gwan
DOI
10.1109/TAP.2018.2860047
발행일
2018-10
유형
Article
저널명
IEEE Transactions on Antennas and Propagation
66
10
페이지
5370 ~ 5377