Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 54 min ago
PreprintarXiv licencearXiv

An arbitrary-order BGG-based discrete scheme for the Reissner--Mindlin plate problem on polygonal meshes

  • Arax Leroy
Open at sourcePDFDOICite

Abstract

We design and analyse an arbitrary-order numerical scheme for the Reissner--Mindlin plate problem on general polygonal meshes. The scheme is derived from the Hodge--Laplacian associated with a discrete Bernstein--Gelfand--Gelfand (BGG) twisted complex and exploits a discrete H2-based construction for the transverse displacement. We establish a discrete Korn inequality for the underlying Discrete de Rham method (DDR) spaces and prove the convergence of the method. At the lowest order, the analysis yields an error estimate that is uniform with respect to the plate thickness, showing that the scheme is locking-free. Numerical experiments on several families of polygonal meshes support the theoretical results and illustrate the benefits of the enhanced continuity of the transverse displacement discretisation.

Related

  1. An Arbitrary-Order Augmented Lagrangian Discrete De Rham Scheme for Contact Mechanics with Tresca Friction
    Jérôme Droniou, Raman Kumar, Roland Masson
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingGeneral physicsHALarXiv
  2. On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
    Juntai Zhou
    arXivPreprintarXiv licenceFull textAlgebra & number theoryQuantum physics & quantum informationarXiv
  3. The narrow escape problem in arbitrary dimension
    Louis Carillo, Tony Lelièvre, Thomas Normand +2
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsProbabilityarXiv
  4. Three-dimensional stress-gradient non-locality problem: Displacement field for an arbitrary and a conservative force
    Slađan Jelić, Dušan Zorica
    arXivPreprintarXiv licenceFull textMathematical physicsarXiv
  5. The Discrete Lp Minkowski Problem for Negative p
    Junjie Shan
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsGeometry & topologyarXiv

Cite

BibTeXRIS
BibTeX
@misc{leroy2026arbitraryorder,
  title = {{An arbitrary-order BGG-based discrete scheme for the Reissner--Mindlin plate problem on polygonal meshes}},
  author = {Arax Leroy},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.17122},
  eprint = {2609.17122},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.17122},
}
RIS
TY  - UNPB
TI  - An arbitrary-order BGG-based discrete scheme for the Reissner--Mindlin plate problem on polygonal meshes
AU  - Arax Leroy
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.17122
UR  - https://arxiv.org/abs/2609.17122
AB  - We design and analyse an arbitrary-order numerical scheme for the Reissner--Mindlin plate problem on general polygonal meshes. The scheme is derived from the Hodge--Laplacian associated with a discrete Bernstein--Gelfand--Gelfand (BGG) twisted complex and exploits a discrete H_2-based construction for the transverse displacement. We establish a discrete Korn inequality for the underlying Discrete de Rham method (DDR) spaces and prove the convergence of the method. At the lowest order, the analysis yields an error estimate that is uniform with respect to the plate thickness, showing that the scheme is locking-free. Numerical experiments on several families of polygonal meshes support the theoretical results and illustrate the benefits of the enhanced continuity of the transverse displacement discretisation.
ER  -