File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries

TitleFast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries
Authors
Issue Date1997
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1997, v. 1, p. 64-67 How to Cite?
AbstractA non-iterative method and its application to planar geometries in homogeneous media is presented. The method is extendable to the cases of quasi-planar structures and/or layered-media problems. The fast direct algorithm (FDA)/steepest descent path (SDP) takes advantage of the fact that the induced currents on planar and quasi-planar geometries interact with each other within a very limited solid angle. Thus, all the degrees of freedom required to solve a `truly 3D' geometry are not required for a planar or quasi-planar geometry, and this situation can be exploited to develop efficient solution algorithms.
Persistent Identifierhttp://hdl.handle.net/10722/182863
ISSN

 

DC FieldValueLanguage
dc.contributor.authorGurel, Leventen_US
dc.contributor.authorChew, Weng Choen_US
dc.date.accessioned2013-05-02T05:17:23Z-
dc.date.available2013-05-02T05:17:23Z-
dc.date.issued1997en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1997, v. 1, p. 64-67en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182863-
dc.description.abstractA non-iterative method and its application to planar geometries in homogeneous media is presented. The method is extendable to the cases of quasi-planar structures and/or layered-media problems. The fast direct algorithm (FDA)/steepest descent path (SDP) takes advantage of the fact that the induced currents on planar and quasi-planar geometries interact with each other within a very limited solid angle. Thus, all the degrees of freedom required to solve a `truly 3D' geometry are not required for a planar or quasi-planar geometry, and this situation can be exploited to develop efficient solution algorithms.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleFast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar 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-0030658667en_US
dc.identifier.volume1en_US
dc.identifier.spage64en_US
dc.identifier.epage67en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridGurel, Levent=7004393069en_US
dc.identifier.scopusauthoridChew, Weng Cho=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats