GIFFT: A Fast Solver for Modeling Sources in a Metamaterial Environment of Finite Size
GIFFT: A Fast Solver for Modeling Sources in a Metamaterial Environment of Finite Size Due to the recent explosion of interest in studying the electromagnetic behavior of large (truncated) periodic structures such as phased arrays, frequency-selective surfaces, and metamaterials, there has been a renewed interest in efficiently modeling such structures. Since straightforward numerical analyses of large, finite structures (i.e., explicitly meshing and computing interactions between all mesh elements of the entire structure) involve significant memory storage and computation times, much effort is currently being expended on developing techniques that minimize the high demand on computer resources. One such technique that belongs to the class of fast solvers for large periodic structures is the GIFFT algorithm (Green's function interpolation and FFT), which is first discussed in . This method is a modification of the adaptive integral method (AIM) , a technique based on the projection of subdomain basis functions onto a rectangular grid. Like the methods presented in -, the GIFFT algorithm is an extension of the AIM method in that it uses basis-function projections onto a rectangular grid through Lagrange interpolating polynomials. The use of a rectangular grid results in a matrix-vector product that is convolutional in form and can thus be evaluated using FFTs. Although our method differs from - in various respects, more »
Enter terms in the toolbar above to search the full text of this document for pages containing specific keywords.