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

A fast integral-equation solver for electromagnetic scattering problems

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)
Bleszynski, E. ; North American Aircraft, Rockwell Int. Corp., Los Angeles, CA, USA ; Bleszynski, M. ; Jaroszewicz, T.

We describe a new fast integral-equation solver applicable to large-scale electromagnetic scattering problems. In our approach, the field generated by a given current distribution M decomposed into near and far field components. The near field is computed using the conventional method of moments technique with the Galerkin discretization. The far field is calculated by approximating the original current distribution by an equivalent current distribution on a regular Cartesian grid, such that the two currents have identical multipole moments up to a required order m. As the result of this discretization, the original full impedance matrix is decomposed into a sum of a sparse matrix (corresponding to the near field component) and a product of sparse and Toeplitz matrices (corresponding to the far field component). Because of the convolution nature of the Toeplitz kernel, the field generated by the equivalent current distribution can be then obtained by means of discrete fast Fourier transforms. The single computational domain solver based on our formulation requires both memory and computation time of order O(N log N) (in volume problems) or O(N/sup 3/2/) (in surface problems), where N is the number of unknown current elements. In the domain-decomposed parallelized version of the solver, with the number P of processors equal to the number of domains, the total memory required in surface problems is reduced to O(N/sup 3/2//P/sup 1/2/). The corresponding speedup factor is equal to the number of processors P. During the talk, applications of the solver to 2- and 3-dimensional electromagnetic volumetric and boundary-value problems will be presented.<>

Published in:

Antennas and Propagation Society International Symposium, 1994. AP-S. Digest  (Volume:1 )

Date of Conference:

20-24 June 1994

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.