Department of Mathematics
Phillips-University of Marburb
We extend for the first time the linear discretization theory of Schaback, developed for meshfree method, to nonlinear operator equations, relying heavily on methods of Bohmer, Vol I. There is no restriction to elliptic problems nor to symmetric numerical methods have to be formulated as optimization problems nor to symmetric numerical methods like Galerkin techniques. Trial spaces can be arbitrary, but have to approximate the solution well, and testing can be weak or strong. We present Galerkin techniques as an example. On the downside, stability is not easy to prove for special applications, and numerical methods have to be formulated as optimization problems. Results of this discretization theory cover error bunds and convergence rates. As an example we present the meshless method for some nonlinear elliptic problems of order 2. Some numerical examples are added for illustration.