The complex variable meshless local Petrov–Galerkin method of solving two-dimensional potential problems

Based on the complex variable moving least-square (CVMLS) approximation and a local symmetric weak form, the complex variable meshless local Petrov-Galerkin (CVMLPG) method of solving two-dimensional potential problems is presented in this paper. In the present formulation, the trial function of a two-dimensional problem is formed with a one-dimensional basis function. The number of unknown coefficients in the trial function of the CVMLS approximation is less than that in the trial function of the moving least-square (MLS) approximation. The essential boundary conditions are imposed by the penalty method. The main advantage of this approach over the conventional meshless local Petrov-Galerkin (MLPG) method is its computational efficiency. Several numerical examples are presented to illustrate the implementation and performance of the present CVMLPG method.