Collocation Methods for Poisson’s Equation

In this paper, we provide an analysis on the collocation methods(CM), which uses a large scale of admissible functions such as orthogonal polynomials, trigonometric functions, radial basis functions and particular solutions, etc. The admissible functions can be chosen to be piecewise, i.e., different functions are used in different subdomains. The key idea is that the collocation method can be regarded as the least squares method involving integration approximation, and optimal convergence rates can be easily achieved based on the traditional analysis of the finite element method. The key analysis is to prove the uniformly Vh− elliptic inequality and some inverse inequalities used. This paper explores the interesting fact that the integration rules only affect on the uniformly Vh− elliptic inequality, but not on the solution accuracy. The advantage of the CM is to formulate easily the associated algebraic equations, which can be solved from the collocation equations directly by the least squares method, thus to greatly reduce the condition number of the associated matrix. Note that the boundary approximation method in Li [13] is a special case of the CM, where the admissible functions satisfy the equations exactly. Numerical experiments are also carried for Poisson’s problem to support the analysis made. keywords: Collocation method, least squares method, Poisson’s equation, Error analysis, Motz’s problem. AMS Subject classification, 65N10, 65N30.