Preconditioned MoM Solutions for Complex Planar Arrays
The numerical analysis of large arrays is a complex problem. There are several techniques currently under development in this area. One such technique is the FAIM (Faster Adaptive Integral Method). This method uses a modification of the standard AIM approach which 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. These bases are then projected onto a regular grid of 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. The method has been proven to greatly reduce solve time by speeding the matrix-vector product computation. The FAIM approach also reduces fill time and memory requirements, since only the near element interactions need to be calculated exactly. The present work extends FAIM by modifying it to allow for layered material Green's Functions and dielectrics. In addition, a preconditioner is implemented to greatly reduce the number of iterations required for a solution. The general scheme of the FAIM method is reported in; this contribution is limited to presenting new results.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 15013928
- Report Number(s):
- UCRL-CONF-203260; TRN: US200803%%985
- Resource Relation:
- Conference: Presented at: 2004 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, Monterey, CA, United States, Jun 20 - Jun 26, 2004
- Country of Publication:
- United States
- Language:
- English
Similar Records
General MoM Solutions for Large Arrays
GIFFT: A Fast Solver for Modeling Sources in a Metamaterial Environment of Finite Size