Accelerated randomized vs. deterministic algorithms for mom blocks' low-rank factorization

A randomized and a deterministic algorithm for the fast computation of impedance matrix blocks' low-rank factorization are contrasted. The deterministic algorithm is based on multilevel compression of non-uniformly sampled phase- and amplitude-compensated interactions between clusters of source/observer basis/testing functions. The randomized algorithm is accelerated by using fast Fourier transform-based field evaluation. The algorithms' performance are compared for various classes of problem topology and algorithm parameters.