No precomputation of the window function

The last considered method uses no precomputation at all, but rather evaluates the univariate window function $(2m+1)^d M$ times. Thus, the computational time depends on how fast we can evaluate the particular window function. However, no additional storage is necessary which suits this approach whenever the problem size reaches the memory limits of the used computer.