A meshless algorithm with moving least square approximations for elliptic Signorini problems

Based on the moving least square （MLS） approximations and the boundary integral equations （BIEs）, a meshless algorithm is presented in this paper for elliptic Signorini problems. In the algorithm, a projection operator is used to tackle the nonlinear boundary inequality conditions. The Signorini pro...

Full description

Saved in:
Bibliographic Details
Published in:Chinese physics B 2014-09, Vol.23 (9), p.35-42
Main Author: 王延冲 李小林
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Boundaries
Computational efficiency
Convergence
Finite element method
Least squares method
Mathematical analysis
Meshless methods
Signorini问题
收敛性证明
无网格算法
移动最小二乘
边界积分方程
近似估算
近似椭圆
非线性边界条件
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Based on the moving least square （MLS） approximations and the boundary integral equations （BIEs）, a meshless algorithm is presented in this paper for elliptic Signorini problems. In the algorithm, a projection operator is used to tackle the nonlinear boundary inequality conditions. The Signorini problem is then reformulated as BIEs and the unknown boundary variables are approximated by the MLS approximations. Accordingly, only a nodal data structure on the boundary of a domain is required. The convergence of the algorithm is proven. Numerical examples are given to show the high convergence rate and high computational efficiency of the presented algorithm.
ISSN:1674-1056
2058-3834
1741-4199
DOI:10.1088/1674-1056/23/9/090202