Searcharxiv⌕ Search

arXiv subjects

Daniele A. Di Pietro

Publications and source records attributed to Daniele A. Di Pietro.

At least 37 records · Page 2Linked to original sources

Arbitrary-order pressure-robust DDR and VEM methods for the Stokes problem on polyhedral meshes

This paper contains two major contributions. First we derive, following the discrete de Rham (DDR) and Virtual Element (VEM) paradigms, pressure-robust methods for the Stokes equations that support arbitrary orders and polyhedral meshes. Unlike other methods presented in the literature, pressure-robustness is achieved here without resorting to an $\boldsymbol{H}({\rm div})$-conforming construction on a submesh, but rather projecting the volumetric force onto the discrete $\boldsymbol{H}({\bf curl})$ space. The cancellation of the pressure error contribution stems from key commutation properties of the underlying DDR and VEM complexes. The pressure-robust error estimates in $h^{k+1}$ (with $h$ denoting the meshsize and $k\ge 0$ the polynomial degree of the DDR or VEM complex) are proven theoretically and supported by a panel of three-dimensional numerical tests. The second major contribution of the paper is an in-depth study of the relations between the DDR and VEM approaches. We show, in particular, that a complex developed following one paradigm admits a reformulation in the other, and that couples of related DDR and VEM complexes satisfy commuting diagram properties with the degrees of freedom maps.

math.NA↗

Homogeneous multigrid for hybrid discretizations: application to HHO methods

We prove the uniform convergence of the geometric multigrid V-cycle for hybrid high-order (HHO) and other discontinuous skeletal methods. Our results generalize previously established results for HDG methods, and our multigrid method uses standard smoothers and local solvers that are bounded, convergent, and consistent. We use a weak version of elliptic regularity in our proofs. Numerical experiments confirm our theoretical results.

math.NA↗

A Péclet-robust discontinuous Galerkin method for nonlinear diffusion with advection

We analyze a Discontinuous Galerkin method for a problem with linear advection-reaction and $p$-type diffusion, with Sobolev indices $p\in (1, \infty)$. The discretization of the diffusion term is based on the full gradient including jump liftings and interior-penalty stabilization while, for the advective contribution, we consider a strengthened version of the classical upwind scheme. The developed error estimates track the dependence of the local contributions to the error on local Péclet numbers. A set of numerical tests supports the theoretical derivations.

math.NA↗

A pressure-robust Discrete de Rham scheme for the Navier-Stokes equations

In this work we design and analyse a Discrete de Rham (DDR) method for the incompressible Navier-Stokes equations. Our focus is, more specifically, on the SDDR variant, where a reduction in the number of unknowns is obtained using serendipity techniques. The main features of the DDR approach are the support of general meshes and arbitrary approximation orders. The method we develop is based on the curl-curl formulation of the momentum equation and, through compatibility with the Helmholtz-Hodge decomposition, delivers pressure-robust error estimates for the velocity. It also enables non-standard boundary conditions, such as imposing the value of the pressure on the boundary. In-depth numerical validation on a complete panel of tests including general polyhedral meshes is provided. The paper also contains an appendix where bounds on DDR potential reconstructions and differential operators are proved in the more general framework of Polytopal Exterior Calculus.

math.NA↗

An a posteriori error analysis based on equilibrated stresses for finite element approximations of frictional contact

We consider the unilateral contact problem between an elastic body and a rigid foundation in a description that includes both Tresca and Coulomb friction conditions. For this problem, we present an a posteriori error analysis based on an equilibrated stress reconstruction in the Arnold--Falk--Winther space that includes a guaranteed upper bound distinguishing the different components of the error. This analysis is the starting point for the development of an adaptive algorithm including a stopping criterion for the generalized Newton method. This algorithm is then used to perform numerical simulations that validate the theoretical results.

math.NA↗

Uniform Poincaré inequalities for the Discrete de Rham complex on general domains

In this paper we prove Poincaré inequalities for the Discrete de Rham (DDR) sequence on a general connected polyhedral domain $Ω$ of $\mathbb{R}^3$. We unify the ideas behind the inequalities for all three operators in the sequence, deriving new proofs for the Poincaré inequalities for the gradient and the divergence, and extending the available Poincaré inequality for the curl to domains with arbitrary second Betti numbers. A key preliminary step consists in deriving "mimetic" Poincaré inequalities giving the existence and stability of the solutions to topological balance problems useful in general discrete geometric settings. As an example of application, we study the stability of a novel DDR scheme for the magnetostatics problem on domains with general topology.

math.NA↗

Cohomology of the discrete de Rham complex on domains of general topology

In this work we prove that, for a general polyhedral domain of $\mathbb{R}^3$, the cohomology spaces of the discrete de Rham complex of [Di Pietro and Droniou, An arbitrary-order discrete de Rham complex on polyhedral meshes: Exactness, Poincaré inequalities, and consistency, Found. Comput. Math., 2021, DOI: 10.1007/s10208-021-09542-8] are isomorphic to those of the continuous de Rham complex. This is, to the best of our knowledge, the first result of this kind for an arbitrary-order complex built from a general polyhedral mesh.

math.NA↗

A discrete three-dimensional divdiv complex on polyhedral meshes with application to a mixed formulation of the biharmonic problem

In this work, following the Discrete de Rham (DDR) paradigm, we develop an arbitrary-order discrete divdiv complex on general polyhedral meshes. The construction rests 1) on discrete spaces that are spanned by vectors of polynomials whose components are attached to mesh entities and 2) on discrete operators obtained mimicking integration by parts formulas. We provide an in-depth study of the algebraic properties of the local complex, showing that it is exact on mesh elements with trivial topology. The new DDR complex is used to design a numerical scheme for the approximation of biharmonic problems, for which we provide detailed stability and convergence analyses.

