.png){kind=icon}
.png){kind=icon}
Return
The fast Gauss transform with complex parameters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2004.07.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2004 Elsevier Inc. All rights reserved.
Keywords:
Gauss transform
unequally spaced Fourier transforms
fast algorithms
chirped Gaussian
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W
Organization
No organization information available