Search

In this work we address the problem of finding serendipity versions of approximate de Rham complexes with enhanced regularity. The starting point is a new abstract construction of general scope which, given three complexes linked by extension and reduction maps, generates a fourth complex with cohomology isomorphic to the former three. This construction is used to devise new serendipity versions of rot-rot and Stokes complexes derived in the Discrete de Rham spirit.

In this work we study the stability, convergence, and pressure-robustness of discretization methods for incompressible flows with hybrid velocity and pressure. Specifically, focusing on the Stokes problem, we identify a set of assumptions that yield inf-sup stability as well as error estimates which distinguish the velocity- and pressure-related contributions to the error. We additionally identify the key properties under which the pressure-related contributions vanish in the estimate of the velocity, thus leading to pressure-robustness. Several examples of existing and new schemes that fit into the framework are provided, and extensive numerical validation of the theoretical properties is provided.

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.

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\'eclet numbers. A set of numerical tests supports the theoretical derivations.

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.

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., Comment: 33 pages, 15 figures

In this paper we prove Poincar\'e inequalities for the Discrete de Rham (DDR) sequence on a general connected polyhedral domain $\Omega$ of $\mathbb{R}^3$. We unify the ideas behind the inequalities for all three operators in the sequence, deriving new proofs for the Poincar\'e inequalities for the gradient and the divergence, and extending the available Poincar\'e inequality for the curl to domains with arbitrary second Betti numbers. A key preliminary step consists in deriving "mimetic" Poincar\'e 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., Comment: 24 pages

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.

We develop in this work the first polytopal complexes of differential forms. These complexes, inspired by the Discrete De Rham and the Virtual Element approaches, are discrete versions of the de Rham complex of differential forms built on meshes made of general polytopal elements. Both constructions benefit from the high-level approach of polytopal methods, which leads, on certain meshes, to leaner constructions than the finite element method. We establish commutation properties between the interpolators and the discrete and continuous exterior derivatives, prove key polynomial consistency results for the complexes, and show that their cohomologies are isomorphic to the cohomology of the continuous de Rham complex.

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.

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\'e-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.

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\'e 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.

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\'e--Korn-type inequalities for hybrid fields.

In a recent work [10], we have introduced a pressure-robust Hybrid High-Order method for the numerical solution of the incompressible Navier-Stokes equations on matching simplicial meshes. Pressure-robust methods are characterized by error estimates for the velocity that are fully independent of the pressure. A crucial question was left open in that work, namely whether the proposed construction could be extended to general polytopal meshes. In this paper we provide a positive answer to this question. Specifically, we introduce a novel divergence-preserving velocity reconstruction that hinges on the solution inside each element of a mixed problem on a subtriangulation, then use it to design discretizations of the body force and convective terms that lead to pressure robustness. An in-depth theoretical study of the properties of this velocity reconstruction, and their reverberation on the scheme, is carried out for polynomial degrees $k \geq 0$ and meshes composed of general polytopes. The theoretical convergence estimates and the pressure robustness of the method are confirmed by an extensive panel of numerical examples.

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.

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.

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.

We present an a posteriori error estimate based on equilibrated stress reconstructions for the finite element approximation of a unilateral contact problem with weak enforcement of the contact conditions. We start by proving a guaranteed upper bound for the dual norm of the residual. This norm is shown to control the natural energy norm up to a boundary term, which can be removed under a saturation assumption. The basic estimate is then refined to distinguish the different components of the error, and is used as a starting point to design an algorithm including adaptive stopping criteria for the nonlinear solver and automatic tuning of a regularization parameter. We then discuss an actual way of computing the stress reconstruction based on the Arnold-Falk-Winther finite elements. Finally, after briefly discussing the efficiency of our estimators, we showcase their performance on a panel of numerical tests.

