The fast Gauss transform with complex parameters

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.

• Författare: Fredrik Andersson; G Beylkin
• Avdelning/ar: Matematik LTH
• Publiceringsår: 2005
• Språk: Engelska
• Sidor: 274-286
• Publikation/Tidskrift/Serie: Journal of Computational Physics
• Volym: 203
• Issue: 1
• Länkar: http://dx.doi.org/10.1016/j.jcp.2004.07.020
• Dokumenttyp: Artikel i tidskrift
• Förlag: Elsevier
• Ämne: Mathematics
• Nyckelord: chirped Gaussian; fast algorithms; Gauss transform; unequally spaced Fourier transforms
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 0021-9991