Extension of forward-backward method with DFT-based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries
dc.citation.epage | 298 | en_US |
dc.citation.issueNumber | 3 | en_US |
dc.citation.spage | 293 | en_US |
dc.citation.volumeNumber | 47 | en_US |
dc.contributor.author | Civi, Ö. A. | en_US |
dc.contributor.author | Ertürk, V. B. | en_US |
dc.contributor.author | Chou, H.-T. | en_US |
dc.date.accessioned | 2016-02-08T10:22:01Z | |
dc.date.available | 2016-02-08T10:22:01Z | |
dc.date.issued | 2005 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.abstract | An extension of the discrete Fourier transform (DFT)-based forward-backward algorithm is developed using the virtual-element approach to provide a fast and accurate analysis of electromagnetic radiation/scattering from electrically large, planar, periodic, finite (phased) arrays with arbitrary boundaries. Both the computational complexity and storage requirements of this approach are O(Ntot) (Ntot is the total number of unknowns). The numerical results for both printed and freestanding dipole arrays with circular and/or elliptical boundaries are presented to validate the efficiency and accuracy of this approach. | en_US |
dc.identifier.doi | 10.1002/mop.21150 | en_US |
dc.identifier.issn | 0895-2477 | |
dc.identifier.uri | http://hdl.handle.net/11693/23962 | |
dc.language.iso | English | en_US |
dc.publisher | John Wiley & Sons | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1002/mop.21150 | en_US |
dc.source.title | Microwave and Optical Technology Letters | en_US |
dc.subject | Discrete fourier transform | en_US |
dc.subject | Iterative solvers | en_US |
dc.subject | Method of moments | en_US |
dc.subject | Phased arrays | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Electromagnetism | en_US |
dc.subject | Numerical analysis | en_US |
dc.subject | Radiation effects | en_US |
dc.title | Extension of forward-backward method with DFT-based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Extension of forward-backward method with DFT-based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries.pdf
- Size:
- 466.91 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version