Department of Mathematics
In this paper, we are interested in some convergent formulations for the unsymmetric collocation method or the so-called Kansa’s method. We review some newly developed theories on solvability and convergence. The rates of convergence of these variations of Kansa’s method are examined and verified in arbitrary–precision computations. Numerical examples confirm with the theories that the modified Kansa’s method converges faster than the interpolant to the solution; that is, exponential convergence for the multiquadric and Gaussian RBFs. Some numerical algorithms are proposed for efficiency and accuracy in practical applications of Kansa’s method. In double–precision, even for very large RBF shape parameters, we show that the modified Kansa’s method, through a subspace selection using a greedy algorithm, can produce acceptable approximate solutions. A benchmark algorithm is used to verify the optimality of the selection process.
Source Publication Title
Advances in Computational Mathematics
Link to Publisher's Edition
Lee, C., Ling, L., & Schaback, R. (2009). On convergent numerical algorithms for unsymmetric collocation. Advances in Computational Mathematics, 30 (4). https://doi.org/10.1007/s10444-008-9071-x