Back to Search
Start Over
Efficient searching in meshfree methods.
- Source :
- Computational Mechanics; Dec2018, Vol. 62 Issue 6, p1461-1483, 23p
- Publication Year :
- 2018
-
Abstract
- Meshfree methods such as the Reproducing Kernel Particle Method and the Element Free Galerkin method have proven to be excellent choices for problems involving complex geometry, evolving topology, and large deformation, owing to their ability to model the problem domain without the constraints imposed on the Finite Element Method (FEM) meshes. However, meshfree methods have an added computational cost over FEM that come from at least two sources: increased cost of shape function evaluation and the determination of adjacency or connectivity. The focus of this paper is to formally address the types of adjacency information that arises in various uses of meshfree methods; a discussion of available techniques for computing the various adjacency graphs; propose a new search algorithm and data structure; and finally compare the memory and run time performance of the methods. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01787675
- Volume :
- 62
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- Computational Mechanics
- Publication Type :
- Academic Journal
- Accession number :
- 133032697
- Full Text :
- https://doi.org/10.1007/s00466-018-1574-9