The Fast Gauss Transform
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The correntropy MACE filter
- Fast convolution with the free space Helmholtz Green's function
- A stochastic gradient type algorithm for closed-loop problems
- A new version of the fast Gauss transform
- Fast potential theory. II: Layer potentials and discrete sums
- Spectral approximation of the free-space heat kernel
- The ubiquitous Kronecker product
- Ridge-based method for finding curvilinear structures from noisy data
- On the operator splitting and integral equation preconditioned deferred correction methods for the ``good Boussinesq equation
- An efficient boundary integral scheme for the MBO threshold dynamics method via the NUFFT
- Transition density estimation for stochastic differential equations via forward-reverse represen\-ta\-tions
- Rapid evaluation of radial basis functions
- Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
- Fast convolution with radial kernels at nonequispaced knots
- A remark on the fast Gauss transform
- A penalty method for American options with jump diffusion processes
- A reparameterisation based approach to geodesic constrained solvers for curve matching
- Hybrid asymptotic/numerical methods for the evaluation of layer heat potentials in two dimensions
- Highlighting numerical insights of an efficient SPH method
- A fast algorithm for fractional Helmholtz equation with application to electromagnetic waves propagation
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- A fast multipole method for Fredholm integral equations of the second kind with general kernel \(K(x,y)=K(x-y)\)
- An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation
- Hierarchical interpolative factorization preconditioner for parabolic equations
- Fast approximate simulation of finite long-range spin systems
- A CUDA-based implementation of an improved SPH method on GPU
- Block-adaptive cross approximation of discrete integral operators
- Improved fast Gauss transform for meshfree electromagnetic transients simulations
- Explicit unconditionally stable methods for the heat equation via potential theory
- Fast Fourier transforms of piecewise polynomials
- Fast high-order integral equation methods for solving boundary value problems of two dimensional heat equation in complex geometry
- Immersed boundary smooth extension: a high-order method for solving PDE on arbitrary smooth domains using Fourier spectral methods
- Hierarchical optimization for neutron scattering problems
- A fast Hermite transform
- Fast approximation of the discrete Gauss transform in higher dimensions
- Far-field compression for fast kernel summation methods in high dimensions
- A graph-based N-body approximation with application to stochastic neighbor embedding
- A density-matching approach for optimization under uncertainty
- Fast adaptive algorithms in the non-standard form for multidimensional problems
- A generative model and a generalized trust region Newton method for noise reduction
- A fast algorithm for computing least-squares cross-validations for nonparametric conditional kernel density functions
- Multibody multipole methods
- On the numerical solution of the heat equation. I: Fast solvers in free space
- Mean shift spectral clustering
- A kernel independent fast multipole algorithm for radial basis functions
- An integral equation method for epitaxial step-flow growth simulations
- Double-exponential fast Gauss transform algorithms for pricing discrete lookback options
- Probability density estimation in stochastic environmental models using reverse representa\-tions
- Lattice-based high-dimensional Gaussian filtering and the permutohedral lattice
- Nonlinear kernel density principal component analysis with application to climate data
- A meshless method for Asian style options pricing under the Merton jump-diffusion model
- Method of lines transpose: high order L-stable O(N) schemes for parabolic equations using successive convolution
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Fast Nyström methods for parabolic boundary integral equations
- A fast high-order sinc-based algorithm for pricing options under jump-diffusion processes
- Matrix-free convex optimization modeling
- The fast generalized Gauss transform
- MuST: the multilevel sinc transform
- Multidimensional fast Gauss transforms by Chebyshev expansions
- The Fast Gauss Transform with Variable Scales
- Hierarchical Decompositions for the Computation of High-Dimensional Multivariate Normal Probabilities
- Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
- The fast Gauss transform for non-local integral FE models
- A fast Galerkin method for parabolic space-time boundary integral equations
- Application of kernel-based stochastic gradient algorithms to option pricing
- Fast algorithms for Helmholtz Green's functions
- Robust Independent Component Analysis Using Quadratic Negentropy
- Fast direct solvers for integral equations in complex three-dimensional domains
- Efficient computation of two-dimensional Gaussian windows
- The Bi-Gaussian S-Transform
- A Kronecker Product Representation of the Fast Gauss Transform
- An adaptive fast Gauss transform in two dimensions
- Testing for volatility co-movement in bivariate stochastic volatility models
- Hogan–Weintraub singularity and explosive behaviour in the Black–Derman–Toy model
- A New Error Estimate of the Fast Gauss Transform
- scientific article; zbMATH DE number 799774 (Why is no real title available?)
- A distributed kernel summation framework for general‐dimension machine learning
- Toward a Kernel-Based Uncertainty Decomposition Framework for Data and Models
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Fast Reciprocal Jacket Transform With Many Parameters
- On fast multipole methods for Fredholm integral equations of the second kind with singular and highly oscillatory kernels
- Approximating the Gaussian as a sum of exponentials and its applications to the fast Gauss transform
- A fast tunable blurring algorithm for scattered data
- A kernel-independent sum-of-Gaussians method by de La Vallée-Poussin sums
- Random batch algorithms for quantum Monte Carlo simulations
- A SLAM based on auxiliary marginalised particle filter and differential evolution
- Simple computation of reaction-diffusion processes on point clouds
- Block basis factorization for scalable kernel evaluation
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
- Probability density function estimation with the frequency polygon transform
- Online minimum error entropy algorithm with unbounded sampling
- Graphics processing units in acceleration of bandwidth selection for kernel density estimation
- Fast Gauss transforms with complex parameters using NFFTs
- Kernel Approximation on Algebraic Varieties
- Particle methods for dispersive equations
- A methodology towards automatic implementation of \(N\)-body algorithms
- Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials
- On representations of the Helmholtz Green's function
- A new version of the adaptive fast Gauss transform for discrete and continuous sources
- Solving elliptic problems with non-Gaussian spatially-dependent random coefficients
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)
