The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

The fast Gauss transform with complex parameters

På svenska

Author

  • Fredrik Andersson
  • G Beylkin

Summary, in English

We construct a fast method, O(N log N), for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Gauss transform methods.

Publishing year

2005

Language

English

Pages

274-286

Publication/Series

Journal of Computational Physics

Volume

203

Issue

1

Document type

Journal article

Publisher

Elsevier

Topic

  • Mathematics

Keywords

  • chirped Gaussian
  • fast algorithms
  • Gauss transform
  • unequally spaced Fourier transforms

Status

Published

ISBN/ISSN/Other

  • ISSN: 0021-9991