Advertisement

Computational Mechanics

, Volume 21, Issue 3, pp 211–222 | Cite as

A modified collocation method and a penalty formulation for enforcing the essential boundary conditions in the element free Galerkin method

  • T. Zhu
  • S. N. Atluri
Article

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 conventional finite element method. Direct imposition of essential boundary conditions for the element free Galerkin (EFG) method is always difficult because the shape functions from the Moving Least Squares approximation do not have the delta function property. In the prior literature, a direct collocation of the fictitious nodal values û used as undetermined coefficients in the MLS approximation, u h (x) [u h (x)=Φ·û], was used to enforce the essential boundary conditions. A modified collocation method using the actual nodal values of the trial function u h (x) is presented here, to enforce the essential boundary conditions. This modified collocation method is more consistent with the variational basis of the EFG method. Alternatively, a penalty formulation for easily imposing the essential boundary conditions in the EFG method with the MLS approximation is also presented. The present penalty formulation yields a symmetric positive definite system stiffness matrix. Numerical examples show that the present penalty method does not exhibit any volumetric locking and retains high rates of convergence for both displacements and strain energy. The penalty method is easy to implement as compared to the Lagrange multiplier method, which increases the number of degrees of freedom and yields a non-positive definite system matrix.

Keywords

Penalty Method Lagrange Multiplier Method Essential Boundary Condition Definite System Element Connectivity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • T. Zhu
    • 1
  • S. N. Atluri
    • 1
  1. 1.Computational Mechanics Center, Georgia Institute of Technology, Atlanta, GA 30332-0356, USAGE

Personalised recommendations