Application of iterative techniques for electromagnetic wave scattering from dielectric random rough surfaces
Ertürk, Vakur B.
Item Usage Stats
MetadataShow full item record
Mobile radio planning requires accurate prediction of electromagnetic field strengths over large terrain profiles. However the conventional method of moments (MoM) becomes unsuitable for electrically large rough dielectric surfaces, because of the O(N³) computational cost due to the large number of surface unknowns N. Iterative Methods are beneficial methods for faster electromagnetic problem solutions. By using such methods, very accurate results can be achieved, causing a computational cost of O(N²). In this work, among the stationary iterative methods; Forward-Backward Method (FBM), and among the nonstationary iterative ones; Conjugate Gradient Squared (CGS), BiConjugate Gradient Stabilized (Bi-CGSTAB) and Quasi Minimal Residual (QMR) Methods are presented to investigate the electromagnetic wave scattering from dielectric random rough surfaces. These techniques are compared to each other over various kinds of surface models that reflect the real terrains to find out the best solution methodologies. Furthermore, efficiency of the methods are assessed by comparing the obtained scattering results, normalized radar cross sections (NRCS) of the surfaces considered, with the numerically exact ones computed by employing the MoM.
KeywordsRandom Rough Surface Scattering
Method of Moments (MoM)
Forward-Backward Method (FBM)
Conjugate Gradient Squared Method (CGS)
BiConjugate Gradient Stabilized Method (Bi-CGSTAB)
Quasi Minimal Residual Method (QMR)
Normalized Radar Cross Section (NRCS)
Showing items related by title, author, creator and subject.
Dayar, Tuğrul (IEEE, 2009)Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation ...
Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods Özaktaş, Hakan (Bilkent University, 1998)Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is ...
Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays Ertürk, Vakur B.; Chou, H. T. (IEEE, 2002)An acceleration algorithm based on Discrete Fourier Transform (DFT) is developed to reduce the computational complexity and memory storages of iterative methods of moment (IMoM) solution to O(Ntot), where Ntot is the total ...