Fast algorithm for solving matrix equation in MoM analysis of large-scale array antennas

Qiang Chen, Qiaowei Yuan, Kunio Sawaya

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A new iterative algorithm based on the Gauss-Seidel iteration method is proposed to solve the matrix equation in the MoM analysis of the array antennas. In the new algorithm, the impedance matrix is decomposed into a number of sub matrices, which describe the self and mutual impedance between the groups of the array, and each sub matrix is regarded as a basic iteration unit rather than the matrix element in the ordinary Gauss-Seidel iteration method. It is found that the convergence condition of the ordinary Gauss-Seidel iteration scheme is very strict for the practical use, while the convergence characteristics of the present algorithm are greatly improved. The new algorithm can be applied to the sub domain MoM with a fast convergence if the grouping technique is properly used. The computation time for solving the matrix equation is reduced to be almost proportional to the square of the number of the array elements. The present method is effective in MoM analysis of solving large-scale array antennas.

Original languageEnglish
Pages (from-to)2482-2488
Number of pages7
JournalIEICE Transactions on Communications
VolumeE85-B
Issue number11
Publication statusPublished - 2002 Nov

Keywords

  • Antenna
  • Antenna array
  • Iterative method
  • Matrix equation
  • Moment method

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Fast algorithm for solving matrix equation in MoM analysis of large-scale array antennas'. Together they form a unique fingerprint.

  • Cite this