We review basic design principles underpinning the construction of mimetic finite difference and a few finite volume and finite element schemes for mixed formulations of elliptic problems. For a class of low-order mixed-hybrid schemes, we show connections between these principles and prove that the consistency and stability conditions must lead to a member of the mimetic family of schemes regardless of the selected discretization framework. Finally, we give two examples of using flexibility of the mimetic framework: derivation of higher-order schemes and convergent schemes for nonlinear problems with small diffusion coefficients.
In this paper we prove a complete panel of consistency results for the discrete de Rham (DDR) complex introduced in the companion paper [D. A. Di Pietro and J. Droniou, An arbitrary-order discrete de Rham complex on polyhedral meshes. Part I: Exactness and Poincaré inequalities, 2021, submitted], including primal and adjoint consistency for the discrete vector calculus operators, and consistency of the corresponding potentials. The theoretical results are showcased by performing a full convergence analysis for a DDR approximation of a magnetostatics model. Numerical results on three-dimensiona…
In this work we analyze a virtual element method on polyhedral meshes for solving the sixth-order elliptic problem with simply supported boundary conditions. We apply the Ciarlet-Raviart arguments to introduce an auxiliary unknown $σ:=-Δ^2 u$ and to search the main uknown $u$ in the $H^2\cap H_0^1$ Sobolev space. The virtual element discretization is well possed on a $C^1\times C^0$ virtual element spaces. We also provide the convergence and error estimates results. Finally, we report a series of numerical tests to verify the performance of numerical scheme.
Discrete Sobolev and Trudinger inequalities on polyhedral meshes
Univ. Lille, CNRS, Inria（里尔大学、法国国家科学研究中心、法国数字科学与技术研究所）；Institut de Mathématiques de Toulouse（图卢兹数学研究所；图卢兹大学；法国国家科学研究中心）；UMR5219 - Université de Toulouse（贡比涅技术大学）；CNRS - UPS；Université de Technologie de Compiègne
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 D…
The purpose of the present paper is to develop $C^1$ Virtual Elements in three dimensions for linear elliptic fourth order problems, motivated by the difficulties that standard conforming Finite Elements encounter in this framework. We focus the presentation on the lowest order case, the generalization to higher orders being briefly provided in the Appendix. The degrees of freedom of the proposed scheme are only 4 per mesh vertex, representing function values and gradient values. Interpolation error estimates for the proposed space are provided, together with a set of numerical tests to valida…
We present the design of a mesh quality indicator that can predict the behavior of the Virtual Element Method (VEM) on a given mesh family or finite sequence of polyhedral meshes (dataset). The mesh quality indicator is designed to measure the violation of the mesh regularity assumptions that are normally considered in the convergence analysis. We investigate the behavior of this new mathematical tool on the lowest-order conforming approximation of the three-dimensional Poisson equation. This work also assesses the convergence rate of the VEM when applied to very general polyhedral meshes, inc…
Continuous 3D Finite Element Subgrid Basis Functions for Discontinuous Galerkin Methods on Polyhedral Meshes
De Vinci Higher Education（德文奇高等教育）；De Vinci Research Center（德文奇研究中心）；CNR IMATI（意大利国家研究委员会应用数学研究所）；Laboratoire de Mathématiques UMR 5127 CNRS, Université Savoie Mont Blanc（萨瓦省-蒙布朗大学CNRS第5127号数学实验室）；Department of Mathematics and Computer Science, University of Ferrara（费拉拉大学数学与计算机科学系）
In this paper we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into ranges of vector calculus operators and complements linked to the spaces in the Koszul complex. The DDR complex is fully discrete, meaning that both the spaces and discrete calculus operators are replaced by discrete counterparts, and satisfies suitable exactness properties depending on the topology of the domain. In conjunction with bespoke discrete counterparts of $L^2$-products, it can be used to design schemes for partial differen…
This paper introduces a novel method for the efficient and accurate computation of volume fractions on unstructured polyhedral meshes, where the phase boundary is an orientable hypersurface, implicitly given as the iso-contour of a sufficiently smooth level-set function. Locally, i.e. in each mesh cell, we compute a principal coordinate system in which the hypersurface can be approximated as the graph of an osculating paraboloid. A recursive application of the \textsc{Gaussian} divergence theorem then allows to analytically transform the volume integrals to curve integrals associated to the po…
A simple but successful strategy for building a discrete diffusion operator in finite volume schemes of industrial use is to correct the standard two-point flux approximation with a term accounting for the local mesh non-orthogonality. Practical experience with a variety of different mesh typologies, including non-orthogonal tetrahedral, hexahedral and polyhedral meshes, has shown that this discrete diffusion operator is accurate and robust whenever the mesh is not too distorted and sufficiently regular. In this work, we show that this approach can be interpreted as equivalent to introducing a…
Solutions to the wave equation in the exterior of a polyhedral domain or a screen in $\mathbb{R}^3$ exhibit singular behavior from the edges and corners. We present quasi-optimal $hp$-explicit estimates for the approximation of the Dirichlet and Neumann traces of these solutions for uniform time steps and (globally) quasi-uniform meshes on the boundary. The results are applied to an $hp$-version of the time domain boundary element method. Numerical examples confirm the theoretical results for the Dirichlet problem both for screens and polyhedral domains.
We present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is easily extendable to other discontinuous Galerkin discretizations, including the Local DG method and the Interior Penalty method. We demonstrate excellent solver performance for Poisson's equation, provided a flux formulation is used for the operator coarsening and a suitable switch function chosen for the numerical fluxes.
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well and states new issues, here tackled, concerning good quality mesh elements and reliability of the simulations. In this paper we numerically investigate optimality with respect to the number of degrees of freedom of the numerical solutions obtained by the different refinement strategies proposed. A geometrically complex geophysical problem is used as test prob…
In recent papers the author introduced a simple alternative to isoparametric finite elements of the n-simplex type, to enhance the accuracy of approximations of second-order boundary value problems with Dirichlet conditions, posed in smooth curved domains. This technique is based upon trial-functions consisting of piecewise polynomials defined on straight-edged triangular or tetrahedral meshes, interpolating the Dirichlet boundary conditions at points of the true boundary. In contrast the test-functions are defined upon the standard degrees of freedom associated with the underlying method for …
In this paper we analyze the error as well for the semi-discretization as the full discretization of a time-dependent convection-diffusion problem. We use for the discretization in space the local discontinuous Galerkin (LDG) method on a class of layer-adapted meshes including Shishkin-type and Bakhvalov-type meshes and the implicit $θ$-scheme in time. For piecewise tensor-product polynomials of degree $k$ we obtain uniform or almost uniform error estimates with respect to space of order $k+1/2$ in some energy norm and optimal error estimates with respect to time. Our analysis is based on care…
The aim of this work is to introduce and analyze a finite element discontinuous Galerkin method on polygonal meshes for the numerical discretization of acoustic waves propagation through poroelastic materials. Wave propagation is modeled by the acoustics equations in the acoustic domain and the low-frequency Biot's equations in the poroelastic one. The coupling is realized by means of (physically consistent) transmission conditions, imposed on the interface between the domains, modeling different pore configurations. For the space discretization, we introduce and analyze a high-order discontin…
