A fast treecode for multiquadric interpolation with varying shape parameters

DOI10.1137/110836225MaRDI QIDQ2904828zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treecoderestricted additive Schwarz methodradial basic function interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Iterative numerical methods for linear systems (65F10) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)

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\)

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
• Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration
• Generic preconditioning based on the inverse with respect to the semi-inner product for iterative solvers for radial basis function interpolation

Describes a project that uses

Uses Software

• PetRBF
• Matlab

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)