Approximate MLFMA as an efficient preconditioner

In this work, we propose a preconditioner that approximates the dense system operator. For this purpose, we develop an approximate multilevel fast multipole algorithm (AMLFMA), which performs a much faster matrix-vector multiplication with some relative error compared to the original MLFMA. We use AMLFMA to solve a closely related system, which makes up the preconditioner. Then, this solution is embedded in the main solution that uses MLFMA. By taking into account the far-field elements wisely, this preconditioner proves to be much more effective compared to the near-field preconditioners