Results on meshless collocation techniques

Leevan LING*, Roland Opfer, Robert Schaback

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

113 Citations (Scopus)

Abstract

Though the technique introduced by Kansa is very successful in engineering applications, there were no proven results so far on the unsymmetric meshless collocation method for solving PDE boundary value problems in strong form. While the original method cannot be proven to be fail-safe in general, we prove asymptotic feasibility for a generalized variant using separated trial and test spaces. Furthermore, a greedy variation of this technique is provided, allowing a fully adaptive matrix-free and data-dependent meshless selection of the test and trial spaces.

Original languageEnglish
Pages (from-to)247-253
Number of pages7
JournalEngineering Analysis with Boundary Elements
Volume30
Issue number4
DOIs
Publication statusPublished - Apr 2006

Scopus Subject Areas

  • Analysis
  • Engineering(all)
  • Computational Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Asymptotic feasibility
  • Kansa's methods
  • Matrix-free algorithm

Fingerprint

Dive into the research topics of 'Results on meshless collocation techniques'. Together they form a unique fingerprint.

Cite this