Entire domain basis functions on 2-D NURBS geometries

In a typical MoM solution, the scatterer is discretized into small elements, usually triangular patches. The MoM computes the interaction of equivalent surface currents existing on the patches, and as a result, produces a dense matrix. It is a well-known fact that the matrix fill is an extremely computationally intense task, consuming a large amount of memory and CPU time. Often, especially for problems of interest to the military, the computational requirements in both time and memory for the matrix fill are prohibitive. When this occurs, the user must turn to so-called fast methods such as Fast Multipole Method (FMM) [1], adaptive basis functions [2], and others.