Discrete de Rham (DDR) complexes for compatible approximations of physical problems on general meshes

Daniele A. Di Pietro

Université de Montpellier

Friday 26th May 2023

14:00:00

Aula Saleri

The well-posedness of relevant physical models expressed in terms of partial differential equations (PDE) hinges on subtle analytical, homological, and algebraic properties underlying Hilbert complexes [1]. The best-known example is the de Rham complex which, in practically relevant situations, can be expressed through vector proxies as the sequence of Hilbert spaces H1, H(curl), H(div), and L2 connected by the vector calculus operators grad, curl, div. In the first part of this presentation, we illustrate the role of the de Rham complex in the well-posedness of several PDE problems arising in the modelling of nuclear facilities. The design of efficient numerical methods for such problems is challenging for several reasons: on one hand, stability requires to mimic, at the discrete level, the homological and analytical properties of the de Rham complex (leading to the notion of “compatible method”); on the other hand, the complicated geometrical features of the domain and behaviours of the solution require a great flexibility in terms of supported meshes and approximation orders. In the second part of this presentation we provide an introduction to the recently introduced Discrete de Rham (DDR) paradigm [3,4] for the design and analysis of compatible discretization methods supporting general polyhedral meshes and arbitrary orders. The general principle of DDR methods is to replace both spaces and operators by discrete counterparts designed so as to be compatible with the cohomology properties of the continuous complex. Specifically: - The discrete spaces are spanned by vectors of polynomials with components attached to mesh entities in order to mimic, through their single-valuedness, global (complete or partial) continuity properties of the continuous spaces. The local polynomial spaces can be either full or incomplete. - The discrete operators are obtained in two steps: first, reconstructions in full polynomial spaces are built mimicking an approximate version of the Stokes formula; second, whenever needed, the L2-orthogonal projection on the appropriate incomplete polynomial space is taken. - A full set of results for DDR methods have been recently proved [3], including cohomology-related properties, Poincaré inequalities, as well as primal and adjoint consistency of the discrete vector calculus operators. An overview of such results, along with examples of applications, is provided. In [2], the algebraic results have been generalized through the used of differential forms, leading to a Polytopal Exterior Calculus framework. The material in this presentation is mostly taken from joint works with F. Bonaldi, J. Droniou, K. Hu, F. Rapetti. [1] D. Arnold. Finite Element Exterior Calculus. SIAM, 2018. [2] F. Bonaldi, D. A. Di Pietro, J. Droniou, and K. Hu. An exterior calculus framework for polytopal methods. Mar. 2023. [3] D. A. Di Pietro and J. Droniou. “An arbitrary-order discrete de Rham complex on polyhedral meshes: Exactness, Poincaré inequalities, and consistency”. In: Found. Comput. Math. 23 (2023), pp. 85–164. [4] D. A. Di Pietro, J. Droniou, and F. Rapetti. “Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra”. In: Math. Models Methods Appl. Sci. 30.9 (2020), pp. 1809–1855. Contatto: paola.antonietti@polimi.it