Journal ArticleDOI
Parallel Support Set Searches for Meshfree Methods
Reads0
Chats0
TLDR
The implementation of a parallel algorithm that solves a computational geometry problem arising in meshfree methods and can be used to efficiently compute the mass and stiffness matrices for the meshfree Galerkin method.Abstract:
We describe the implementation of a parallel algorithm that solves a computational geometry problem arising in meshfree methods. We solve the following problem: Given a collection of N d-rectangles Si and Q points xk in Rd, compute Ik = { i | xk \in Si }. This task is necessary for computing values of the meshfree basis functions Psii (xk) and can be used to efficiently compute the mass and stiffness matrices for the meshfree Galerkin method.read more
Citations
More filters
Journal ArticleDOI
A level set enhanced natural kernel contact algorithm for impact and penetration modeling
TL;DR: In this paper, a natural kernel contact (NKC) algorithm under the framework of the semi-Lagrangian reproducing kernel particle method is proposed to model multi-body contact with specific consideration for impact and penetration modeling.
Journal ArticleDOI
RKPM2D: an open-source implementation of nodally integrated reproducing kernel particle method for solving partial differential equations
TL;DR: An open-source software RKPM2D for solving PDEs under the reproducing kernel particle method (RKPM)-based meshfree computational framework is presented to support reproducible research and serve as an efficient test platform for further development of meshfree methods.
Journal ArticleDOI
Node Placement Method by Bubble Simulation and Its Application
TL;DR: The node sets optimized by bubble simulation are used in the meshless method, and by comparison, the advan- tage with the less computational error is shown.
Journal ArticleDOI
Efficient searching in meshfree methods
TL;DR: This paper formally address the types of adjacency information that arises in various uses of meshfree methods; a discussion of available techniques for computing the various adjacencies; propose a new search algorithm and data structure; and finally compare the memory and run time performance of the methods.
References
More filters
Book
Approximation Algorithms
TL;DR: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
Journal ArticleDOI
Meshless methods: An overview and recent developments
TL;DR: 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.
Book
The design and analysis of spatial data structures
TL;DR: The design and analysis of spatial data structures and applications for predicting stock returns and remembering and imagining palestine identity and service manual are studied.
Book
MPI: The Complete Reference
TL;DR: MPI: The Complete Reference is an annotated manual for the latest 1.1 version of the standard that illuminates the more advanced and subtle features of MPI and covers such advanced issues in parallel computing and programming as true portability, deadlock, high-performance message passing, and libraries for distributed and parallel computing.
Related Papers (5)
Maximum principle and convergence analysis for the meshfree point collocation method
Do Wan Kim,Wing Kam Liu +1 more
A matrix triangularization algorithm for the polynomial point interpolation method
Gui-Rong Liu,YuanTong Gu +1 more