文摘
Fast convolution algorithms on unstructured grids have become a well established subject. Algorithms such as Fast Multipole Method (FMM), Adaptive Cross Approximation (ACA) or \(\mathcal {H}\)-matrices for instance are, by now, classical and reduce the complexity of the matrix-vector product from O(N 2) to O(N log N) with a broad range of applications in e.g. electrostatics, magnetostatics, acoustics or electromagnetics. In this paper we describe a new algorithm of which we would like to explore the potential. Based on the Non Uniform FFT algorithm, it is at the same time simple, efficient and versatile. Keywords Quadrature Non uniform FFT Fast convolution Fast multipole method