Fast solution of the radial basis function interpolation equations: Domain decomposition methods

From MaRDI portal





The authors consider domain decomposition methods for solving the radial basis function interpolation equations. There are three interwoven sections in the paper. The first provides good ways of setting up small radial basis function interpolation problems, using the Cholesky factorization. The second section considers a natural domain decomposition method for the interpolation equations. It is an instance of von Neumann's alternating projection algorithm. In the last section the authors present some algorithmic details and numerical results of a decomposition interpolatory code for polyharmonic splines in 2 and 3 dimenssions.




Cited in
(84)








This page was built for publication: Fast solution of the radial basis function interpolation equations: Domain decomposition methods

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