Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A discrete de Rham method for the Reissner-Mindlin plate bending problem on polygonal meshes (2105.11773v2)

Published 25 May 2021 in math.NA and cs.NA

Abstract: In this work we propose a discretisation method for the Reissner--Mindlin plate bending problem in primitive variables that supports general polygonal meshes and arbitrary order. The method is inspired by a two-dimensional discrete de Rham complex for which key commutation properties hold that enable the cancellation of the contribution to the error linked to the enforcement of the Kirchhoff constraint. Denoting by $k\ge 0$ the polynomial degree for the discrete spaces and by $h$ the meshsize, we derive for the proposed method an error estimate in $h{k+1}$ for general $k$, as well as a locking-free error estimate for the lowest-order case $k=0$. The theoretical results are validated on a complete panel of numerical tests.

Citations (6)

Summary

We haven't generated a summary for this paper yet.