Premium
Interpolation of translation matrix in MLFMA
Author(s) -
Song Jiming,
Chew Weng Cho
Publication year - 2001
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.1234
Subject(s) - interpolation (computer graphics) , multipole expansion , translation (biology) , matrix (chemical analysis) , solver , algorithm , lagrange polynomial , polynomial interpolation , mathematics , microwave , computer science , polynomial , mathematical optimization , linear interpolation , mathematical analysis , physics , chemistry , telecommunications , biochemistry , quantum mechanics , messenger rna , chromatography , frame (networking) , gene
The translation matrix for the multilevel fast multipole algorithm (MLFMA) in an FISC (fast Illinois solver code) is calculated directly, and the complexity is O ( N 3/2 ), where N is the number of unknowns. For a problem with a small electrical size, the CPU time for calculating the translation matrix can be negligible. But for large problems, the calculation time increases significantly. In this paper, we use interpolation to calculate the translation matrix, and the complexity is reduced to O ( N ). Different interpolation techniques are tested, and it is found that the Lagrange polynomial interpolation with high sampling rates is the best. The saving factor is 10 for the VFY218 at 4 GHz. © 2001 John Wiley & Sons, Inc. Microwave Opt Technol Lett 30: 109–114, 2001.