On convergent numerical algorithms for unsymmetric collocation

Cheng-Feng Lee, Leevan Ling*, Robert Schaback

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

32 Citations (Scopus)
19 Downloads (Pure)


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 radial basis functions (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.

Original languageEnglish
Pages (from-to)339-354
Number of pages16
JournalAdvances in Computational Mathematics
Issue number4
Publication statusPublished - May 2009

Scopus Subject Areas

  • Computational Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Radial basis function
  • Kansa’s method
  • Convergence
  • Error bounds
  • Linear optimization
  • Effective condition number
  • High precision computation


Dive into the research topics of 'On convergent numerical algorithms for unsymmetric collocation'. Together they form a unique fingerprint.

Cite this