The fast Gauss transform with complex parameters

Research output: Contribution to journalArticle

Abstract

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.

Details

Authors
  • Fredrik Andersson
  • G Beylkin
Organisations
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Mathematics

Keywords

  • chirped Gaussian, fast algorithms, Gauss transform, unequally spaced Fourier transforms
Original languageEnglish
Pages (from-to)274-286
JournalJournal of Computational Physics
Volume203
Issue number1
Publication statusPublished - 2005
Publication categoryResearch
Peer-reviewedYes