Fast Evaluation of Radial Basis Functions: Moment-Based Methods

From MaRDI portal





For the smooth function \(\varphi=\varphi(x)\), \(x\in(0,1]\), the expression \(s(x): =\sum^N_{n=1} d_n\varphi (| x-x_n |)\), is called a radial basis function. The paper presents a new algorithm for fast evaluation of \(s\) to within accuracy \(\varepsilon\), which has a setup cost of \({\mathcal O}(|\log \varepsilon| \log| \log\varepsilon |)\) operations and an incremental cost per evaluation of \({\mathcal O}(| \log \varepsilon |)\) operations. This algorithm can be extended to the multivariate case, and does not require that \(\varphi\) be analytic at infinity nor that the data structures be modified for each new \(\varphi\), nor that the points \(x_n\) form any sort of regular array. A section contains a brief discussion on those factors which affect the performance of fast algorithms. A general class of basic functions \(\varphi\) to which the algorithm is well suited is given.











This page was built for publication: Fast Evaluation of Radial Basis Functions: Moment-Based Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389302)