Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme

摘要

In this article adaptive refinement algorithms are presented to solve Poisson problems by a radial basis function partition of unity (RBF-PU) collocation scheme. Since in this context the problem of constructing an adaptive discretization method to be really effective is still open, we propose some error indicators and refinement strategies, so that each of these two essential ingredients takes advantage of the potentiality of the other one. More precisely, the refinement techniques coupled with a local error indicator is an ad-hoc strategy for the RBF-PU method. The resulting scheme turns out to be flexible and the use of efficient searching procedures enables us a fast detection of the regions that adaptively need the addition/removal of points. Several numerical experiments and applications support our study by illustrating the performance of our adaptive algorithms.