A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method

Ettore Barbieri, Michele Meo

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

Novel numerical methods, known as Meshless Methods or Meshfree Methods and, in a wider perspective, Partition of Unity Methods, promise to overcome most of disadvantages of the traditional finite element techniques. The absence of a mesh makes meshfree methods very attractive for those problems involving large deformations, moving boundaries and crack propagation. However, meshfree methods still have significant limitations that prevent their acceptance among researchers and engineers, namely the computational costs. This paper presents an in-depth analysis of computational techniques to speed-up the computation of the shape functions in the Reproducing Kernel Particle Method and Moving Least Squares, with particular focus on their bottlenecks, like the neighbour search, the inversion of the moment matrix and the assembly of the stiffness matrix. The paper presents numerous computational solutions aimed at a considerable reduction of the computational times: the use of kd-trees for the neighbour search, sparse indexing of the nodes-points connectivity and, most importantly, the explicit and vectorized inversion of the moment matrix without using loops and numerical routines. 2011 Springer-Verlag.
Original languageEnglish
Pages (from-to)581-602
JournalComputational Mechanics
Volume49
Issue number5
DOIs
Publication statusPublished - 2012

Fingerprint

Reproducing Kernel Particle Method
Meshfree Method
Object-oriented
Moment Matrix
MATLAB
Inversion
Stiffness matrix
Partition of Unity Method
Kd-tree
Crack propagation
Numerical methods
Moving Least Squares
Meshless Method
Computational Techniques
Moving Boundary
Crack Propagation
Shape Function
Large Deformation
Stiffness Matrix
Engineers

Cite this

A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method. / Barbieri, Ettore; Meo, Michele.

In: Computational Mechanics, Vol. 49, No. 5, 2012, p. 581-602.

Research output: Contribution to journalArticle

@article{c5a90c3550f2410a8acca299b942a867,
title = "A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method",
abstract = "Novel numerical methods, known as Meshless Methods or Meshfree Methods and, in a wider perspective, Partition of Unity Methods, promise to overcome most of disadvantages of the traditional finite element techniques. The absence of a mesh makes meshfree methods very attractive for those problems involving large deformations, moving boundaries and crack propagation. However, meshfree methods still have significant limitations that prevent their acceptance among researchers and engineers, namely the computational costs. This paper presents an in-depth analysis of computational techniques to speed-up the computation of the shape functions in the Reproducing Kernel Particle Method and Moving Least Squares, with particular focus on their bottlenecks, like the neighbour search, the inversion of the moment matrix and the assembly of the stiffness matrix. The paper presents numerous computational solutions aimed at a considerable reduction of the computational times: the use of kd-trees for the neighbour search, sparse indexing of the nodes-points connectivity and, most importantly, the explicit and vectorized inversion of the moment matrix without using loops and numerical routines. 2011 Springer-Verlag.",
author = "Ettore Barbieri and Michele Meo",
year = "2012",
doi = "10.1007/s00466-011-0662-x",
language = "English",
volume = "49",
pages = "581--602",
journal = "Computational Mechanics",
issn = "0178-7675",
publisher = "Springer Verlag",
number = "5",

}

TY - JOUR

T1 - A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method

AU - Barbieri, Ettore

AU - Meo, Michele

PY - 2012

Y1 - 2012

N2 - Novel numerical methods, known as Meshless Methods or Meshfree Methods and, in a wider perspective, Partition of Unity Methods, promise to overcome most of disadvantages of the traditional finite element techniques. The absence of a mesh makes meshfree methods very attractive for those problems involving large deformations, moving boundaries and crack propagation. However, meshfree methods still have significant limitations that prevent their acceptance among researchers and engineers, namely the computational costs. This paper presents an in-depth analysis of computational techniques to speed-up the computation of the shape functions in the Reproducing Kernel Particle Method and Moving Least Squares, with particular focus on their bottlenecks, like the neighbour search, the inversion of the moment matrix and the assembly of the stiffness matrix. The paper presents numerous computational solutions aimed at a considerable reduction of the computational times: the use of kd-trees for the neighbour search, sparse indexing of the nodes-points connectivity and, most importantly, the explicit and vectorized inversion of the moment matrix without using loops and numerical routines. 2011 Springer-Verlag.

AB - Novel numerical methods, known as Meshless Methods or Meshfree Methods and, in a wider perspective, Partition of Unity Methods, promise to overcome most of disadvantages of the traditional finite element techniques. The absence of a mesh makes meshfree methods very attractive for those problems involving large deformations, moving boundaries and crack propagation. However, meshfree methods still have significant limitations that prevent their acceptance among researchers and engineers, namely the computational costs. This paper presents an in-depth analysis of computational techniques to speed-up the computation of the shape functions in the Reproducing Kernel Particle Method and Moving Least Squares, with particular focus on their bottlenecks, like the neighbour search, the inversion of the moment matrix and the assembly of the stiffness matrix. The paper presents numerous computational solutions aimed at a considerable reduction of the computational times: the use of kd-trees for the neighbour search, sparse indexing of the nodes-points connectivity and, most importantly, the explicit and vectorized inversion of the moment matrix without using loops and numerical routines. 2011 Springer-Verlag.

UR - http://www.scopus.com/inward/record.url?scp=84862147890&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1007/s00466-011-0662-x

U2 - 10.1007/s00466-011-0662-x

DO - 10.1007/s00466-011-0662-x

M3 - Article

VL - 49

SP - 581

EP - 602

JO - Computational Mechanics

JF - Computational Mechanics

SN - 0178-7675

IS - 5

ER -