A New Error Estimate of the Fast Gauss Transform

Authors:
B. J. C. Baxter;George Roussos
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2002

Citing 0
Cited 9

Rapid evaluation of radial basis functions

Journal of Computational and Applied Mathematics
A sharp error estimate for the fast Gauss transform

Journal of Computational Physics
A Double-Exponential Fast Gauss Transform Algorithm for Pricing Discrete Path-Dependent Options

Operations Research
Entropy Minimization for Shadow Removal

International Journal of Computer Vision
The uselessness of the Fast Gauss Transform for summing Gaussian radial basis function series

Journal of Computational Physics
Rapid evaluation of radial basis functions

Journal of Computational and Applied Mathematics
Efficient parallel implementation of a weather derivatives pricing algorithm based on the fast gauss trasform

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An efficient and easily parallelizable algorithm for pricing weather derivatives

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Fast Approximation of the Discrete Gauss Transform in Higher Dimensions

Journal of Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The fast Gauss transform of L. Greengard and J. Strain [SIAM J. Sci. Statist. Comput., 12 (1991), pp. 79--94] reduces the computational complexity of the evaluation of the sum of N Gaussians at M points in d-dimensional space from ${\cal O}(MN)$ to ${\cal O}(M+N)$ floating-point operations. In this note, we provide numerical evidence that the error estimate of Lemma 2.1 in [SIAM J. Sci. Statist. Comput., 12 (1991), pp. 79--94] is erroneous and then proceed to calculate a replacement error estimate for the fast Gauss transform, incorporating an improved upper bound for Hermite functions.