The least-squares meshfree method for solving linear elastic problems

A meshfree method based on the first-order least-squares formulation for linear elasticity is presented. In the authors' previous work, the least-squares meshfree method has been shown to be highly robust to integration errors with the numerical examples of Poisson equation. In the present work, conventional formulation and compatibility-imposed formulation for linear elastic problems are studied on the convergence behavior of the solution and the robustness to the inaccurate integration using simply constructed background cells. In the least-squares formulation, both primal and dual variables can be approximated by the same function space. This can lead to higher rate of convergence for dual variables than Galerkin formulation. In general, the incompressible locking can be alleviated using mixed formulations. However, in meshfree framework these approaches involve an additional use of background grids to implement lower approximation space for dual variables. This difficulty is avoided in the present method and numerical examples show the uniform convergence performance in the incompressible limit. Therefore the present method has little burden of the requirement of background cells for the purposes of integration and alleviating the incompressible locking.
Publisher
SPRINGER
Issue Date
2003-02
Language
ENG
Keywords

INCOMPRESSIBLE FINITE ELASTICITY; FREE GALERKIN METHOD; COMPUTATIONAL MECHANICS; NODAL INTEGRATION

Citation

COMPUTATIONAL MECHANICS, v.30, no.3, pp.196 - 211

ISSN
0178-7675
URI
http://hdl.handle.net/10203/3148
Appears in Collection
ME-Journal Papers(저널논문)
  • Hit : 383
  • Download : 168
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 21 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0