Fast O(N log N) Algorithm for Generating Rank-Minimized H2-Representation of Electrically Large Volume Integral Equations

In this article, we propose a fast algorithm to generate a rank-minimized
$\mathcal {H}^{2}$
-representation for solving electrically large volume integral equations (VIEs). Unlike existing methods whose complexity is as high as quadratic, the proposed algorithm has linearithmic complexity, and thus, it can handle problems with large electrical sizes. Furthermore, the algorithm is purely algebraic and kernel independent. Numerical experiments on electrically large 3-D arrays of dielectric cubes having over 33 million unknowns demonstrate the efficiency and accuracy of the proposed algorithm.