We present an efficient technique to reduce the interpolation and anterpolation (transpose interpolation) errors in the aggregation and disaggregation processes of the multilevel fast multipole algorithm (MLFMA), which is based on the sampling of the radiated and incoming fields over all possible solid angles, i.e., all directions on the sphere. The fields sampled on the sphere are subject to various operations, such as interpolation, aggregation, translation, disaggregation, anterpolation, and integration. We identify the areas on the sphere, where the highest levels of interpolation errors are encountered. The error is reduced by employing additional samples on such parts of the sphere. Since the interpolation error is propagated and amplified by every level of aggregation, this technique is particulary useful for large problems. The additional costs in the memory and processing time are negligible, and the technique can easily be adapted into the existing implementations of MLFMA.