Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays
IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
156 - 159
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27569
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 number of elements in the array. As such, numerical results for free-standing dipoles obtained using IMoM-DFT approach are presented and compared with the conventional MoM solution.
Showing items related by title, author, creator and subject.
Dayar, T. (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 ...
Closed-form Green's function representations in cylindrically stratified media for method of moments applications Karan, S.; Ertürk V.B.; Altintas, A. (2009)Closed-form Green's function (CFGF) representations for cylindrically stratified media, which can be used as the kernel of an electric field integral equation, are developed. The developed CFGF representations can safely ...