Fast solution of the radial basis function interpolation equations: Domain decomposition methods (Q2706463)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast Solution of the Radial Basis Function Interpolation Equations: Domain Decomposition Methods |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast solution of the radial basis function interpolation equations: Domain decomposition methods |
scientific article |
Statements
19 March 2001
0 references
radial basis functions
0 references
interpolation
0 references
fast solution method
0 references
numerical examples
0 references
domain decomposition methods
0 references
Cholesky factorization
0 references
alternating projection algorithm
0 references
polyharmonic splines
0 references
Fast solution of the radial basis function interpolation equations: Domain decomposition methods (English)
0 references
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.
0 references