During the last years, there has been increased interest in developing efficient radial basis function (RBF) algorithms to solve partial differential problems of great scale. In this article, we are interested in solving large PDEs problems, whose solution presents rapid variations. Our main objective is to introduce a RBF dynamical domain decomposition algorithm which simultaneously performs a node adaptive strategy. This algorithm is based on the RBFs unsymmetric collocation setting. Numerical experiments performed with the multiquadric kernel function, for two stationary problems in two dimensions are presented.