Meshless methods: An overview and recent developments

Explore this paper's citation graph

Summary

Meshless approximations based on moving least-squares, kernels, and partitions of unity are examined and it is shown that the three methods are in most cases identical except for the important fact that partitions ofunity enable p-adaptivity to be achieved.

Type
article
Published
1996-12-15
Cited by
3,346
References
60

Keywords

Discretization, Moving least squares, Quadrature (astronomy), Galerkin method, Collocation (remote sensing)

References

Cited by

Related papers