Searcharxiv⌕ Search

arXiv subjects

Jérôme Droniou

Publications and source records attributed to Jérôme Droniou.

46 records · Page 3Linked to original sources

The Hessian discretisation method for fourth order linear elliptic equations

In this paper, we propose a unified framework, the Hessian discretisation method (HDM), which is based on four discrete elements (called altogether a Hessian discretisation) and a few intrinsic indicators of accuracy, independent of the considered model. An error estimate is obtained, using only these intrinsic indicators, when the HDM framework is applied to linear fourth order problems. It is shown that HDM encompasses a large number of numerical methods for fourth order elliptic problems: finite element methods (conforming and non-conforming) as well as finite volume methods. We also use the HDM to design a novel method, based on conforming $\mathbb{P}_1$ finite element space and gradient recovery operators. Results of numerical experiments are presented for this novel scheme and for a finite volume scheme.

math.NA↗

A Hybrid High-Order discretisation of the Brinkman problem robust in the Darcy and Stokes limits

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édélec 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.

math.NA↗

A unified analysis of elliptic problems with various boundary conditions and their approximation

We design an abstract setting for the approximation in Banach spaces of operators acting in duality. A typical example are the gradient and divergence operators in Lebesgue--Sobolev spaces on a bounded domain. We apply this abstract setting to the numerical approximation of Leray-Lions type problems, which include in particular linear diffusion. The main interest of the abstract setting is to provide a unified convergence analysis that simultaneously covers (i) all usual boundary conditions, (ii) several approximation methods. The considered approximations can be conforming, or not (that is, the approximation functions can belong to the energy space of the problem, or not), and include classical as well as recent numerical schemes. Convergence results and error estimates are given. We finally briefly show how the abstract setting can also be applied to other models, including flows in fractured medium, elasticity equations and diffusion equations on manifolds. A by-product of the analysis is an apparently novel result on the equivalence between general Poincar{é} inequalities and the surjectivity of the divergence operator in appropriate spaces.

math.NA↗

A discontinuous-skeletal method for advection-diffusion-reaction on general meshes

We design and analyze an approximation method for advection-diffusion-reaction equations where the (generalized) degrees of freedom are polynomials of order $k\ge0$ at mesh faces. The method hinges on local discrete reconstruction operators for the diffusive and advective derivatives and a weak enforcement of boundary conditions. Fairly general meshes with polytopal and nonmatching cells are supported. Arbitrary polynomial orders can be considered, including the case $k=0$ which is closely related to Mimetic Finite Difference/Mixed-Hybrid Finite Volume methods. The error analysis covers the full range of Péclet numbers, including the delicate case of local degeneracy where diffusion vanishes on a strict subset of the domain. Computational costs remain moderate since the use of face unknowns leads to a compact stencil with reduced communications. Numerical results are presented.

math.NA↗

Unified convergence analysis of numerical schemes for a miscible displacement problem

This article performs a unified convergence analysis of a variety of numerical methods for a model of the miscible displacement of one incompressible fluid by another through a porous medium. The unified analysis is enabled through the framework of the gradient discretisation method for diffusion operators on generic grids. We use it to establish a novel convergence result in $L^\infty(0,T; L^2(Ω))$ of the approximate concentration using minimal regularity assumptions on the solution to the continuous problem. The convection term in the concentration equation is discretised using a centred scheme. We present a variety of numerical tests from the literature, as well as a novel analytical test case. The performance of two schemes are compared on these tests; both are poor in the case of variable viscosity, small diffusion and medium to small time steps. We show that upstreaming is not a good option to recover stable and accurate solutions, and we propose a correction to recover stable and accurate schemes for all time steps and all ranges of diffusion.

math.NA↗

Discontinuous Skeletal Gradient Discretisation Methods on polytopal meshes

In this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomial on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart-Thomas-Nédélec subspace. We prove that the novel DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.

math.NA↗

A mixed finite element method for a sixth order elliptic problem

We consider a saddle point formulation for a sixth order partial differential equation and its finite element approximation, for two sets of boundary conditions. We follow the Ciarlet-Raviart formulation for the biharmonic problem to formulate our saddle point problem and the finite element method. The new formulation allows us to use the $H^1$-conforming Lagrange finite element spaces to approximate the solution. We prove a priori error estimates for our approach. Numerical results are presented for linear and quadratic finite element methods.

math.NA↗

A Hybrid High-Order method for Leray-Lions elliptic equations on general meshes

In this work, we develop and analyze a Hybrid High-Order (HHO) method for steady non-linear Leray-Lions problems. The proposed method has several assets, including the support for arbitrary approximation orders and general polytopal meshes. This is achieved by combining two key ingredients devised at the local level: a gradient reconstruction and a high-order stabilization term that generalizes the one originally introduced in the linear case. The convergence analysis is carried out using a compactness technique. Extending this technique to HHO methods has prompted us to develop a set of discrete functional analysis tools whose interest goes beyond the specific problem and method addressed in this work: (direct and) reverse Lebesgue and Sobolev embeddings for local polynomial spaces, $L^{p}$-stability and $W^{s,p}$-approximation properties for $L^{2}$-projectors on such spaces, and Sobolev embeddings for hybrid polynomial spaces. Numerical tests are presented to validate the theoretical results for the original method and variants thereof.

math.NA↗

Convergence in $C(\lbrack0,T\rbrack;L^2(Ω))$ of weak solutions to perturbed doubly degenerate parabolic equations

We study the behaviour of solutions to a class of nonlinear degenerate parabolic problems when the data are perturbed. The class includes the Richards equation, Stefan problem and the parabolic $p$-Laplace equation. We show that, up to a subsequence, weak solutions of the perturbed problem converge uniformly-in-time to weak solutions of the original problem as the perturbed data approach the original data. We do not assume uniqueness or additional regularity of the solution. However, when uniqueness is known, our result demonstrates that the weak solution is uniformly temporally stable to perturbations of the data. Beginning with a proof of temporally-uniform, spatially-weak convergence, we strengthen the latter by relating the unknown to an underlying convex structure that emerges naturally from energy estimates on the solution. The double degeneracy --- shown to be equivalent to a maximal monotone operator framework --- is handled with techniques inspired by a classical monotonicity argument and a simple variant of the compensated compactness phenomenon.

math.AP↗

A mixed finite volume scheme for anisotropic diffusion problems on any grid

We present a new finite volume scheme for anisotropic heterogeneous diffusion problems on unstructured irregular grids, which simultaneously gives an approximation of the solution and of its gradient. In the case of simplicial meshes, the approximate solution is shown to converge to the continuous ones as the size of the mesh tends to 0, and an error estimate is given. In the general case, we propose a slightly modified scheme for which we again prove the convergence, and give an error estimate. An easy implementation method is then proposed, and the efficiency of the scheme is shown on various types of grids.

math.NA↗