Optimization of block size for CBFM in MoM

Keisuke Konno, Qiang Chen, Kunio Sawaya, Toshihiro Sezai

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)


The optimum number of blocks of the CBFM is derived theoretically and demonstrated numerically. The minimum order of CPU time for the CBFM is shown to be $O(N^{7/3})$ where $N$ is the number of unknowns. In addition, the optimum size of overlapping region of the blocks also is investigated numerically.

Original languageEnglish
Article number6236062
Pages (from-to)4719-4724
Number of pages6
JournalIEEE Transactions on Antennas and Propagation
Issue number10
Publication statusPublished - 2012


  • Characteristic basis function method
  • method of moments

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimization of block size for CBFM in MoM'. Together they form a unique fingerprint.

Cite this