A comparison study of the efficiency and accuracy of a variety of meshless trial and test functions is presented in this paper, based on the general concept of the meshless local Petrov-Galerkin (MLPG) method. 5 types of trial functions, and 6 types of test functions are explored. Different test functions result in different MLPG methods, and six such MLPG methods are presented in this paper. I...

The numerical implementation of the truly Meshless Local Petrov-Galerkin (MLPG) type weakforms of the displacement and traction boundary integral equations is presented, for solids undergoing small deformations. In the accompanying part I of this paper, the general MLPG/BIE weak-forms were presented [Atluri, Han and Shen (2003)]. The MLPG weak forms provide the most general basis for the numeri...

The paper provides a computational technique that allows to compare all linear methods for PDE solving that use the same input data. This is done by writing them as linear recovery formulas for solution values as linear combinations of the input data, and these formulas are continuous linear functionals on Sobolev spaces. Calculating the norm of these functionals on a fixed Sobolev space will t...

This is the second in a series of two papers generated from a study on probabilistic meshless analysis of cracks. In this paper, a stochastic meshless method is presented for probabilistic fracture-mechanics analysis of linear-elastic cracked structures. The method involves an element-free Galerkin method for calculating fracture response characteristics; statistical models of uncertainties in ...

In this paper, we articulate a novel meshless computational paradigm for the effective modeling, accurate physical simulation, and rapid visualization of solid objects. The uniqueness of our approach is that both the interior and the boundary of our new volumetric representation are point-based, generalizing the powerful and popular method of point-sampled surfaces. We also build the point-base...

Introduction Moving least squares approximation is one kind of meshless methods in which the approximation is built from nodes only. Comparing to mesh-based methods, meshless methods have advantages on (1) refining is simpler to incorporate, (2) moving discontinuities can be treated easily, (3) large deformation can be handled robustly, (4) higher-order continuous shape functions, (5) non-local...

Meshless methods have been extensively popularized in literature in recent years, due to their flexibility in solving boundary value problems. The meshless local Petrov-Galerkin(MLPG) method for solving the bending problem of the thin plate is presented and discussed in the present paper. The method uses the moving least-squares approximation to interpolate the solution variables, and employs a...

A comparison between weak form meshless local Petrov-Galerkin method (MLPG) and strong form meshless diffuse approximate method (DAM) is performed for the diffusion equation in two dimensions. The shape functions are in both methods obtained by moving least squares (MLS) approximation with the polynomial weight function of the fourth order on the local support domain with 13 closest nodes. The ...

The Local Point Interpolation Method (LPIM) is a newly developed truly meshless method, based on the idea of Meshless Local Petrov-Galerkin (MLPG) approach. In this paper, a new LPIM formulation is proposed to deal with 4th order boundary-value and initial-value problems for static and dynamic analysis (stability, free vibration and forced vibration) of beams. Local weak forms are developed usi...

This is the first in a series of two papers generated from a study on probabilistic meshless analysis of cracks. In this paper (Part I), a Galerkin-based meshless method is presented for predicting first-order derivatives of stress-intensity factors with respect to the crack size in a linear-elastic structure containing a single crack. The method involves meshless discretization of cracked stru...