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-di...

Full description

Saved in:
Bibliographic Details
Published inChinese physics B Vol. 21; no. 10; pp. 49 - 55
Main Author 杨秀丽 戴保东 张伟伟
Format Journal Article
LanguageEnglish
Published 01.10.2012
Subjects
Approximation
Complex variables
Finite element method
Least squares method
Mathematical analysis
Mathematical models
Meshless methods
Two dimensional
二维
局部对称
无网格局部Petrov-Galerkin方法
无网格局部Petrov-Galerkin法
本质边界条件
求解
移动最小二乘
试探函数
Online AccessGet full text
ISSN1674-1056
2058-3834
1741-4199
DOI10.1088/1674-1056/21/10/100208

Cover

More Information
Summary: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.
Bibliography: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.
meshless method; complex variable moving least-square method; complex variable meshless local Petrov-Galerkin method; potential problems
Yang Xiu-Li,Dai Bao-Dong ,and Zhang Wei-Wei （Department of Engineering Mechanics,Taiyuan University of Science ＆ Technology,Taiyuan 030024,China）
11-5639/O4
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-1056
2058-3834
1741-4199
DOI:10.1088/1674-1056/21/10/100208