skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A Fast MoM Solver (GIFFT) for Large Arrays of Microstrip and Cavity-Backed Antennas

Abstract

A straightforward numerical analysis of large arrays of arbitrary contour (and possibly missing elements) requires large memory storage and long computation times. Several techniques are currently under development to reduce this cost. One such technique is the GIFFT (Green's function interpolation and FFT) method discussed here that belongs to the class of fast solvers for large structures. This method uses a modification of the standard AIM approach [1] that takes into account the reusability properties of matrices that arise from identical array elements. If the array consists of planar conducting bodies, the array elements are meshed using standard subdomain basis functions, such as the RWG basis. The Green's function is then projected onto a sparse regular grid of separable interpolating polynomials. This grid can then be used in a 2D or 3D FFT to accelerate the matrix-vector product used in an iterative solver [2]. The method has been proven to greatly reduce solve time by speeding up the matrix-vector product computation. The GIFFT approach also reduces fill time and memory requirements, since only the near element interactions need to be calculated exactly. The present work extends GIFFT to layered material Green's functions and multiregion interactions via slots in ground planes.more » In addition, a preconditioner is implemented to greatly reduce the number of iterations required for a solution. The general scheme of the GIFFT method is reported in [2]; this contribution is limited to presenting new results for array antennas made of slot-excited patches and cavity-backed patch antennas.« less

Authors:
; ;
Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
15017390
Report Number(s):
UCRL-CONF-209381
TRN: US200517%%420
DOE Contract Number:  
W-7405-ENG-48
Resource Type:
Conference
Resource Relation:
Journal Volume: 2B; Conference: Presented at: IEEE AP-S International Symposium and USNC/URSI National Radio Science Meeting, Washington, DC, United States, Jul 03 - Jul 08, 2005
Country of Publication:
United States
Language:
English
Subject:
42 ENGINEERING; ANTENNAS; INTERPOLATION; MATRICES; MODIFICATIONS; NUMERICAL ANALYSIS; POLYNOMIALS; STORAGE

Citation Formats

Fasenfest, B J, Capolino, F, and Wilton, D. A Fast MoM Solver (GIFFT) for Large Arrays of Microstrip and Cavity-Backed Antennas. United States: N. p., 2005. Web. doi:10.1109/APS.2005.1551920.
Fasenfest, B J, Capolino, F, & Wilton, D. A Fast MoM Solver (GIFFT) for Large Arrays of Microstrip and Cavity-Backed Antennas. United States. https://doi.org/10.1109/APS.2005.1551920
Fasenfest, B J, Capolino, F, and Wilton, D. 2005. "A Fast MoM Solver (GIFFT) for Large Arrays of Microstrip and Cavity-Backed Antennas". United States. https://doi.org/10.1109/APS.2005.1551920. https://www.osti.gov/servlets/purl/15017390.
@article{osti_15017390,
title = {A Fast MoM Solver (GIFFT) for Large Arrays of Microstrip and Cavity-Backed Antennas},
author = {Fasenfest, B J and Capolino, F and Wilton, D},
abstractNote = {A straightforward numerical analysis of large arrays of arbitrary contour (and possibly missing elements) requires large memory storage and long computation times. Several techniques are currently under development to reduce this cost. One such technique is the GIFFT (Green's function interpolation and FFT) method discussed here that belongs to the class of fast solvers for large structures. This method uses a modification of the standard AIM approach [1] that takes into account the reusability properties of matrices that arise from identical array elements. If the array consists of planar conducting bodies, the array elements are meshed using standard subdomain basis functions, such as the RWG basis. The Green's function is then projected onto a sparse regular grid of separable interpolating polynomials. This grid can then be used in a 2D or 3D FFT to accelerate the matrix-vector product used in an iterative solver [2]. The method has been proven to greatly reduce solve time by speeding up the matrix-vector product computation. The GIFFT approach also reduces fill time and memory requirements, since only the near element interactions need to be calculated exactly. The present work extends GIFFT to layered material Green's functions and multiregion interactions via slots in ground planes. In addition, a preconditioner is implemented to greatly reduce the number of iterations required for a solution. The general scheme of the GIFFT method is reported in [2]; this contribution is limited to presenting new results for array antennas made of slot-excited patches and cavity-backed patch antennas.},
doi = {10.1109/APS.2005.1551920},
url = {https://www.osti.gov/biblio/15017390}, journal = {},
number = ,
volume = 2B,
place = {United States},
year = {Wed Feb 02 00:00:00 EST 2005},
month = {Wed Feb 02 00:00:00 EST 2005}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: