![]() |
CiteULike | ![]() |
Group: SPHERIC | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Meshless methods: An overview and recent developmentsComputer Methods in Applied Mechanics and Engineering, Vol. 139, No. 1-4. (15 December 1996), pp. 3-47.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractMeshless approximations based on moving least-squares, kernels, and partitions of unity are examined. It is shown that the three methods are in most cases identical except for the important fact that partitions of unity enable p-adaptivity to be achieved. Methods for constructing discontinuous approximations and approximations with discontinuous derivatives are also described. Next, several issues in implementation are reviewed: discretization (collocation and Galerkin), quadrature in Galerkin and fast ways of constructing consistent moving least-square approximations. The paper concludes with some sample calculations.
BibTeX record
RIS record