A kernel independent fast multipole algorithm for radial basis functions
From MaRDI portal
Publication:2489695
Recommendations
- Fast Evaluation of Radial Basis Functions: Moment-Based Methods
- Rapid evaluation of radial basis functions
- Fast evaluation of radial basis functions. I
- Fast evaluation of radial basis functions: Methods for generalized multiquadrics in R^n
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
Cites work
- A fast algorithm for particle simulations
- A fast algorithm for the evaluation of heat potentials
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Coulomb interactions on planar structures: Inverting the square root of the Laplacian
- Fast evaluation of radial basis functions: Methods for four-dimensional polyharmonic splines
- Fast evaluation of radial basis functions: Methods for generalized multiquadrics in R^n
- Fast evaluation of radial basis functions: methods for two-dimensional polyharmonic splines
- Fast Evaluation of Radial Basis Functions: Moment-Based Methods
- The Fast Gauss Transform
Cited in
(29)- Fast evaluation of radial basis functions. I
- Fast convolution with radial kernels at nonequispaced knots
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- A hierarchical matrix approach for computing hydrodynamic interactions
- Projection-tree reduced-order modeling for fast \(N\)-body computations
- Error analysis of an accelerated interpolative decomposition for 3D Laplace problems
- A treecode based on barycentric Hermite interpolation for electrostatic particle interactions
- Fast algorithms for large dense matrices with applications to biofluids
- Implicit surface reconstruction based on generalized radial basis functions interpolant with distinct constraints
- Fast multipole accelerated boundary knot method for inhomogeneous Helmholtz problems
- Parallel-in-time simulation of biofluids
- Fast evaluation of multiquadric RBF sums by a Cartesian treecode
- A method to compute periodic sums
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- Fast Directional Multilevel Algorithms for Oscillatory Kernels
- Fast Evaluation of Radial Basis Functions: Moment-Based Methods
- Second kind integral equation formulation for the modified biharmonic equation and its applications
- On fast multipole methods for Fredholm integral equations of the second kind with singular and highly oscillatory kernels
- Analytical low-rank compression via proxy point selection
- A kernel-independent treecode based on barycentric Lagrange interpolation
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- Interpolative decomposition via proxy points for kernel matrices
- FMMTL: FMM Template Library A Generalized Framework for Kernel Matrices
- The Effect of Global Smoothness on the Accuracy of Treecodes
- A multigrid method for kernel functions acting on interacting structures with applications to biofluids
- Second kind integral equations for the first kind Dirichlet problem of the biharmonic equation in three dimensions
- A simplified fast multipole method based on strong recursive skeletonization
- Fast computation of orthonormal basis for RBF spaces through Krylov space methods
- Fast directional algorithms for the Helmholtz kernel
This page was built for publication: A kernel independent fast multipole algorithm for radial basis functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489695)