Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
buir.contributor.author | Gürel, Levent | |
dc.citation.epage | 1845 | en_US |
dc.citation.spage | 1842 | en_US |
dc.contributor.author | Gürel, Levent | en_US |
dc.contributor.author | Chew, W. C. | en_US |
dc.coverage.spatial | Atlanta, GA, USA | en_US |
dc.date.accessioned | 2016-02-08T11:59:15Z | en_US |
dc.date.available | 2016-02-08T11:59:15Z | en_US |
dc.date.issued | 1998 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 21-26 June 1998 | en_US |
dc.description | Conference Name: Antennas and Propagation Society International Symposium, IEEE 1998 | en_US |
dc.description.abstract | The fast noniterative steepest descent path (SDP) algorithm for planar and quasi-planar patch geometries are discussed. The comparison of scattered fields as computed by the method of moments (MOM) and fast direct algorithm (FDA)/SDP are described. The solution times of FDA/SDP, MOM, and recursive aggregate-T-matrix algorithm (RATMA) are obtained by solving the scattering problems of increasingly larger planar arrays of patches without taking advantage of the periodicities and the symmetries of these arrays. | en_US |
dc.identifier.doi | 10.1109/APS.1998.701561 | en_US |
dc.identifier.issn | 0272-4693 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27672 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/APS.1998.701561 | en_US |
dc.source.title | Proceedings of the Antennas and Propagation Society International Symposium, IEEE 1998 | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Electromagnetic wave scattering | en_US |
dc.subject | Matrix algebra | en_US |
dc.subject | Method of moments | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Fast direct algorithm (FDA) | en_US |
dc.subject | Recursive aggregate-T-matrix algorithm (RATMA) | en_US |
dc.subject | Steepest descent path (SDP) | en_US |
dc.subject | Antenna arrays | en_US |
dc.title | Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries.pdf
- Size:
- 210.55 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version