z-logo
Premium
Adaptive superposition of finite element meshes in non‐linear transient solid mechanics problems
Author(s) -
Yue Z.,
Robbins D. H.
Publication year - 2007
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.2067
Subject(s) - superposition principle , finite element method , superconvergence , estimator , polygon mesh , transient (computer programming) , computer science , adaptive mesh refinement , mathematics , algorithm , mathematical optimization , mathematical analysis , geometry , structural engineering , computational science , engineering , statistics , operating system
An s‐adaptive finite element procedure is developed for the transient analysis of 2‐D solid mechanics problems with material non‐linearity due to progressive damage. The resulting adaptive method simultaneously estimates and controls both the spatial error and temporal error within user‐specified tolerances. The spatial error is quantified by the Zienkiewicz–Zhu error estimator and computed via superconvergent patch recovery, while the estimation of temporal error is based on the assumption of a linearly varying third‐order time derivatives of the displacement field in conjunction with direct numerical time integration. The distinguishing characteristic of the s‐adaptive procedure is the use of finite element mesh superposition (s‐refinement) to provide spatial adaptivity. Mesh superposition proves to be particularly advantageous in computationally demanding non‐linear transient problems since it is faster, simpler and more efficient than traditional h‐refinement schemes. Numerical examples are provided to demonstrate the performance characteristics of the s‐adaptive method for quasi‐static and transient problems with material non‐linearity. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here