math.NA↗

A polytopal method for the Brinkman problem robust in all regimes

In this work we develop a discretisation method for the Brinkman problem that is uniformly well-behaved in all regimes (as identified by a local dimensionless number with the meaning of a friction coefficient) and supports general meshes as well as arbitrary approximation orders. The method is obtained combining ideas from the Hybrid High-Order and Discrete de Rham methods, and its robustness rests on a potential reconstruction and stabilisation terms that change in nature according to the value of the local friction coefficient. We derive error estimates that, thanks to the presence of cut-off factors, are valid across the all regimes and provide extensive numerical validation.

math.NA↗

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

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.

math.NA↗

Homological- and analytical-preserving serendipity framework for polytopal complexes, with application to the DDR method

In this work we investigate from a broad perspective the reduction of degrees of freedom through serendipity techniques for polytopal methods compatible with Hilbert complexes. We first establish an abstract framework that, given two complexes connected by graded maps, identifies a set of properties enabling the transfer of the homological and analytical properties from one complex to the other. This abstract framework is designed having in mind discrete complexes, with one of them being a reduced version of the other, such as occurring when applying serendipity techniques to numerical methods. We then use this framework as an overarching blueprint to design a serendipity DDR complex. Thanks to the combined use of higher-order reconstructions and serendipity, this complex compares favorably in terms of degrees of freedom (DOF) count to all the other polytopal methods previously introduced and also to finite elements on certain element geometries. The gain resulting from such a reduction in the number of DOFs is numerically evaluated on two model problems: a magnetostatic model, and the Stokes equations.

math.NA↗

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

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.

math.NA↗

A serendipity fully discrete div-div complex on polygonal meshes

In this work we address the reduction of face degrees of freedom (DOFs) for discrete elasticity complexes. Specifically, using serendipity techniques, we develop a reduced version of a recently introduced two-dimensional complex arising from traces of the three-dimensional elasticity complex. The keystone of the reduction process is a new estimate of symmetric tensor-valued polynomial fields in terms of boundary values, completed with suitable projections of internal values for higher degrees. We prove an extensive set of new results for the original complex and show that the reduced complex has the same homological and analytical properties as the original one. This paper also contains an appendix with proofs of general Poincaré--Korn-type inequalities for hybrid fields.

math.NA↗

A Hybrid High-Order method for creeping flows of non-Newtonian fluids

In this paper, we design and analyze a Hybrid High-Order discretization method for the steady motion of non-Newtonian, incompressible fluids in the Stokes approximation of small velocities. The proposed method has several appealing features including the support of general meshes and high-order, unconditional inf-sup stability, and orders of convergence that match those obtained for scalar Leray-Lions problems. A complete well-posedness and convergence analysis of the method is carried out under new, general assumptions on the strain rate-shear stress law, which encompass several common examples such as the power-law and Carreau-Yasuda models. Numerical examples complete the exposition.

math.NA↗

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 complex, an exact Hilbert complex relevant for the mixed formulation of fourth-order problems. The derivation of the discrete complex follows the discrete de Rham paradigm, leading to an arbitrary-order construction that applies to meshes composed of general polygonal elements. The discrete plates complex is then used to derive a novel numerical scheme for Kirchhoff--Love plates, for which a full stability and convergence analysis are performed. Extensive numerical tests complete the exposition.

math.NA↗

A discrete Weber inequality on three-dimensional hybrid spaces with application to the HHO approximation of magnetostatics

We prove a discrete version of the first Weber inequality on three-dimensional hybrid spaces spanned by vectors of polynomials attached to the elements and faces of a polyhedral mesh. We then introduce two Hybrid High-Order methods for the approximation of the magnetostatics model, in both its (first-order) field and (second-order) vector potential formulations. These methods are applicable on general polyhedral meshes, and allow for arbitrary orders of approximation. Leveraging the previously established discrete Weber inequality, we perform a comprehensive analysis of the two methods. We finally validate them on a set of test-cases.

math.NA↗

Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra

In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these sequences are directly amenable to computer implementation. Besides proving exactness, we show that the usual three-dimensional sequence of trimmed Finite Element spaces forms, through appropriate interpolation operators, a commutative diagram with our sequence, which ensures suitable approximation properties. A discussion on reconstructions of potentials and discrete $L^2$-products completes the exposition.

math.NA↗

An arbitrary-order method for magnetostatics on polyhedral meshes based on a discrete de Rham sequence

In this work, we develop a discretisation method for the mixed formulation of the magnetostatic problem supporting arbitrary orders and polyhedral meshes. The method is based on a global discrete de Rham (DDR) sequence, obtained by patching the local spaces constructed in [Di Pietro, Droniou, Rapetti, Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra, arXiv:1911.03616] by enforcing the single-valuedness of the components attached to the boundary of each element. The first main contribution of this paper is a proof of exactness relations for this global DDR sequence, obtained leveraging the exactness of the corresponding local sequence and a topological assembly of the mesh valid for domains that do not enclose any void. The second main contribution is the formulation and well-posedness analysis of the method, which includes the proof of uniform Poincaré inequalities for the discrete divergence and curl operators. The convergence rate in the natural energy norm is numerically evaluated on standard and polyhedral meshes. When the DDR sequence of degree $k\ge 0$ is used, the error converges as $h^{k+1}$, with $h$ denoting the meshsize.

math.NA↗