Arthur Nieslony

Learn More
We develop a new algorithm for the fast evaluation of linear combinations of radial functions f (y j) := N k=1 α k K(||y j −x k ||) (j = 1,. .. , M) for x k , y j ∈ R 2 based on the recently developed fast Fourier transform at nonequispaced knots. For smooth kernels, e.g. the Gaussian, our algorithm requires O(N + M) arithmetic operations. In case of(More)
  • 1