Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

In the theoretical part of this paper, we introduce a simplified proof technique for error bounds and convergence of a variation of E. Kansa’s well-known unsymmetric meshless collocation method. For a numerical implementation of the convergent variation, a previously proposed greedy technique is coupled with linear optimization. This algorithm allows a fully adaptive onthe- fly data-dependent meshless selection of test and trial spaces. The new method satisfies the assumptions of the background theory, and numerical experiments demonstrate its stability.

Keywords

Kansa’s method, convergence, error bounds, linear optimization

Publication Date

2008

Source Publication Title

SIAM Journal on Numerical Analysis

Volume

46

Issue

3

Start Page

1097

End Page

1115

Publisher

Society for Industrial and Applied Mathematics

Peer Reviewed

1

ISSN (print)

00361429

Share

COinS