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
AbstractWe present algorithms for fast and stable approximation of the Hermite transform of a compac...
In their paper published in 1952, Hestenes and Stiefel considered the conjugate gradient (CG) method...
Abstract. Fast Fourier transform (FFT)-based computations can be far more accurate than the slow tra...
The fast Gauss transform proposed by Greengard and Strain reduces the computational complexity of t...
Abstract. The fast Gauss transform proposed by Greengard and Strain reduces the computational comple...
A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshe...
Evaluating sums of multivariate Gaussian kernels is a key computational task in many problems in com...
Abstract. The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points ...
Evaluating sums of multivariate Gaussian kernels is a key computational task in many problems in com...
We construct a fast algorithm for the computation of discrete Gauss transforms with complex paramete...
We are interested in obtaining error bounds for the classical Cooley-Tukey FFT algorithm in floating...
International audienceWe are interested in obtaining error bounds for the classical Cooley-Tukey FFT...
J.H. Wilkinson put Gaussian elimination (GE) on a sound numerical footing in the 1960's when he sho...
The Gaussian error function is a non-fundamental function that is commonly used in probability theor...
We present a novel approach for the fast approximation of the discrete Gauss transform in higher dim...
AbstractWe present algorithms for fast and stable approximation of the Hermite transform of a compac...
In their paper published in 1952, Hestenes and Stiefel considered the conjugate gradient (CG) method...
Abstract. Fast Fourier transform (FFT)-based computations can be far more accurate than the slow tra...
The fast Gauss transform proposed by Greengard and Strain reduces the computational complexity of t...
Abstract. The fast Gauss transform proposed by Greengard and Strain reduces the computational comple...
A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshe...
Evaluating sums of multivariate Gaussian kernels is a key computational task in many problems in com...
Abstract. The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points ...
Evaluating sums of multivariate Gaussian kernels is a key computational task in many problems in com...
We construct a fast algorithm for the computation of discrete Gauss transforms with complex paramete...
We are interested in obtaining error bounds for the classical Cooley-Tukey FFT algorithm in floating...
International audienceWe are interested in obtaining error bounds for the classical Cooley-Tukey FFT...
J.H. Wilkinson put Gaussian elimination (GE) on a sound numerical footing in the 1960's when he sho...
The Gaussian error function is a non-fundamental function that is commonly used in probability theor...
We present a novel approach for the fast approximation of the discrete Gauss transform in higher dim...
AbstractWe present algorithms for fast and stable approximation of the Hermite transform of a compac...
In their paper published in 1952, Hestenes and Stiefel considered the conjugate gradient (CG) method...
Abstract. Fast Fourier transform (FFT)-based computations can be far more accurate than the slow tra...