TY - JOUR

T1 - Iterative Analysis of Finite-Sized Planar Frequency Selective Surfaces with Rectangular Patches or Perforations

AU - Kastner, Raphael

AU - Mittra, Raj

N1 - Funding Information:
work was supported in part by R A F A E L ' S Research Program. R. Kasmer is with the Antenna Section, RAFAEL, Department 87, P.O. Box 2250, 31021 Haifa, Israel. R. Mittra is with the Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL 61801. IEEE Log Number 8613192.

PY - 1987/4

Y1 - 1987/4

N2 - Frequency selective surfaces (FSS) and other periodic gratings are often analyzed under the assumption that they are infinite in extent. Most existing methods for analyzing periodic structures are based on the use of a Floquet-type representation of the fields in a unit cell whose dimensions are typically comparable to the wavelength. In this work, a finite, truncated, version of an infinite periodic structure is dealt with directly, without the benefit of the assumption that the structure is periodic. This, in turn, requires the handling of a large number of unknowns and makes it difficult to solve the problem using conventional matrix methods. Two different iteration approaches to solving the finite FSS problem are discussed in the paper both of which employ the spectral domain formulation. The first of these employs the spectral iteration technique and the second one uses the conjugate gradient (CG) iteration algorithm. Convergence characteristics of both of these methods are investigated and the results are reported.

AB - Frequency selective surfaces (FSS) and other periodic gratings are often analyzed under the assumption that they are infinite in extent. Most existing methods for analyzing periodic structures are based on the use of a Floquet-type representation of the fields in a unit cell whose dimensions are typically comparable to the wavelength. In this work, a finite, truncated, version of an infinite periodic structure is dealt with directly, without the benefit of the assumption that the structure is periodic. This, in turn, requires the handling of a large number of unknowns and makes it difficult to solve the problem using conventional matrix methods. Two different iteration approaches to solving the finite FSS problem are discussed in the paper both of which employ the spectral domain formulation. The first of these employs the spectral iteration technique and the second one uses the conjugate gradient (CG) iteration algorithm. Convergence characteristics of both of these methods are investigated and the results are reported.

UR - http://www.scopus.com/inward/record.url?scp=0023327624&partnerID=8YFLogxK

U2 - 10.1109/TAP.1987.1144113

DO - 10.1109/TAP.1987.1144113

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0023327624

SN - 0018-926X

VL - 35

SP - 372

EP - 377

JO - IEEE Transactions on Antennas and Propagation

JF - IEEE Transactions on Antennas and Propagation

IS - 4

ER -