Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays
Ertürk, V. B.
IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
156 - 159
Item Usage Stats
MetadataShow full item record
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.
Convergence of numerical methods
Discrete Fourier transforms
Electromagnetic wave scattering
Method of moments
Biconjugate gradient method
Fast multiple method
Antenna phased arrays
Published Version (Please cite this version)https://doi.org/10.1109/APS.2002.1018179
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 ...
Integral equation based method for the fast analysis of irregularly contoured large finite phased arrays Ertürk, V. B.; Çivi, Ö. A. (2007)A fast and accurate integral equation based hybrid method that can investigate electrically large, arbitrarily contoured finite planar arrays of printed elements is developed. The method is a hybridization of the Galerkin ...