Accessible Requires Authentication Published by De Gruyter December 1, 2006

Fast Gauss transforms with complex parameters using NFFTs

S. Kunis, D. Potts and G. Steidl
From the journal

We construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only (N) arithmetic operations.

Published Online: 2006-12-01
Published in Print: 2006-12-01

Copyright 2006, Walter de Gruyter