Fast Analysis of Large Antenna Arrays with Static and Dynamic Macro Basis Function Methods

This article compares static and dynamic macro basis function (MBF) schemes for analysing large antenna arrays of disjoint elements with the method of moments (MoM). The MBF solvers are accelerated with directional cross approximation (DCA), a low-rank factorization technique suitable for high-frequency analysis. The characteristic basis function method (CBFM) is used as the static scheme. For dynamic schemes, the residual-driven CBFM, iterative Krylov subspace MBFs, and the iterative block-Jacobi scheme are considered. Numerical results demonstrate superior performance of the dynamic schemes over the static one. The Krylov and block-Jacobi schemes exhibit rapid convergence and faster runtimes than residual-driven CBFM.