A new Meshless Local Petrov-Galerkin (MLPG) approach in computational mechanics

@article{Atluri1998ANM,
  title={A new Meshless Local Petrov-Galerkin (MLPG) approach in computational mechanics},
  author={Satya N. Atluri and Tulong Zhu},
  journal={Computational Mechanics},
  year={1998},
  volume={22},
  pages={117-127}
}
  • S. Atluri, T. Zhu
  • Published 24 August 1998
  • Mathematics
  • Computational Mechanics
Abstract A local symmetric weak form (LSWF) for linear potential problems is developed, and a truly meshless method, based on the LSWF and the moving least squares approximation, is presented for solving potential problems with high accuracy. The essential boundary conditions in the present formulation are imposed by a penalty method. The present method does not need a “finite element mesh”, either for purposes of interpolation of the solution variables, or for the integration of the “energy… 
The meshless local Petrov-Galerkin (MLPG) approach for solving problems in elasto-statics
Abstract The meshless local Petrov-Galerkin (MLPG) approach is an effective method for solving boundary value problems, using a local symmetric weak form and shape functions from the moving least
Local Petrov-Galerkin method for a thin plate
The meshless local Petrov-Galerkin (MLPG) method for solving the bending problem of the thin plate were presented and discussed. The method used the moving leastsquares approximation to interpolate
A Meshless Local Petrov-Galerkin Method for Solving the Bending Problem of a Thin Plate
Meshless methods have been extensively popularized in literature in recent years, due to their flex- ibility in solving boundary value problems. The mesh- less local Petrov-Galerkin(MLPG) method for
Meshless Local Petrov–Galerkin Formulation of Inverse Stefan Problem via Moving Least Squares Approximation
In this paper, we study the meshless local Petrov–Galerkin (MLPG) method based on the moving least squares (MLS) approximation for finding a numerical solution to the Stefan free boundary problem.
New concepts in meshless methods
Meshless methods have been extensively popularized in literature in recent years, due to their flexibility in solving boundary value problems. Two kinds of truly meshless methods, the meshless local
A Meshless Local Petrov-Galerkin (MLPG) Approach Based on the Regular Local Boundary Integral Equation for Linear Elasticity
The moving local Petrov-Galerkin (MLPG) approach based on a regular local boundary integral equation (RLBIE) to solve problems in elasto-statics is developed. The present method is a truly meshless
A Nonlinear Meshless Local Petrov-Galerkin (MLPG) Approach Based on the Nonlinear Regular Local Boundary Integral Equation
A nonliear meshless local Petrov-Galerkin (NMLPG) method for solving nonlinear boundary value problems, based on the nonlinear regular local boundary integral equation (NRLBIE) and the moving least
AN INTERPOLATING LOCAL PETROV–GALERKIN METHOD FOR POTENTIAL PROBLEMS
In this paper, based on the moving Kriging interpolation (MKI), the meshless interpolating local Petrov–Galerkin (ILPG) method is presented to solve two- and three-dimensional potential problems. In
...
...

References

SHOWING 1-10 OF 10 REFERENCES
On boundary conditions in the element-free Galerkin method
Abstract Accurate imposition of essential boundary conditions in the Element Free Galerkin (EFG) method often presents difficulties because the Moving Least Squares (MLS) interpolants, used in this
A meshless local boundary integral equation (LBIE) method for solving nonlinear problems
Abstract A new meshless method for solving nonlinear boundary value problems, based on the local boundary integral equation (LBIE) method and the moving least squares approximation, is proposed in
A local boundary integral equation (LBIE) method in computational mechanics, and a meshless discretization approach
Abstract The Galerkin finite element method (GFEM) owes its popularity to the local nature of nodal basis functions, i.e., the nodal basis function, when viewed globally, is non-zero only over a
Element‐free Galerkin methods
An element-free Galerkin method which is applicable to arbitrary shapes but requires only nodal data is applied to elasticity and heat conduction problems. In this method, moving least-squares
A modified collocation method and a penalty formulation for enforcing the essential boundary conditions in the element free Galerkin method
Abstract The Element free Galerkin method, which is based on the Moving Least Squares approximation, requires only nodal data and no element connectivity, and therefore is more flexible than the
Continuous meshless approximations for nonconvex bodies by diffraction and transparency
Continuous meshless approximations are developed for domains with non-convex boundaries, with emphasis on cracks. Two techniques are developed in the context of the element-free Galerkin method: a
Generalizing the finite element method: Diffuse approximation and diffuse elements
This paper describes the new “diffuse approximation” method, which may be presented as a generalization of the widely used “finite element approximation” method. It removes some of the limitations of
Advances in multiple scale kernel particle methods
TLDR
A novel approach to multiresolution analysis based on reproducing kernel particle methods (RKPM) and wavelets is presented, and the interpolation estimate and the convergence of Galerkin solutions are given.
A modi ® ed collocation & a penalty formulation for enforcing the essential boundary conditions in the element free Galerkin method
  • Comput . Mech
  • 1998
Element - free Galerkin meth
  • Int . J . Numer . Methods Eng
  • 1994