IEICE TRANSACTIONS on Communications
Fast Algorithm for Solving Matrix Equation in MoM Analysis of Large-Scale Array Antennas
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E85-B No.11 pp.2482-2488
- Publication Date
- 2002/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Antenna and Propagation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Qiang CHEN, Qiaowei YUAN, Kunio SAWAYA, "Fast Algorithm for Solving Matrix Equation in MoM Analysis of Large-Scale Array Antennas" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 11, pp. 2482-2488, November 2002, doi: .
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_11_2482/_p
Copy
@ARTICLE{e85-b_11_2482,
author={Qiang CHEN, Qiaowei YUAN, Kunio SAWAYA, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Algorithm for Solving Matrix Equation in MoM Analysis of Large-Scale Array Antennas},
year={2002},
volume={E85-B},
number={11},
pages={2482-2488},
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.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Fast Algorithm for Solving Matrix Equation in MoM Analysis of Large-Scale Array Antennas
T2 - IEICE TRANSACTIONS on Communications
SP - 2482
EP - 2488
AU - Qiang CHEN
AU - Qiaowei YUAN
AU - Kunio SAWAYA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2002
AB - 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.
ER -
English
