An arbitrary-order discrete rot-rot complex on polygonal meshes with application to a quad-rot problem

by   Daniele A. Di Pietro, et al.

In this work, following the discrete de Rham (DDR) approach, we develop a discrete counterpart of a two-dimensional de Rham complex with enhanced regularity. The proposed construction supports general polygonal meshes and arbitrary approximation orders. We establish exactness on a contractible domain for both the versions of the complex with and without boundary conditions and, for the former, prove a complete set of Poincaré-type inequalities. The discrete complex is then used to derive a novel discretisation method for a quad-rot problem which, unlike other schemes in the literature, does not require the forcing term to be prepared. We carry out complete stability and convergence analyses for the proposed scheme and provide numerical validation of the results.


page 1

page 2

page 3

page 4


A fully discrete plates complex on polygonal meshes with application to the Kirchhoff-Love problem

In this work we develop a novel fully discrete version of the plates com...

An arbitrary-order discrete de Rham complex on polyhedral meshes. Part II: Consistency

In this paper we prove a complete panel of consistency results for the d...

A polytopal method for the Brinkman problem robust in all regimes

In this work we develop a discretisation method for the Brinkman problem...

A serendipity fully discrete div-div complex on polygonal meshes

In this work we address the reduction of face degrees of freedom (DOFs) ...

A DDR method for the Reissner-Mindlin plate bending problem on polygonal meshes

In this work we propose a discretisation method for the Reissner–Mindlin...

Two arbitrary-order constraint-preserving schemes for the Yang–Mills equations on polyhedral meshes

Two numerical schemes are proposed and investigated for the Yang–Mills e...

Please sign up or login with your details

Forgot password? Click here to reset