In this paper, we study the stability of symmetric collocation methods for boundary value problems using certain positive definite kernels. We derive lower bounds on the smallest eigenvalue of the associated collocation matrix in terms of the separation distance. Comparing these bounds to the well-known error estimates shows that another trade-off appears, which is significantly worse than the one known from classical interpolation. Finally, we show how this new trade-off can be overcome as well as how the collocation matrix can be stabilized by smoothing. (2000): 65N12, 65N15, 65N35.
AMS subject classification