Accurate evaluation of modal green’s function and its gradient for electromagnetic scattering by body of revolution

Author(s):  
M. S. Tong ◽  
W. C. Chew
2018 ◽  
pp. 197-250
Author(s):  
Andrei V. Lavrinenko ◽  
Jesper Lægsgaard ◽  
Niels Gregersen ◽  
Frank Schmidt ◽  
Thomas Søndergaard

2014 ◽  
Vol 989-994 ◽  
pp. 3777-3781
Author(s):  
Lin Li ◽  
Wen Chao Zheng

In this paper, an improved complex image method to derive closed form periodic Green’s function for problem of scattering from perfectly conducting periodic surfaces is considered. The complex image technique represents a close-form periodic Green’s function consisting of a finite series of real sources and two finite series of complex sources with complex locations and amplitudes. Then the integral equation with the complex images periodic Green’s function in the kernel is solved by the method of moments. Results and computational times obtained by this improved complex image method and the previous one are compared with those obtained by the spectral Kummer-Poisson’s method. Results show that the improved complex image method is more accurately than the previous one.


Author(s):  
Seung Mo Seo

Abstract An integral equation-fast Fourier transform (IE-FFT) algorithm is applied to the electromagnetic solutions of the combined field integral equation (CFIE) for scattering problems by an arbitrary-shaped three-dimensional perfect electric conducting object. The IE-FFT with CFIE uses a Cartesian grid for known Green's function to considerably reduce memory storage and speed up CPU time for both matrix fill-in and matrix vector multiplication when used with a generalized minimal residual method. The uniform interpolation of the Green's function on an equally spaced Cartesian grid allows a global FFT for field interaction terms. However, the near interaction terms do not take care for the singularity of the Green's function and should be adequately corrected. The IE-FFT with CFIE does not always require a suitable preconditioner for electrically large problems. It is shown that the complexity of the IE-FFT with CFIE is found to be approximately O(N1.5) and O(N1.5log N) for memory and CPU time, respectively.


Sign in / Sign up

Export Citation Format

Share Document