Greedy unsymmetric collocation

We present greedy unsymmetric collocation schemes for solving linear elliptic partial differential equations using radial basis functions. The proposed approach circumvents the illconditioning problem associated with the standard collocation technique and enables the efficient solution of problems requiring a large set of collocation points. Numerical studies indicate that the accuracy of greedy algorithms incorporating shape parameter tuning can be significantly better than the standard collocation scheme