This is the authors' abstract. We don't add key points for this paper.
Solving partial differential equations (PDE) with strong form collocation and nonlocal approximation functions such as orthogonal polynomials, trigonometric functions, and radial basis functions exhibits exponential convergence rates; however, it yields a full matrix and suffers from ill conditioning. In this work, we discuss a reproducing kernel collocation method, where the reproducing kernel (RK) shape functions with compact support are used as approximation functions. This approach offers algebraic convergence rate, but the method is stable like the finite element method. We provide mathematical results consisting of the optimal error estimation, upper bound of condition number, and the desirable relationship between the number of nodal points and the number of collocation points. We show that using RK shape function for collocation of strong form, the degree of polynomial basis functions has to be larger than one for convergence, which is different from the condition for weak formulation. Numerical results are also presented to validate the theoretical analysis.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: