Cart (Loading....) | Create Account
Close category search window
 

A single-level low rank IE-QR algorithm for PEC scattering problems using EFIE formulation

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

2 Author(s)
Seung Mo Seo ; Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH, USA ; Lee, J.-F.

This paper presents a single-level matrix compression algorithm, termed IE-QR, based on a low-rank approximation to speed up the electric field integral equation (EFIE) formulation. It is shown, with the number of groups chosen to be proportional to N12/, where N is the number of unknowns, the memory and CPU time for the resulting algorithm are both O(N1.5). The unique features of the algorithm are: a. The IE-QR algorithm is based on the near-rank-deficiency property for well-separated groups. This near-rank-deficiency assumption holds true for many integral equation methods such as Laplacian, radiation, and scattering problems in electromagnetics (EM). The same algorithm can be adapted to other applications outside EM with few or no modifications; and, b. The rank estimation is achieved by a dual-rank process, which ranks the transmitting and receiving groups, respectively. Thus, the IE-QR algorithm can achieve matrix compression without assembling the entire system matrix. Also, a "geometric-neighboring" preconditioner is presented in this paper. This "geometric-neighboring" preconditioner when used in conjunction with GMRES is proven to be both efficient and effective for solving the compressed matrix equations.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:52 ,  Issue: 8 )

Date of Publication:

Aug. 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.