A fast treecode for multiquadric interpolation with varying shape parameters
DOI10.1137/110836225zbMATH Open1253.65012OpenAlexW2154980471MaRDI QIDQ2904828FDOQ2904828
Authors: Quan Deng, Tobin A. Driscoll 
Publication date: 23 August 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4ac37cae99fc5ce3e970f2f886b59a699f6f8777
Recommendations
- Fast evaluation of multiquadric RBF sums by a Cartesian treecode
- Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration
- Rapid evaluation of radial basis functions
- Fast multilevel evaluation of smooth radial basis function expansions
- Fast evaluation of radial basis functions: Methods for generalized multiquadrics in \(\mathbb R^n\)
Numerical interpolation (65D05) Iterative numerical methods for linear systems (65F10) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)
Cited In (6)
- Preconditioning for radial basis function partition of unity methods
- Convexity and solvability for compactly supported radial basis functions with different shapes
- Block preconditioners for linear systems arising from multiscale collocation with compactly supported RBFs.
- Fast evaluation of multiquadric RBF sums by a Cartesian treecode
- Generic preconditioning based on the inverse with respect to the semi-inner product for iterative solvers for radial basis function interpolation
- Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration
Uses Software
This page was built for publication: A fast treecode for multiquadric interpolation with varying shape parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904828)
