On the approximability and the selection of particle shape functions (Q1434054): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s00211-003-0489-2 / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00211-003-0489-2 / rank | |||
Normal rank |
Latest revision as of 20:20, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the approximability and the selection of particle shape functions |
scientific article |
Statements
On the approximability and the selection of particle shape functions (English)
0 references
1 July 2004
0 references
Particle methods, also known as meshless methods, have become of interest in the numerical solution of elliptic differential equations. Moving least square particle methods, reproducing kernel particle methods and combinations of them are considered. The authors distinguish those methods that are nearly translation invariant in the interior and those which have not this property. The order of convergence depends on the fact which polynomials are reproduced by the interpolation operator, but the authors note that this property does not indicate the actual order for all classes of shape functions. The literature of the finite element community is cited, but not that by people from approximation theory.
0 references
meshless methods
0 references
elliptic differential equations
0 references
moving least square particle methods
0 references
reproducing kernel particle methods
0 references
convergence
0 references
0 references
0 references