DocumentCode :
3190888
Title :
Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
Author :
Gurel, L. ; Weng Cho Chew
Author_Institution :
Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey
Volume :
4
fYear :
1998
fDate :
21-26 June 1998
Firstpage :
1842
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.
Keywords :
antenna theory; matrix algebra; microstrip antenna arrays; planar antenna arrays; fast direct noniterative algorithms; fast noniterative steepest descent path algorithm; planar patch geometries; quasi-planar patch geometries; recursive T-matrix algorithms; steepest descent path formulation; Geometry; Iterative algorithms; Microstrip; Nonhomogeneous media; Resonance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Antennas and Propagation Society International Symposium, 1998. IEEE
Conference_Location :
Atlanta, GA, USA
Print_ISBN :
0-7803-4478-2
Type :
conf
DOI :
10.1109/APS.1998.701561
Filename :
701561
Link To Document :
بازگشت