1996
DOI: 10.1007/bf02736130
|View full text |Cite
|
Sign up to set email alerts
|

Overview and applications of the reproducing Kernel Particle methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
128
0
2

Year Published

1998
1998
2018
2018

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 273 publications
(134 citation statements)
references
References 54 publications
1
128
0
2
Order By: Relevance
“…There are well known references with excellent presentations of mesh-free methods, see for instance [8,9,10,11,12]. Here some basic notions will be recalled in order to introduce the notation and the approach employed in following sections.…”
Section: Preliminaries Of the Efg Methodsmentioning
confidence: 99%
“…There are well known references with excellent presentations of mesh-free methods, see for instance [8,9,10,11,12]. Here some basic notions will be recalled in order to introduce the notation and the approach employed in following sections.…”
Section: Preliminaries Of the Efg Methodsmentioning
confidence: 99%
“…The approximation u will converge to the exact function as W (x, ρ) approaches the Dirac delta function δ(x). Moreover, the kernel function W can be easily designed so that the approximation u is exact for polynomials up to order m, that is u = u for any u polynomial of degree less or equal to m, see [20]. In that case, the approximation is said to have reproducibility of order m. Equivalently, some authors refer to this property as consistency of order m.…”
Section: Basic Equations Of Sphmentioning
confidence: 99%
“…In order to simplify the notation, let us consider approximations that can be written in the form (20) where the FE shape functions are as usual, N k := N h k and g k := ∇N h k for k ∈ N . The SPH shape functions are N k := W k for k ∈ P, as defined in Section 3.1 by (4), or by (7) for 0-order reproducibility.…”
Section: In Order To Define a Proper Integration The Particles In Thmentioning
confidence: 99%
“…Unlike FEA in which elements are connected by a topological mesh, meshfree particle methods were developed based on using a finite number of discrete particles to describe the state of a system [112][113][114][115][116]. Meshfree particle methods eliminate mesh constraints and demonstrate advantages in many applications including crack prop-agation simulations, large deformation analyses and fluid-structure interactions (FSI).…”
Section: Introductionmentioning
confidence: 99%