The Fast Gauss Transform
DOI10.1137/0912004zbMATH Open0721.65089OpenAlexW2160431995MaRDI QIDQ5753487FDOQ5753487
Publication date: 1991
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3d6d75eb56c0ffd35234137bfd6a759754ac384a
Hermite polynomialsfast algorithmsNumerical experimentsdiscrete Gauss transformcomputational complexity and accuracyHermite and Taylor expansions
Complexity and performance of numerical algorithms (65Y20) Numerical methods for integral transforms (65R10) Special integral transforms (Legendre, Hilbert, etc.) (44A15)
Cited In (only showing first 100 items - show all)
- Fast convolution with radial kernels at nonequispaced knots
- Hogan–Weintraub singularity and explosive behaviour in the Black–Derman–Toy model
- Fast high-order integral equation methods for solving boundary value problems of two dimensional heat equation in complex geometry
- Approximating the Gaussian as a Sum of Exponentials and Its Applications to the Fast Gauss Transform
- The ubiquitous Kronecker product
- A fast Hermite transform
- Density-based 3D shape descriptors
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- A kernel independent fast multipole algorithm for radial basis functions
- The fast Gauss transform with complex parameters
- A Kronecker Product Representation of the Fast Gauss Transform
- The Bi-Gaussian S-Transform
- A Kernel-Independent Sum-of-Gaussians Method by de la Vallee-Poussin Sums
- The correntropy MACE filter
- A reparameterisation based approach to geodesic constrained solvers for curve matching
- Particle methods for dispersive equations
- Data analysis and representation on a general domain using eigenfunctions of Laplacian
- Immersed boundary smooth extension: a high-order method for solving PDE on arbitrary smooth domains using Fourier spectral methods
- A stochastic gradient type algorithm for closed-loop problems
- An efficient method for simulation of noisy coupled multi-dimensional oscillators
- Fast direct solvers for integral equations in complex three-dimensional domains
- The uselessness of the fast Gauss transform for summing Gaussian radial basis function series
- A remark on the fast Gauss transform
- Double-exponential fast Gauss transform algorithms for pricing discrete lookback options
- A generative model and a generalized trust region Newton method for noise reduction
- Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials
- Method of lines transpose: high order L-stable \(\mathcal O(N)\) schemes for parabolic equations using successive convolution
- Probability density estimation in stochastic environmental models using reverse representa\-tions
- A methodology towards automatic implementation of \(N\)-body algorithms
- Transition density estimation for stochastic differential equations via forward-reverse represen\-ta\-tions
- Fast Gauss transforms with complex parameters using NFFTs
- A sharp error estimate for the fast Gauss transform
- Fast approximation of the discrete Gauss transform in higher dimensions
- Hierarchical Decompositions for the Computation of High-Dimensional Multivariate Normal Probabilities
- Mean shift spectral clustering
- Fast convolution with the free space Helmholtz Green's function
- A SLAM based on auxiliary marginalised particle filter and differential evolution
- Fast approximate simulation of finite long-range spin systems
- Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
- Simple computation of reaction–diffusion processes on point clouds
- A fast Galerkin method for parabolic space-time boundary integral equations
- Fast adaptive algorithms in the non-standard form for multidimensional problems
- The Chebyshev fast Gauss and nonuniform fast Fourier transforms and their application to the evaluation of distributed heat potentials
- Solving elliptic problems with non-Gaussian spatially-dependent random coefficients
- PetRBF - A parallel \(O(N)\) algorithm for radial basis function interpolation with Gaussians
- An integral equation method for epitaxial step-flow growth simulations
- A fast algorithm for computing least-squares cross-validations for nonparametric conditional kernel density functions
- Enhancing principal direction divisive clustering
- A meshless method for Asian style options pricing under the Merton jump-diffusion model
- Rapid evaluation of radial basis functions
- Ridge-based method for finding curvilinear structures from noisy data
- A fast method for solving the heat equation by layer potentials
- The fast Gauss transform for non-local integral FE models
- A CUDA-based implementation of an improved SPH method on GPU
- A penalty method for American options with jump diffusion processes
- On the numerical solution of the heat equation. I: Fast solvers in free space
- An efficient boundary integral scheme for the MBO threshold dynamics method via the NUFFT
- Fast potential theory. II: Layer potentials and discrete sums
- On fast multipole methods for Fredholm integral equations of the second kind with singular and highly oscillatory kernels
- Fast algorithms for Helmholtz Green's functions
- Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
- Fast Nyström Methods for Parabolic Boundary Integral Equations
- On the operator splitting and integral equation preconditioned deferred correction methods for the ``good Boussinesq equation
- Hybrid asymptotic/numerical methods for the evaluation of layer heat potentials in two dimensions
- Spectral approximation of the free-space heat kernel
- Application of kernel-based stochastic gradient algorithms to option pricing
- A New Error Estimate of the Fast Gauss Transform
- Graphics processing units in acceleration of bandwidth selection for kernel density estimation
- Probability density function estimation with the frequency polygon transform
- Highlighting numerical insights of an efficient SPH method
- Block Basis Factorization for Scalable Kernel Evaluation
- Improved fast Gauss transform for meshfree electromagnetic transients simulations
- Far-field compression for fast kernel summation methods in high dimensions
- An adaptive factorized Nyström preconditioner for regularized kernel matrices
- Multibody multipole methods
- Kernel Approximation on Algebraic Varieties
- Online minimum error entropy algorithm with unbounded sampling
- Testing for Volatility Co-Movement in Bivariate Stochastic Volatility Models
- Block-adaptive cross approximation of discrete integral operators
- A Fast Tunable Blurring Algorithm for Scattered Data
- A fast high-order sinc-based algorithm for pricing options under jump-diffusion processes
- Nonlinear kernel density principal component analysis with application to climate data
- A fast algorithm for fractional Helmholtz equation with application to electromagnetic waves propagation
- Lattice-based high-dimensional Gaussian filtering and the permutohedral lattice
- Toward a Kernel-Based Uncertainty Decomposition Framework for Data and Models
- Title not available (Why is that?)
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- A fast multipole method for Fredholm integral equations of the second kind with general kernel \(K(x,y)=K(x-y)\)
- A density-matching approach for optimization under uncertainty
- Hierarchical interpolative factorization preconditioner for parabolic equations
- Hierarchical optimization for neutron scattering problems
- Random Batch Algorithms for Quantum Monte Carlo Simulations
- ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
- Matrix-Free Convex Optimization Modeling
- A distributed kernel summation framework for general‐dimension machine learning
- An Adaptive Fast Gauss Transform in Two Dimensions
- Explicit unconditionally stable methods for the heat equation via potential theory
- Fast kernel summation in high dimensions via slicing and Fourier transforms
- A graph-based N-body approximation with application to stochastic neighbor embedding
- Fast Fourier transforms of piecewise polynomials
This page was built for publication: The Fast Gauss Transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753487)