A meshless local Petrov-Galerkin Shepard and least-squares method based on duo nodal supports (Q1719175)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A meshless local Petrov-Galerkin Shepard and least-squares method based on duo nodal supports |
scientific article; zbMATH DE number 7017305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A meshless local Petrov-Galerkin Shepard and least-squares method based on duo nodal supports |
scientific article; zbMATH DE number 7017305 |
Statements
A meshless local Petrov-Galerkin Shepard and least-squares method based on duo nodal supports (English)
0 references
8 February 2019
0 references
Summary: The meshless Shepard and least-squares (MSLS) interpolation is a newly developed partition of unity- (PU-) based method which removes the difficulties with many other meshless methods such as the lack of the Kronecker delta property. The MSLS interpolation is efficient to compute and retain compatibility for any basis function used. In this paper, we extend the MSLS interpolation to the local Petrov-Galerkin weak form and adopt the duo nodal support domain. In the new formulation, there is no need for employing singular weight functions as is required in the original MSLS and also no need for background mesh for integration. Numerical examples demonstrate the effectiveness and robustness of the present method.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references