Arbitrary precision computations of variations of Kansa's method

Leevan LING*

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

Abstract

In this paper, we are interested in some convergent formulations for the unsymmetric collocation method or the so-called Kansa's method. The rates of convergence of two variations of Kansa's method are examined and verified in arbitrary-precision computations.

Original languageEnglish
Title of host publicationProgress on Meshless Methods
EditorsFerreira Ferreira, E.J. Kansa, G.E. Fasshauer, V.M.A. Leitão
PublisherSpringer
Pages77-83
Number of pages7
ISBN (Print)9781402088209
DOIs
Publication statusPublished - 2009
Event2nd ECCOMAS Thematic Conference on Meshless Methods, 2007 - Porto, Portugal
Duration: 9 Jul 200711 Jul 2007

Publication series

NameComputational Methods in Applied Sciences
Volume11
ISSN (Print)1871-3033

Conference

Conference2nd ECCOMAS Thematic Conference on Meshless Methods, 2007
Country/TerritoryPortugal
CityPorto
Period9/07/0711/07/07

Scopus Subject Areas

  • Civil and Structural Engineering
  • Modelling and Simulation
  • Biomedical Engineering
  • Computer Science Applications
  • Fluid Flow and Transfer Processes
  • Computational Mathematics
  • Electrical and Electronic Engineering

User-Defined Keywords

  • Convergence
  • Error bounds
  • High precision computation
  • Kansa's method
  • Radial basis function

Fingerprint

Dive into the research topics of 'Arbitrary precision computations of variations of Kansa's method'. Together they form a unique fingerprint.

Cite this