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

L. Gürel, Weng Cho Chew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The motivation in developing fast direct noniterative algorithms is first considered. The combination of the recursive T-matrix algorithms and the steepest descent path formulation is then discussed.

Original languageEnglish (US)
Title of host publicationIEEE Antennas and Propagation Society International Symposium, 1998 Digest - Antennas
Subtitle of host publicationGateways to the Global Network - Held in conjunction with: USNC/URSI National Radio Science Meeting
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1842-1845
Number of pages4
ISBN (Print)0780344782, 9780780344785
DOIs
StatePublished - 1998
Event1998 IEEE Antennas and Propagation Society International Symposium, APSURSI 1998 - Atlanta, United States
Duration: Jun 21 1998Jun 26 1998

Publication series

NameIEEE Antennas and Propagation Society International Symposium, 1998 Digest - Antennas: Gateways to the Global Network - Held in conjunction with: USNC/URSI National Radio Science Meeting
Volume4

Other

Other1998 IEEE Antennas and Propagation Society International Symposium, APSURSI 1998
CountryUnited States
CityAtlanta
Period6/21/986/26/98

ASJC Scopus subject areas

  • Instrumentation
  • Radiation
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries'. Together they form a unique fingerprint.

Cite this