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

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, VOL. 52, NO. 7, JULY 2004 1693 5byeWH0n3  
Fast Dual-MGS Block-Factorization Algorithm for C@)pmSQ  
Dense MoM Matrices UG=I~{L  
Robert J. Burkholder, Senior Member, IEEE, and Jin-Fa Lee, Member, IEEE AgI>
 
Abstract—A robust method is introduced for efficiently compressing WJcVQMs  
dense method of moments (MoM) matrices using a dual '8Qw:fh  
modified Gram–Schmidt block- -factorization algorithm based %LcH>sV  
on low-rank singular value decomposition. The compression is }MjQP R  
achieved without generating the full matrix or even full subblocks 1*#bfeoM  
of the matrix. The compressed matrix may then be used in the {|p"; uJ  
iterative solution of the MoM problem. The method is very robust ,]U[W  
because it uses a reduced set of the original matrix entries to h+xA?[c=  
perform the compression. Furthermore, it does not depend on o#d
cD?^  
the analytic form of the Green’s function, so it may be applied to 7%tR&F -u  
arbitrarily complex media. 0&B:\  
Index Terms—Singular value decomposition (SVD .. {0fz9"|U  
:Fo4O'UC  

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