Stable and Convergent Unsymmetric Meshless Collocation Methods
نویسندگان
چکیده
منابع مشابه
Stable and Convergent Unsymmetric Meshless Collocation Methods
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 on-the-fly data-dependent m...
متن کاملOn Adaptive Unsymmetric Meshless Collocation
The set Λ consists of infinitely many linear real–valued functionals λ that usually take the form of point evaluations of functions or derivatives at points inside a domain or on some boundary or interface layer. If several differential or boundary operators are involved, we simply put everything into a single set Λ of functionals of various types. We call (1) a generalized interpolation proble...
متن کاملConvergence of Unsymmetric Kernel-Based Meshless Collocation Methods
This paper proves convergence of variations of the unsymmetric kernel-based collocation method introduced by E. Kansa in 1986. Since then, this method has been very successfully used in many applications, though it may theoretically fail in special situations, and though it had no error bound or convergence proof up to now. Thus it is necessary to add assumptions or to make modifications. Our m...
متن کاملOn convergent numerical algorithms for unsymmetric collocation
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...
متن کاملUnsymmetric meshless methods for operator equations
A general framework for proving error bounds and convergence of a large class of unsymmetric meshless numerical methods for solving well-posed linear operator equations is presented. The results provide optimal convergence rates, if the test and trial spaces satisfy a stability condition. Operators need not be elliptic, and the problems can be posed in weak or strong form without changing the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2008
ISSN: 0036-1429,1095-7170
DOI: 10.1137/06067300x