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

被引：0

作者：

Chen, Qiang ^{[1
]}

Yuan, Qiaowei ^{[2
]}

Sawaya, Kunio ^{[1
]}

机构：

[1] Dept. of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai-shi 980-8579, Japan

[2] Sendai R and D Center, Oi Electric Co., Ltd., Sendai-shi 981-3206, Japan

来源：

| 2002年 / Institute of Electronics, Information and Communication, Engineers, IEICE卷 / E85-B期

关键词：

Algorithms - Iterative methods - Matrix algebra - Method of moments - Mobile telecommunication systems;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用