Error analysis of the reproducing kernel particle method

From MaRDI portal





The authors actually discuss a class of projective methods (generalizations of Bubnov-Galerkin methods) with special basis functions associated with the sets of points (quasi-grids) in the closure of the domain. This sets have the parameter \(r>0\). When it tends to zero, the sets (in the given examples) are special grids (only one-dimensional case is considered in details). NEWLINENEWLINENEWLINESpecific properties of smooth basis functions are connected with the fact that several of them might have nonzero values at the same point. Such subspaces were discussed by \textit{J.-P. Aubin} [Approximation of elliptic boundary-value problems (1972; Zbl 0248.65063)] devoted to approximation of elliptic problems. They were of help in constructing smooth approximations but it was clear that they meet with difficulties in case of the Dirichlet boundary conditions (the authors also underline this fact). Moreover, such approximations lead to systems of equations of rather involved type for which it is very difficult to suggest good iterative methods (some examples for biharmonic equation can be found in Chapter 8 of the reviewer's book [Optimization in solving elliptic problems. CRC Press (1996; Zbl 0852.65087)].) NEWLINENEWLINENEWLINEThe authors present some results dealing with interpolation error estimates for special sets of points and basis functions. These quasi-grids have some regular properties (like standard grids) and allow to obtain estimates of the same type as in theory of spline approximations. The case of the Dirichlet boundary conditions is considered for ordinary differential equations of the second order. Numerical examples correspond to similar one-dimensional problems.




Cited in
(only showing first 100 items - show all)








This page was built for publication: Error analysis of the reproducing kernel particle method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948237)