In [1], Beylkin et al. introduced a wavelet-based algorithm that approximates integral or matrix operators of a certain type by highly sparse matrices, as the basis for efficient approximate calculations. The wavelets best suited for achieving the highest possible compression with this algorithm are Daubechies wavelets, while Coiflets lead to a faster decomposition algorithm at slightly lesser ...