Fast direct solution of standard moment-method matrices

被引:23
|
作者
Canning, FX [1 ]
Rogovin, K [1 ]
机构
[1] Rockwell Int Sci Ctr, Thousand Oaks, CA 91360 USA
关键词
electromagnetic analysis; computational electromagnetics; Method of Moments; LU factorization; sparse methods; fast methods;
D O I
10.1109/74.706066
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
All of the matrices which arise in the Method-of-Moments solution of scattering and antenna problems have a hidden structure. This structure is due to the physics of electromagnetic interactions. Matrix-algebra routines are used to uncover this structure in Moment-Method matrices, after they have been calculated. This structure is used to create a sparse representation of the matrix. Although this step involves an approximation, the error involved can be nearly as small as the precision of the calculation. Then, without further approximation, a sparse representation of the LU factorization of this matrix is computed. A significant speed improvement is realized over that of the standard LU factorization of this matrix. The resulting method can be added to any of a variety of Moment-Method programs to solve the matrix problem more quickly, and with less computer memory. For large problems this is the time-critical operation, so this allows larger problems to be solved. The computer program we have written can be used immediately with most Moment-Method programs, since it amounts to simply a better matrix-inversion package. The method presented here will be referred to as the LU Sparse Integral FactorEd Representation (LUSIFER).
引用
收藏
页码:15 / 26
页数:12
相关论文
共 50 条