Volume 47, Number 4, July-August 2013
|Page(s)||1185 - 1205|
|Published online||17 June 2013|
Quadratic finite elements with non-matching grids for the unilateral boundary contact
1 LJLL, C.N.R.S. Université Pierre et
Marie Curie, B.C. 187, 4 place
Paris Cedex 05,
2 LMIA, EA CNRS, Université deq Haute Alsace, Rue des Frères Lumière, 68096 Mulhouse, France.
3 LMAC, EA 2222, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne Cedex, France.
4 I2M (UMR CNRS 5295), Site ENSCBP, 16 Avenue Pey Berland, 33607 Pessac Cedex, France.
5 LJLL, C.N.R.S. Université Pierre et Marie Curie, B.C. 187, 4 place Jussieu, 75252 Paris Cedex 05, France.
Revised: 24 September 2012
We analyze a numerical model for the Signorini unilateral contact, based on the mortar method, in the quadratic finite element context. The mortar frame enables one to use non-matching grids and brings facilities in the mesh generation of different components of a complex system. The convergence rates we state here are similar to those already obtained for the Signorini problem when discretized on conforming meshes. The matching for the unilateral contact driven by mortars preserves then the proper accuracy of the quadratic finite elements. This approach has already been used and proved to be reliable for the unilateral contact problems even for large deformations. We provide however some numerical examples to support the theoretical predictions.
Mathematics Subject Classification: 35J85 / 65N30 / 74M15
Key words: Unilateral contact conditions / quadratic finite elements / non-matching grids / mortar matching
© EDP Sciences, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.