[天线]Fast Dual-MGS Block-Factorization Algorithm for Dense MoM Matrices

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 52, NO. 7, JULY 2004 1693 ;3&HZq6Z (  
Fast Dual-MGS Block-Factorization Algorithm for rLE5fl5W  
Dense MoM Matrices $H"(]>~  
Robert J. Burkholder, Senior Member, IEEE, and Jin-Fa Lee, Member, IEEE T:g=P@  
Abstract—A robust method is introduced for efficiently compressing cd.|>  
dense method of moments (MoM) matrices using a dual *n_7~ZX  
modified Gram–Schmidt block- -factorization algorithm based &+")~2 +  
on low-rank singular value decomposition. The compression is T7Qw1k  
achieved without generating the full matrix or even full subblocks b,lIndj#  
of the matrix. The compressed matrix may then be used in the }{F1Cr  
iterative solution of the MoM problem. The method is very robust CD pLV:  
because it uses a reduced set of the original matrix entries to h@+(VQ  
perform the compression. Furthermore, it does not depend on Gg3< }(  
the analytic form of the Green’s function, so it may be applied to vt(cC))  
arbitrarily complex media. "$U!1  
Index Terms—Singular value decomposition (SVD .. /JQY_>@W  
p9gX$-!pbG  

未注册仅能浏览部分内容，查看全部内容及附件请先 登录 或 注册