In this work, we design and analyze a Hybrid High-Order (HHO) discretization method for incompressible flows of non-Newtonian fluids with power-like convective behaviour. We work under general assumptions on the viscosity and convection laws, that are associated with possibly different Sobolev exponents r > 1 and s > 1. After providing a novel weak formulation of the continuous problem, we study its well-posedness highlighting how a subtle interplay between the exponents r and s determines the existence and uniqueness of a solution. We next design an HHO scheme based on this weak formulation and perform a comprehensive stability and convergence analysis, including convergence for general data and error estimates for shear-thinning fluids and small data. The HHO scheme is validated on a complete panel of model problems., Comment: 34 pages, 3 figures, 3 tables. arXiv admin note: text overlap with arXiv:2003.13467

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.

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\'e 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-dimensional polyhedral meshes complete the exposition., Comment: This paper was merged with the previous "Part I", and both are now available as a single paper at arXiv:2101.04940

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 differential equations that benefit from the exactness of the sequence but, unlike classical (e.g., Raviart--Thomas--N\'ed\'elec) finite elements, are nonconforming. We prove a complete panel of results for the analysis of such schemes: exactness properties, uniform Poincar\'e inequalities, as well as primal and adjoint consistency. We also show how this DDR complex enables the design of a numerical scheme for a magnetostatics problem, and use the aforementioned results to prove stability and optimal error estimates for this scheme.

We derive novel error estimates for Hybrid High-Order (HHO) discretizations of Leray-Lions problems set in W^(1,p) with p in (1,2]. Specifically, we prove that, depending on the degeneracy of the problem, the convergence rate may vary between (k+1)(p-1) and (k+1), with k denoting the degree of the HHO approximation. These regime-dependent error estimates are illustrated by a complete panel of numerical experiments., Comment: 20 pages, 4 figures, 4 tables

We propose a $p$-multilevel preconditioner for Hybrid High-Order discretizations (HHO) of the Stokes equation, numerically assess its performance on two variants of the method, and compare with a classical Discontinuous Galerkin scheme. We specifically investigate how the combination of $p$-coarsening and static condensation influences the performance of the $V$-cycle iteration for HHO. Two different static condensation procedures are considered, resulting in global linear systems with a different number of unknowns and non-zero elements. An efficient implementation is proposed where coarse level operators are inherited using $L^2$-orthogonal projections defined over mesh faces and the restriction of the fine grid operators is performed recursively and matrix-free. The various resolution strategies are thoroughly validated on two- and three-dimensional problems.

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.

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\'e 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.

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., Comment: 28 pages, 4 figures

In this work, we introduce a novel abstract framework for the stability and convergence analysis of fully coupled discretisations of the poroelasticity problem and apply it to the analysis of Hybrid High-Order (HHO) schemes. A relevant feature of the proposed framework is that it rests on mild time regularity assumptions that can be derived from an appropriate weak formulation of the continuous problem. To the best of our knowledge, these regularity results for the Biot problem are new. A novel family of HHO discretisation schemes is proposed and analysed, and their performance numerically evaluated.

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.

In this work we construct and analyze a nonconforming high-order discretization method for the quasi-static single-phase nonlinear poroelasticity problem describing Darcean flow in a deformable porous medium saturated by a slightly compressible fluid. The nonlinear elasticity operator is discretized using a Hybrid High-Order method, while the Darcy operator relies on a Symmetric Weighted Interior Penalty discontinuous Galerkin scheme. The method is valid in two and three space dimensions, delivers an inf-sup stable discretization on general meshes including polyhedral elements and nonmatching interfaces, supports arbitrary approximation orders, and has a reduced cost thanks to the possibility of statically condensing a large subset of the unknowns for linearized versions of the problem. Moreover, the proposed construction can handle both nonzero and vanishing specific storage coefficients., Comment: 28 pages, 2 figures

In this work, we consider the Biot problem with uncertain poroelastic coefficients. The uncertainty is modelled using a finite set of parameters with prescribed probability distribution. We present the variational formulation of the stochastic partial differential system and establish its well-posedness. We then discuss the approximation of the parameter-dependent problem by non-intrusive techniques based on Polynomial Chaos decompositions. We specifically focus on sparse spectral projection methods, which essentially amount to performing an ensemble of deterministic model simulations to estimate the expansion coefficients. The deterministic solver is based on a Hybrid High-Order discretization supporting general polyhedral meshes and arbitrary approximation orders. We numerically investigate the convergence of the probability error of the Polynomial Chaos approximation with respect to the level of the sparse grid. Finally, we assess the propagation of the input uncertainty onto the solution considering an injection-extraction problem., Comment: 30 pages, 15 Figures

In this work we construct a low-order nonconforming approximation method for linear elasticity problems supporting general meshes and valid in two and three space dimensions. The method is obtained by hacking the Hybrid High-Order method, that requires the use of polynomials of degree $k\ge1$ for stability. Specifically, we show that coercivity can be recovered for $k=0$ by introducing a novel term that penalises the jumps of the displacement reconstruction across mesh faces. This term plays a key role in the fulfillment of a discrete Korn inequality on broken polynomial spaces, for which a novel proof valid for general polyhedral meshes is provided. Locking-free error estimates are derived for both the energy- and the $L^2$-norms of the error, that are shown to convergence, for smooth solutions, as $h$ and $h^2$, respectively (here, $h$ denotes the meshsize). A thorough numerical validation on a complete panel of two- and three-dimensional test cases is provided., Comment: 26 pages, 6 tables, and 4 Figures

In this work we propose a novel Hybrid High-Order method for the incompressible Navier--Stokes equations based on a formulation of the convective term including Temam's device for stability. The proposed method has several advantageous features: it supports arbitrary approximation orders on general meshes including polyhedral elements and non-matching interfaces; it is inf-sup stable; it is locally conservative; it supports both the weak and strong enforcement of velocity boundary conditions; it is amenable to efficient computer implementations where a large subset of the unknowns is eliminated by solving local problems inside each element. Particular care is devoted to the design of the convective trilinear form, which mimicks at the discrete level the non-dissipation property of the continuous one. The possibility to add a convective stabilisation term is also contemplated, and a formulation covering various classical options is discussed. The proposed method is theoretically analysed, and an energy error estimate in $h^{k+1}$ (with $h$ denoting the meshsize) is proved under the usual data smallness assumption. A thorough numerical validation on two and three-dimensional test cases is provided both to confirm the theoretical convergence rates and to assess the method in more physical configurations (including, in particular, the well-known two- and three-dimensional lid-driven cavity problems)., Comment: 44 pages, 8 figures, 3 tables

In this work, we present an abstract error analysis framework for the approximation of linear partial differential equation (PDE) problems in weak formulation. We consider approximation methods in fully discrete formulation, where the discrete and continuous spaces are possibly not embedded in a common space. A proper notion of consistency is designed, and, under a classical inf-sup condition, it is shown to bound the approximation error. This error estimate result is in the spirit of Strang's first and second lemmas, but applicable in situations not covered by these lemmas (because of a fully discrete approximation space). An improved estimate is also established in a weaker norm, using the Aubin--Nitsche trick. We then apply these abstract estimates to an anisotropic heterogeneous diffusion model and two classical families of schemes for this model: Virtual Element and Finite Volume methods. For each of these methods, we show that the abstract results yield new error estimates with a precise and mild dependency on the local anisotropy ratio. A key intermediate step to derive such estimates for Virtual Element Methods is proving optimal approximation properties of the oblique elliptic projector in weighted Sobolev seminorms. This is a result whose interest goes beyond the specific model and methods considered here. We also obtain, to our knowledge, the first clear notion of consistency for Finite Volume methods, which leads to a generic error estimate involving the fluxes and valid for a wide range of Finite Volume schemes. An important application is the first error estimate for Multi-Point Flux Approximation L and G methods. In the appendix, not included in the published version of this work, we show that classical estimates for discontinuous Galerkin methods can be obtained with simplified arguments using the abstract framework.

In this work, we develop and analyse a novel Hybrid High-Order discretisation of the Brinkman problem. The method hinges on hybrid discrete velocity unknowns at faces and elements and on discontinuous pressures. Based on the discrete unknowns, we reconstruct inside each element a Stokes velocity one degree higher than face unknowns, and a Darcy velocity in the Raviart-Thomas-N\'ed\'elec space. These reconstructed velocities are respectively used to formulate the discrete versions of the Stokes and Darcy terms in the momentum equation, along with suitably designed penalty contributions. The proposed construction is tailored to yield optimal error estimates that are robust throughout the entire spectrum of local (Stokes- or Darcy-dominated) regimes, as identified by a dimensionless number which can be interpreted as a friction coefficient. The singular limit corresponding to the Darcy equation is also fully supported by the method. Numerical examples corroborate the theoretical results. This paper also contains two contributions whose interest goes beyond the specific method and application treated in this work: an investigation of the dependence of the constant in the second Korn inequality on star-shaped domains and its application to the study of the approximation properties of the strain projector in general Sobolev seminorms.

In this work, we study advection-robust Hybrid High-Order discretizations of the Oseen equations. For a given integer $k\ge 0$, the discrete velocity unknowns are vector-valued polynomials of total degree $\le k$ on mesh elements and faces, while the pressure unknowns are discontinuous polynomials of total degree $\le k$ on the mesh. From the discrete unknowns, three relevant quantities are reconstructed inside each element: a velocity of total degree $\le(k+1)$, a discrete advective derivative, and a discrete divergence. These reconstructions are used to formulate the discretizations of the viscous, advective, and velocity-pressure coupling terms, respectively. Well-posedness is ensured through appropriate high-order stabilization terms. We prove energy error estimates that are advection-robust for the velocity, and show that each mesh element $T$ of diameter $h_T$ contributes to the discretization error with an $\mathcal{O}(h_T^{k+1})$-term in the diffusion-dominated regime, an $\mathcal{O}(h_T^{k+\frac12})$-term in the advection-dominated regime, and scales with intermediate powers of $h_T$ in between. Numerical results complete the exposition.

We develop a novel Hybrid High-Order method for the simulation of Darcy flows in fractured porous media. The discretization hinges on a mixed formulation in the bulk region and on a primal formulation inside the fracture. Salient features of the method include a seamless treatment of nonconforming discretizations of the fracture, as well as the support of arbitrary approximation orders on fairly general meshes. For the version of the method corresponding to a polynomial degree k \v{e} 0, we prove convergence in h^{k+1} of the discretization error measured in an energy-like norm. In the error estimate, we explicitly track the dependence of the constants on the problem data, showing that the method is fully robust with respect to the heterogeneity of the permeability coefficients, and it exhibits only a mild dependence on the square root of the local anisotropy of the bulk permeability. The numerical validation on a comprehensive set of test cases confirms the theoretical results.