University of Cambridge > Talks.cam > Applied and Computational Analysis > A nonlinear discretization theory with applications to meshfree methods

A nonlinear discretization theory with applications to meshfree methods

Add to your list(s) Download to your calendar using vCal

  • UserKlaus Böhmer (University of Marburg)
  • ClockThursday 28 October 2010, 15:00-16:00
  • HouseMR14, CMS.

If you have a question about this talk, please contact ai10.

We extend for the first time the linear discretization theory of Schaback, developed for meshfree methods, to nonlinear operator equations, relying heavily on methods of B¨ohmer, Vol I. There is no restriction to elliptic problems or 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 bounds and convergence rates. These results remain valid for the general case of fully nonlinear elliptic differential equations of second order. Some numerical examples are added for illustration.

K. Böhmer, Numerical Methods for Nonlinear Elliptic Differential Equa tions, Oxford University Press, 2010, 770 pp.

R. Schaback, Unsymmetric meshless methods for operator equations, Numer. Math., 114 (2010), pp. 629 – 651.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity