A novel implementation of multilevel fast multipole algorithm for higher order Galerkin's method

A new approach is proposed to reduce the memory requirements of the multile vel fast multipole algorithm (MLFMA) when applied to the higher order Galer kin's method. This approach represents higher order basis functions by a se t of point sources such that a matrix-vector multiply is equivalent to calc ulating the fields at a number of points from given current sources at thes e points. The MLFMA is then applied to calculate the point-to-point interac tions, This permits the use of more Levels in MLFMA than applying MLFMA to basis-to-basis interactions directly and, thus, reduces the memory requirem ents significantly.