Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries
buir.contributor.author | Gürel, Levent | |
dc.citation.epage | 67 | en_US |
dc.citation.spage | 64 | en_US |
dc.contributor.author | Gürel, Levent | en_US |
dc.contributor.author | Chew, W. C. | en_US |
dc.coverage.spatial | Montreal, Quebec, Canada | en_US |
dc.date.accessioned | 2016-02-08T12:00:03Z | en_US |
dc.date.available | 2016-02-08T12:00:03Z | en_US |
dc.date.issued | 1997 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 13-18 July 1997 | en_US |
dc.description | Conference Name: Antennas and Propagation Society International Symposium, IEEE 1997 | en_US |
dc.description.abstract | A 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.description.provenance | Made available in DSpace on 2016-02-08T12:00:03Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1997 | en |
dc.identifier.doi | 10.1109/APS.1997.630087 | en_US |
dc.identifier.issn | 0272-4693 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27712 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | https://doi.org/10.1109/APS.1997.630087 | en_US |
dc.source.title | Proceedings of the Antennas and Propagation Society International Symposium, IEEE 1997 | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Electromagnetic field theory | en_US |
dc.subject | Green's function | en_US |
dc.subject | Integration | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Vectors | en_US |
dc.subject | Fast direct algorithms (FDA) | en_US |
dc.subject | Steepest descent path (SDP) | en_US |
dc.subject | Electromagnetic wave scattering | en_US |
dc.title | Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries.pdf
- Size:
- 240.88 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version