Quantitative evaluation for computational cost of CG-FMM on typical wiregrid models

Keisuke Koxno, Qiang Chen, Kunio Sawaya

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

The conjugate gradient-fast multipole method (CG-FMM) is one of the powerful methods for analysis of large-scale electromagnetic problems. It is also known that CPU time and computer memory can be reduced by CG-FMM but such computational cost of CG-FMM depends on shape and electrical properties of an analysis model. In this paper, relation between the number of multipoles and number of segments in each group is derived from dimension of segment arrangement in four typical wiregrid models. Based on the relation and numerical results for these typical models, the CPU time per iteration and computer memory are quantitatively discussed. In addition, the number of iteration steps, which is related to condition number of impedance matrix and analysis model, is also considered from, a physical point of view.

Original languageEnglish
Pages (from-to)2611-2618
Number of pages8
JournalIEICE Transactions on Communications
VolumeE93-B
Issue number10
DOIs
Publication statusPublished - 2010 Oct

Keywords

  • Conjugate gradient
  • Fast multipole method
  • Method of moments (MoM)

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Quantitative evaluation for computational cost of CG-FMM on typical wiregrid models'. Together they form a unique fingerprint.

Cite this