2001
DOI: 10.1016/s0045-7949(01)00067-0
|View full text |Cite
|
Sign up to set email alerts
|

A finite point method for elasticity problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
77
0
4

Year Published

2004
2004
2018
2018

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 163 publications
(85 citation statements)
references
References 22 publications
1
77
0
4
Order By: Relevance
“…Since the FPM appeared in the literature towards the mid-nineties, it has been successfully applied to solve convective-diffusive problems, incompressible and compressible fluid flow problems [9,10,11,12,13,14] and solid mechanics problems [15,16,17] among others. As regards to fluid flow problems, the first application of the FPM to the solution of the twodimensional compressible flow equations was presented by Oñate et al [8,9] and Fischer [12].…”
Section: The Present Work Deals With a Meshless Technique Called The mentioning
confidence: 99%
See 1 more Smart Citation
“…Since the FPM appeared in the literature towards the mid-nineties, it has been successfully applied to solve convective-diffusive problems, incompressible and compressible fluid flow problems [9,10,11,12,13,14] and solid mechanics problems [15,16,17] among others. As regards to fluid flow problems, the first application of the FPM to the solution of the twodimensional compressible flow equations was presented by Oñate et al [8,9] and Fischer [12].…”
Section: The Present Work Deals With a Meshless Technique Called The mentioning
confidence: 99%
“…If the condition number of A is smaller than a given maximum admissible value, and if the calculated shape functions satisfy some quality tests, If matrix P (given by Eq. (4)) has rank m and np m  , it can be uniquely factored as  P QR (15) where matrix Q   np x m is orthogonal ( Q T Q = I ) and matrix R   m x m is upper triangular with positive diagonal elements (a similar procedure, based on columns pivoting, can be applied for cases where matrix P is rank deficient or near rank deficient). In order to apply the QR factorization for solving our WLSQ problem, it is necessary to obtain an equivalent unweighted problem.…”
Section: Numerical Finite Point Approximations On Clouds Of Pointsmentioning
confidence: 99%
“…There is a vast array of meshfree methods available, as described by Liu et al [26,27]. Some of the more popular meshfree methods are the local radial point interpolation method (LRPIM) [28,29], meshless local Petrov-Galerkin (MLPG) [30], finite point method (FPM) [31], as well as the smoothed particle hydrodynamics method (SPH) [32,33]. Fraser et al [34][35][36][37][38][39][40][41][42][43] have recently developed an advanced meshfree framework on the graphics-processing unit (GPU) to simulate the entire FSW process.…”
Section: Introductionmentioning
confidence: 99%
“…Least-squares meshless 2.1. Moving least-squares shape functions Among the available meshless approximation schemes, the Moving Least-Squares (MLS) method [22] is generally considered to be one of the best methods to interpolate random data with a reasonable accuracy due to its completeness, robustness, and continuity [23,24]. With the MLS interpolation, unknown function, (x), is approximated by:…”
Section: Introductionmentioning
confidence: 99%