File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries

TitleFast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
Authors
Gurel, LeventChew, Weng Cho
Issue Date1998
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 4, p. 1842-1845 How to Cite?
AbstractThe 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.
Persistent Identifierhttp://hdl.handle.net/10722/182892
ISSN
0272-4693
2019 SCImago Journal Rankings: 0.108

 

DC FieldValueLanguage
dc.contributor.authorGurel, Leventen_US
dc.contributor.authorChew, Weng Choen_US
dc.date.accessioned2013-05-02T05:17:32Z-
dc.date.available2013-05-02T05:17:32Z-
dc.date.issued1998en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 4, p. 1842-1845en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182892-
dc.description.abstractThe 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.languageengen_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleFast noniterative steepest descent path algorithm for planar and quasi-planar patch geometriesen_US
dc.typeConference_Paperen_US
dc.identifier.emailChew, Weng Cho: wcchew@hku.hken_US
dc.identifier.authorityChew, Weng Cho=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0031622318en_US
dc.identifier.volume4en_US
dc.identifier.spage1842en_US
dc.identifier.epage1845en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridGurel, Levent=7004393069en_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US
dc.identifier.issnl0272-4693-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats