Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

Comments on "Fast direct solution of method of moments linear system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Heldring, A. ; AntennaLab, Dept. of Signal Processing and Telecommunications, Universitat Politecnica de Catalunya, Barcelona, Spain ; Rius, J.M. ; Tamayo, J.M.

In the above-named work a new algorithm is presented for direct (non-iterative) frequency domain method of moments (MoM) calculations based on block-wise compression of the impedance matrix. The storage requirements and computational complexity of the algorithm are claimed to be N3/2 and N2, respectively, if N is the number of unknowns for a MoM surface discretization that is fixed with respect to the wavelength. A more rigorous analysis, explicitly using the asymptotic expression for the number of degrees of freedom (DoF) in the interaction between groups of scatterers, is presented here, showing that this should be N3/2log N and N2log2 N, respectively. The complexity analysis applies to problems that can be formulated as a surface integral equation (SIE) on surfaces in or between homogeneous media, such as a ship or an airplane. It does not apply to volume discretization MoM or multilayer problems. The results presented here are also relevant for block-wise compression methods using iterative solvers, since the compressed impedance matrix is the same. Consequently, the above complexity analysis applies to very large problems, well beyond the reach of even the largest existent computers. For moderate size problems, the "measured" complexity is lower.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:58 ,  Issue: 3 )