Design and analysis of finite volume methods for elliptic equations with oblique derivatives; application to Earth gravity field modelling
Jerome Droniou, Matej Medla, Karol Mikula

TL;DR
This paper develops and analyzes finite volume methods for elliptic equations with oblique boundary conditions, providing a generic framework, convergence proofs, and practical applications including Earth gravity field modeling.
Contribution
It introduces a novel generic finite volume framework for oblique boundary conditions, with convergence analysis and specific flux schemes validated by numerical tests and real-world data.
Findings
Optimal convergence rate of O(h) in energy norm.
Validated methods through extensive 3D numerical tests.
Successful application to Earth gravity potential data.
Abstract
We develop and analyse finite volume methods for the Poisson problem with boundary conditions involving oblique derivatives. We design a generic framework, for finite volume discretisations of such models, in which internal fluxes are not assumed to have a specific form, but only to satisfy some (usual) coercivity and consistency properties. The oblique boundary conditions are split into a normal component, which directly appears in the flux balance on control volumes touching the domain boundary, and a tangential component which is managed as an advection term on the boundary. This advection term is discretised using a finite volume method based on a centred discretisation (to ensure optimal rates of convergence) and stabilised using a vanishing boundary viscosity. A convergence analysis, based on the 3rd Strang Lemma \cite{DPD18}, is conducted in this generic finite volume framework,…
| 8.511e-01 | 7.311 | 5.536 | 3.322 | 6.768e-01 |
| 3.660e-01 | 7.427 | 6.394 | 3.279 | 4.295e-01 |
| 1.685e-01 | 7.920 | 5.949 | 3.402 | 3.508e-01 |
| 8.309e-02 | 7.879 | 5.967 | 3.383 | 2.798e-01 |
| 4.084e-02 | 8.267 | 6.870 | 3.510 | 2.089e-01 |
| 2.041e-02 | 8.655 | 6.584 | 3.585 | 1.669e-01 |
| 1.014e-02 | 8.356 | 6.854 | 3.589 | 1.426e-01 |
| Scheme (19) | ||||||||
|---|---|---|---|---|---|---|---|---|
| error | EOC | error | EOC | error | EOC | error | EOC | |
| 8.511e-01 | 2.092e-02 | 4.600e-02 | 1.886e-01 | 1.844e-01 | ||||
| 3.660e-01 | 9.412e-03 | 0.946 | 2.634e-02 | 0.660 | 1.022e-01 | 0.726 | 1.462e-01 | 0.275 |
| 1.685e-01 | 3.922e-03 | 1.128 | 1.270e-02 | 0.940 | 4.767e-02 | 0.982 | 9.298e-02 | 0.583 |
| 8.309e-02 | 1.958e-03 | 0.982 | 6.756e-03 | 0.893 | 2.475e-02 | 0.927 | 6.358e-02 | 0.537 |
| 4.084e-02 | 1.003e-03 | 0.942 | 3.570e-03 | 0.898 | 1.294e-02 | 0.913 | 4.248e-02 | 0.567 |
| 2.041e-02 | 5.155e-04 | 0.959 | 1.867e-03 | 0.934 | 6.661e-03 | 0.957 | 2.678e-02 | 0.665 |
| 1.014e-02 | 2.560e-04 | 1.000 | 9.360e-04 | 0.986 | 3.287e-03 | 1.009 | 1.587e-02 | 0.747 |
| Scheme (19) | ||||||||
|---|---|---|---|---|---|---|---|---|
| error | EOC | error | EOC | error | EOC | error | EOC | |
| 8.478e-01 | 1.508e-02 | 2.908e-02 | 1.066e-01 | 1.021e-01 | ||||
| 3.606e-01 | 9.891e-03 | 0.493 | 2.639e-02 | 0.113 | 8.779e-02 | 0.226 | 1.208e-01 | -0.197422 |
| 1.694e-01 | 5.583e-03 | 0.757 | 1.671e-02 | 0.605 | 5.182e-02 | 0.697 | 9.645e-02 | 0.298902 |
| 8.197e-02 | 3.237e-03 | 0.751 | 1.001e-02 | 0.705 | 2.929e-02 | 0.786 | 7.008e-02 | 0.439947 |
| 4.068e-02 | 1.803e-03 | 0.835 | 5.652e-03 | 0.815 | 1.571e-02 | 0.889 | 4.541e-02 | 0.619154 |
| 2.032e-02 | 9.617e-04 | 0.905 | 3.036e-03 | 0.895 | 8.098e-03 | 0.954 | 2.699e-02 | 0.749373 |
| 1.031e-02 | 5.041e-04 | 0.951 | 1.598e-03 | 0.945 | 4.148e-03 | 0.985 | 1.534e-02 | 0.832171 |
| Scheme (19) | ||||||||
|---|---|---|---|---|---|---|---|---|
| error | EOC | error | EOC | error | EOC | error | EOC | |
| 8.594e-01 | 1.402e-02 | 3.084e-02 | 1.103e-01 | 1.070e-01 | ||||
| 3.651e-01 | 7.731e-03 | 0.695 | 2.187e-02 | 0.401 | 7.795e-02 | 0.405 | 1.084e-01 | -0.015 |
| 1.703e-01 | 4.769e-03 | 0.633 | 1.455e-02 | 0.534 | 4.839e-02 | 0.625 | 9.136e-02 | 0.224 |
| 8.271e-02 | 2.620e-03 | 0.828 | 8.360e-03 | 0.767 | 2.636e-02 | 0.840 | 6.458e-02 | 0.480 |
| 4.070e-02 | 1.389e-03 | 0.894 | 4.520e-03 | 0.867 | 1.347e-02 | 0.947 | 4.045e-02 | 0.659 |
| 2.037e-02 | 7.382e-04 | 0.913 | 2.428e-03 | 0.897 | 6.985e-03 | 0.948 | 2.454e-02 | 0.721 |
| 1.018e-02 | 3.768e-04 | 0.969 | 1.248e-03 | 0.960 | 3.490e-03 | 1.000 | 1.378e-02 | 0.832 |
| 1.092 | 2.538e+01 | 5.468 | 3.296 | 6.074e-01 |
| 4.981e-01 | 1.336e+01 | 5.970 | 3.468 | 4.051e-01 |
| 2.375e-01 | 1.045e+01 | 6.228 | 3.297 | 3.691e-01 |
| 1.158e-01 | 1.017e+01 | 6.352 | 3.442 | 2.463e-01 |
| 5.733e-02 | 0.998e+01 | 6.324 | 3.426 | 1.460e-01 |
| 2.847e-02 | 1.029e+01 | 6.582 | 3.598 | 1.392e-01 |
| 1.454e-02 | 1.032e+01 | 6.761 | 3.580 | 8.204e-02 |
| Scheme (19) | ||||||||
|---|---|---|---|---|---|---|---|---|
| error | EOC | error | EOC | error | EOC | error | EOC | |
| 1.092 | 7.054e-03 | 9.644e-03 | 3.776e-02 | 3.620e-02 | ||||
| 4.981e-01 | 1.307e-03 | 2.148 | 2.189e-03 | 1.890 | 9.516e-03 | 1.756 | 1.205e-02 | 1.402 |
| 2.375e-01 | 3.656e-04 | 1.720 | 7.681e-04 | 1.414 | 3.249e-03 | 1.451 | 5.267e-03 | 1.117 |
| 1.158e-01 | 1.294e-04 | 1.446 | 3.335e-04 | 1.161 | 1.322e-03 | 1.252 | 2.698e-03 | 0.931 |
| 5.733e-02 | 5.493e-05 | 1.219 | 1.578e-04 | 1.065 | 5.788e-04 | 1.175 | 1.400e-03 | 0.932 |
| 2.847e-02 | 2.518e-05 | 1.114 | 7.580e-05 | 1.047 | 2.643e-04 | 1.119 | 7.200e-04 | 0.950 |
| 1.454e-02 | 1.248e-05 | 1.044 | 3.843e-05 | 1.011 | 1.285e-04 | 1.073 | 3.805e-04 | 0.949 |
| 1.089 | 3.228e+01 | 5.017 | 3.571 | 3.068e-01 |
| 4.928e-01 | 1.896e+01 | 6.270 | 3.551 | -6.303e-01 |
| 2.299e-01 | 1.207e+01 | 6.259 | 3.777 | -9.516e-01 |
| 1.159e-01 | 1.120e+01 | 6.819 | 3.838 | -1.138 |
| 5.813e-02 | 1.083e+01 | 7.246 | 3.904 | -1.524 |
| 2.867e-02 | 1.114e+01 | 6.890 | 4.253 | -1.403 |
| 1.462e-02 | 1.118e+01 | 6.914 | 4.232 | -1.642 |
| Scheme (19) | ||||||||
|---|---|---|---|---|---|---|---|---|
| error | EOC | error | EOC | error | EOC | error | EOC | |
| 1.089 | 7.577e-03 | 1.212e-02 | 5.851e-02 | 6.169e-02 | ||||
| 4.928e-01 | 2.595e-03 | 1.351 | 6.735e-03 | 0.740 | 4.232e-02 | 0.408 | 7.120e-02 | -0.180 |
| 2.299e-01 | 1.519e-03 | 0.7021 | 5.123e-03 | 0.358 | 2.766e-02 | 0.557 | 6.351e-02 | 0.150 |
| 1.159e-01 | 8.678e-04 | 0.817 | 3.163e-03 | 0.704 | 1.465e-02 | 0.928 | 4.295e-02 | 0.571 |
| 5.813e-02 | 4.763e-04 | 0.868 | 1.776e-03 | 0.835 | 7.250e-03 | 1.019 | 2.550e-02 | 0.754 |
| 2.867e-02 | 2.548e-04 | 0.885 | 9.569e-04 | 0.875 | 3.594e-03 | 0.993 | 1.433e-02 | 0.815 |
| 1.462e-02 | 1.335e-04 | 0.959 | 5.028e-04 | 0.955 | 1.793e-03 | 1.032 | 7.777e-03 | 0.907 |
| Scheme (19) | ||||||||
|---|---|---|---|---|---|---|---|---|
| error | EOC | error | EOC | error | EOC | error | EOC | |
| 8.605e-01 | 2.247e-02 | 4.945e-02 | 1.686e-01 | 1.610e-01 | ||||
| 3.606e-01 | 1.537e-02 | 0.436 | 4.232e-02 | 0.179 | 1.437e-01 | 0.184 | 2.014e-01 | -0.257 |
| 1.692e-01 | 1.088e-02 | 0.455 | 3.301e-02 | 0.328 | 1.060e-01 | 0.401 | 2.012e-01 | 0.001 |
| 8.347e-02 | 6.582e-03 | 0.712 | 2.109e-02 | 0.634 | 6.669e-02 | 0.655 | 1.647e-01 | 0.283 |
| 4.054e-02 | 3.756e-03 | 0.776 | 1.255e-02 | 0.718 | 4.010e-02 | 0.704 | 1.248e-01 | 0.384 |
| 2.043e-02 | 2.046e-03 | 0.886 | 7.078e-03 | 0.836 | 2.333e-02 | 0.790 | 9.148e-02 | 0.453 |
| 1.017e-02 | 1.100e-03 | 0.889 | 3.913e-03 | 0.848 | 1.342e-02 | 0.792 | 6.596e-02 | 0.468 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Design and analysis of finite volume methods for elliptic equations with oblique derivatives; application to Earth gravity field modelling
Jérôme Droniou School of Mathematics, Monash University, Melbourne (Australia), [email protected]
Matej Medla Department of Mathematics, Faculty of Civil Engineering, Slovak University of Technology, Radlinskeho 11, 810 05 Bratislava, Slovak Republic, [email protected]
Karol Mikula Department of Mathematics, Faculty of Civil Engineering, Slovak University of Technology, Radlinskeho 11, 810 05 Bratislava, Slovak Republic; Algoritmy:SK s.r.o., Sulekova 6, 81106 Bratislava, Slovak Republic, [email protected]
Abstract
We develop and analyse finite volume methods for the Poisson problem with boundary conditions involving oblique derivatives. We design a generic framework, for finite volume discretisations of such models, in which internal fluxes are not assumed to have a specific form, but only to satisfy some (usual) coercivity and consistency properties. The oblique boundary conditions are split into a normal component, which directly appears in the flux balance on control volumes touching the domain boundary, and a tangential component which is managed as an advection term on the boundary. This advection term is discretised using a finite volume method based on a centred discretisation (to ensure optimal rates of convergence) and stabilised using a vanishing boundary viscosity. A convergence analysis, based on the 3rd Strang Lemma [9], is conducted in this generic finite volume framework, and yields the expected optimal convergence rate in discrete energy norm.
We then describe a specific choice of numerical fluxes, based on a generalised hexahedral meshing of the computational domain. These fluxes are a corrected version of fluxes originally introduced in [29]. We identify mesh regularity parameters that ensure that these fluxes satisfy the required coercivity and consistency properties. The theoretical rates of convergence are illustrated by an extensive set of 3D numerical tests, including some conducted with two variants of the proposed scheme. A test involving real-world data measuring the disturbing potential in Earth gravity modelling over Slovakia is also presented.
Contents
1 Introduction
We consider in this work a Laplace equation with oblique boundary conditions:
[TABLE]
where is a bounded domain in with piecewise boundary, is a relatively open subset of that is fully contained in a smooth component of this boundary, and is a vector field such that for all . Here, denotes the outer normal to . We also assume that the -dimensional measure of is non-zero. On , can be decomposed into a normal and a tangential component to . After renormalising we can assume that the normal component is , and thus that
[TABLE]
The properties of ensure that is a tangential vector field on .
A motivation to study boundary value problem (BVP) (1) comes from Earth gravity field modelling. The Earth gravity potential fulfils outside the Earth a non-homogeneous elliptic equation
[TABLE]
where is the spin velocity of the Earth [21]. The magnitude of the total gravity vector is called gravity. If the measured gravity is prescribed on the Earth surface, i.e.
[TABLE]
then Eq. (3) with BC (4) represents the so-called nonlinear geodetic BVP for the actual gravity potential . The existence, uniqueness and other properties to the solution of this problem, and its variants, were studied extensively in physical geodesy community, see e.g. [1, 18, 24, 3, 17, 30, 20, 10, 11].
In Earth gravity field modelling, the actual gravity field is usually expressed as a sum of the selected model field and the remainder , i.e.
[TABLE]
If the model field is generated by an ellipsoid with the same mass as the Earth, rotating with the same spin velocity and with the constant surface potential equal to the geopotential (see [31] for a definition of , the potential on the mean sea surface level), then is called the normal gravity potential and is called the disturbing potential. This potential has no centrifugal component and it is generally accepted that the disturbing potential satisfies the Laplace equation outside the Earth, see e.g. [21, 22]. In the satellite era, people have been able to consider a bounded domain outside the Earth where an upper part of the boundary is given as a sphere at altitude of a chosen satellite mission, and the bottom part is given by a subset of the Earth surface [16, 29]. On this bottom part the nonlinear BC (4) is given and, on the upper part, as well as on the side boundaries if one focuses on a tesseroid above the Earth, the Dirichlet-type BC obtained from satellite gravity missions can be prescribed. This allows us to fix a solution to the satellite data . See Figure 1 for an illustration.
Such nonlinear satellite-fixed geodetic BVP [28] for the disturbing potential can be formulated as follows
[TABLE]
Using the relation for we get (7) in the form
[TABLE]
Letting
[TABLE]
be the actual gravity vector unit direction, we can rewrite the nonlinear boundary condition (7) as follows
[TABLE]
Since the unit vector is unknown and depends on , boundary condition (10) is still nonlinear. However, if we set in (9), which means that we approximate the unit direction of the actual gravity vector by the unit direction of the normal gravity vector equal to , we get a linear(ized) boundary condition
[TABLE]
where is the so-called normal gravity. Since all quantities depending on are given analytically, the equation (11) represents a linear oblique derivative boundary condition. Together with equations (1a) and (1c), they are called the fixed gravimetric boundary value problem in the geodetic community [1, 24, 22, 23, 8, 16, 29] and give a basis for determining the Earth gravity field when gravity measurements are known on the Earth surface. When we denote and consider the problem on a bounded domain outside the Earth, we end up with the oblique derivative BVP (1) (here, has unit length and, as previously mentioned, the decomposition (2) is obtained after rescaling ).
Let us briefly mention some results that can be found in the literature regarding the numerical approximation of second order equations with oblique derivative boundary conditions. In [5, 4] authors deal with the finite volume method for the oblique derivative boundary value problem in 2D case. In [5] they consider the oblique BC in the form
[TABLE]
where is a smooth function, is a derivative in the normal direction and is a derivative in tangential direction. They develop a finite volume scheme based on the upwind principle, prove its convergence and obtain an error estimate of order . In [4], convergence results are established for the Poisson and a parabolic equation with oblique derivative boundary condition in which is constant. The convergence results are not only obtained for the approximate finite volume solutions, but also for their discrete gradients. The error estimate of order is obtained theoretically, but numerical experiments presented in these works indicate a first order rate of convergence. In [2] the authors present and analyse a 2D finite element method for the oblique derivative boundary problem, where the oblique derivative boundary is given by a graph of a real function. Finite volume methods for solving oblique derivative problems in 3D domains were suggested and numerically investigated in [26, 27, 25, 29]. These schemes are based either on upwind or central approximation of the oblique derivative. A numerical approximation of a nonlinear problem with eikonal-type boundary condition (4) was presented in [28]. This approximation is based on an iterative update of the oblique derivative condition.
In this paper we introduce and analyse novel numerical scheme for solving 3D oblique derivative boundary value problems for the Laplace equation. For the first time, there is presented a convergence analysis and error estimates for a finite volume scheme solving the oblique derivative problem in 3D. The model comes from the Earth gravity field modelling on real Earth topography but can be used in other applications as well. The presented numerical approach is general and covers various possible discretisations of the Laplace equation inside the domain and it treats in a robust and stable way the oblique derivative boundary condition. We present numerical tests showing convergence properties of the novel scheme and compare them to further alternative numerical treatments of the oblique derivative. We also present a local Earth gravity field modelling for the region of Slovakia where we compare obtained numerical results with GPS-leveling measurements.
The paper is organised as follows. In Section 2 we present a generic finite volume method for solving the oblique derivative problem for the Laplace equation and its error estimates. In Section 3 we specify approximation of inner and surface fluxes and present results of numerical computations. We also give alternative schemes for oblique derivative treatment and discuss their pros and cons. In Section 4 we present concluding remarks. Appendix A contains proof of error estimate for the generic scheme and Appendix B contains proof of coercivity and consistency of the suggested inner flux approximation.
2 Generic finite volume scheme
We describe here a generic finite volume approximation of (1). The discretisation is based on a recasting of the model to transform the oblique derivative into a normal derivative, handled as a Neumann boundary condition, and a boundary advection–reaction term along . The method is “generic” in the sense that we do not impose any specific expression of the numerical fluxes, only broad assumptions that enable the convergence analysis of the method. Our approach and analysis therefore cover many possible choices of Finite Volume methods for discretising the Laplacian in the domain.
2.1 Mesh, space of unknowns and interpolant
Let be a partition of into “generalised” polyhedral finite volumes , the generalisation coming from the fact that the faces of the polyhedra could be curved (especially those lying on ). The mesh size is . We denote by the set of faces of the mesh, and by the faces contained in . The boundary faces are assumed to be compatible with in the sense that each face in totally lies on , or totally lies on the Dirichlet boundary . We let be the set of faces on , and be the set of faces on .
For each cell we take a point and we denote by the set of faces of , so that . If , is the unit outer normal to on . Every face in is a face of a unique finite volume ; the dependency of on is not made explicit as there is no risk of confusion in the formulas. We assume that:
[TABLE]
Remark 1* (Assumption (13)).*
This assumption is not mandatory, and the design and analysis in the following sections could be adapted to meshes not satisfying (13) (see Remark 9); however, the method we consider in Section 3 naturally satisfies this property, which is why we assume it in our analysis.
For every and , we denote by the finite volume such that ; here too, no risk of confusion arising we simply denote for . We then set . A face on the Dirichlet boundary of a cell is sometimes considered as a “degenerate” cell, and also denoted by ; for such faces, we pick a point and define again .
For each we take , and we denote by the set of edges of . The set of all such edges is , and the edges that lie in the relative interior of are gathered in the set . For , is the unit normal outward to on in the tangent space of .
If is a control volume , a face or an edge , denotes the Lebesgue measure of in the corresponding dimension of (dimension 3 for a control volume, 2 for a face, 1 for an edge).
Our space of approximation has unknowns in the finite volumes, on the Dirichlet faces (“degenerate cells”), and on each edge on , with zero values for Dirichlet faces, and for edges that are not in the relative interior of :
[TABLE]
Remark 2*.*
Introducing the zero-valued unknowns is of course not necessary, but will be useful to simplify some expressions.
The norm on is defined by
[TABLE]
where is the orthogonal distance between (which belongs to ) and . Remember that, in (14b), and are the two cells on each side of if , and if (so that in that case). The term can thus be viewed as a discrete -(semi)norm in [13, Eq. (7.7f)], whilst plays the role of a discrete -(semi)norm on the surface . The presence of this boundary semi-norm, and its scaling by , will be justified by the introduction of a small amount of diffusion on that surface to stabilise a centred approximation of an advective term on stemming from the oblique boundary condition (see (19a)). Notice that, in (14c), Assumption (13) was used to identify the unknown on a face with the value corresponding to such that .
The unknowns in the control volumes are destined to be approximations of the solution at , whereas those on the boundary edges approximate the average value of the solution on the corresponding edge. This leads to defining the following interpolant : for such that on ,
[TABLE]
The boundary condition on ensures that for all , and that whenever .
2.2 Prolegomena to the scheme
Integrating (1b) over a control volume , using Green’s theorem and introducing defined in (2), it holds
[TABLE]
Denoting by the exact fluxes, we invoke the boundary condition (1b) to write
[TABLE]
The vector field is tangential to and thus only the tangential gradient of is involved in the quantity . We can therefore write , where is the divergence operator on the manifold . This leads, using the divergence theorem on each face , to
[TABLE]
Let us denote by the exact advection fluxes on the boundary, and by the other contribution (akin to a reaction term) to the boundary term. This shows that the solution to (1) satisfies, for all ,
[TABLE]
2.3 Scheme
The scheme for (1) is obtained discretising (16). As previously mentioned, we will assume generic properties on the diffusive numerical fluxes. The advective contribution to the boundary terms is discretised using a centred scheme, to which we add a small amount of (boundary) diffusion for stabilisation purposes. As discussed in Remark 16, the choice of a centred discretisation seems crucial to prove optimal error estimates.
Based on our choice of unknowns and interpolant (15), we make the following approximation, in which is the sought approximation of :
[TABLE]
where and . Here, we used Assumption (13) to utilise as approximate value of on . The exact fluxes , for and , are discretised into numerical fluxes that satisfy the following conservativity condition: for all and all ,
[TABLE]
We also select numerical diffusion fluxes on the boundary, approximations of for and .
The resulting finite volume scheme has the form: find such that:
[TABLE]
Remark 3* (Conservativity of the fluxes).*
Because they correspond to a cell-centred finite volume method, the inner fluxes must satisfy by design the conservativity condition (18) on any vector . On the contrary, the fluxes correspond to a cell- and edge-centred method and their conservativity is only imposed on the solution to the finite volume scheme (see Equation (19b)). See also [9, Sections 3.3.1 and 3.3.3] on this topic.
2.4 Error estimate
The following assumptions are made on the diffusive fluxes.
Assumption 4**.**
The numerical fluxes satisfy:
Coercivity: there is and such that, for all ,
[TABLE]
and
[TABLE] 2. 2.
Consistency: there exist constants and such that, for all with on ,
[TABLE]
and
[TABLE]
The error estimate will be established under the assumption that the following mesh regularity factor remains bounded above:
[TABLE]
where is the orthogonal distance between and .
Remark 5* (Interpretation of ).*
Bounding above imposes that each must be “well within” its cell , and that two neighbouring cells must have comparable diameters (which does not prevent local refinement, provided that it is done in layers of smoothly refined meshes).
Combining [13, Lemmas B.21 and B.31], we obtain the following discrete trace inequality: there is depending only on , and an upper bound of such that, for all ,
[TABLE]
In the rest of the paper, the notation means that for a constant that is independent of the quantities in and , and of the mesh (but that may depend on , , , , , , , and an upper bound of ). We can now state our main error estimate.
Theorem 6** (Error estimate).**
Under Assumption 4, suppose that satisfies
[TABLE]
Assume that the solution to (1) belongs to , and let be the solution to the scheme (19). Then,
[TABLE]
Proof.
See Appendix A. ∎
Remark 7* (About Assumption (26)).*
Assumption (26a) imposes a relative smallness only of the positive part of . In particular, this assumption holds if . Assumption (26b) shows how the user-defined parameter must be chosen to ensure the stability of the method.
Remark 8* (Regularity assumption on ).*
In most situations, the regularity on can be weakened to an regularity, upon additional technicalities that we do not address here to simplify the exposition. See, e.g., [13, Section 7.4] for lemmas useful for establishing consistency estimates under -regularity of the function.
Remark 9* (Assumption (13)).*
In case Assumption (13) is not satisfied, that is the points corresponding to cells that touch do not lie on , the scheme has to be slightly modified the following way:
- •
Additional unknowns on the faces on are introduced, so that is changed into
[TABLE]
A point is chosen on each and the interpolant (15) is extended by setting, for these faces, .
- •
The seminorms and are modified in the following way: in (14b) the sum is taken over with whenever ; in (14c), is replaced with .
- •
Fluxes are also considered for and the scheme consists in finding solution to the conservativity equations (19b) and
[TABLE]
where, in (29), is the only cell that has as face.
- •
The coercivity assumption (20) is changed into
[TABLE]
The analysis performed in Appendix A can then be adapted and leads to the same error estimate (27).
3 Numerical tests
The numerical tests presented here are obtained using internal fluxes corresponding to a corrected version of the ones introduced in [29], and variants. For boundary fluxes , used only for stabilisation purposes, we utilise the ones provided by the Hybrid Mimetic Mixed method [14].
3.1 Description of the scheme
3.1.1 Inner fluxes
We consider a structured, but not necessarily Cartesian, grid of points on . These points are called representative points, as this is where we will look for an approximation of the potential . The structured grid assumption means that the representative points can be denoted by , where , , , and we assume that the extremal points (corresponding to , , , , or ) lie on . We split the set of indices of these extremal points into and its complement , and we assume that corresponds to the points , so that is the set of indices for the points on the Dirichlet boundary . The points associated with two extremal indices lie on the edges of , whereas those with three extremal indices describe the corners of . Note that is not necessarily a hexahedron since its “faces” may not be planar. We refer to Figs. 2 and 5 for illustrations.
For each , a hexahedral finite volume is constructed around using the following procedure. Note that points with indices in are not associated with control volumes, as they lie on the Dirichlet boundary and they are therefore not associated with unknowns of the scheme.
- •
If , then setting we define, for , the vertex as an average of the eight neighbouring points in the grid, one of them being :
[TABLE]
where B(m,n,o)=\{(m,n,o),$$(m,n,0),$$(m,0,o),$$(m,0,0),$$(0,n,o),$$(0,n,0),$$(0,0,o),$$(0,0,0)\}. The finite volume around is then the hexahedron (with possibly non-planar faces) defined by the vertices . See Fig. 2 (left) for an illustration.
- •
If , so that , and , we construct four vertices , for , as in (30). Four more vertices are constructed by averaging the four neighbouring vertices on :
[TABLE]
where . The control volume associated with is defined by the eight vertices thus constructed, and we notice that lies on one of its faces (the one on ), so that (13) is satisfied.
- •
If , is associated with a control volume touching the Dirichlet boundary and built from four vertices constructed as in (30) and four other vertices constructed in a similar way as in (31), using representative points on the Dirichlet boundary . See Fig. 2 (right).
- •
A similar construction is made for the remaining indices , corresponding to control volumes with an edge along an edge of , or a vertex at one of the corners of ; for example, the vertices of the control volumes lying on an edge of are constructed as the average of two representative points with two extremal indices. See Fig. 2 (right).
A generic finite volume is therefore identified by a triplet . For simplicity and to relate more to the unstructured notations used in Section 2, we denote by . The point associated with is therefore denoted by . Any face can be associated with two representative points on each side: itself, and which might either be associated with a genuine control volume if , or with itself (as a degenerate cell ) if . We write and notice that may not be planar.
The four vertices of are ordered in a counterclockwise way, respective to the orientation compatible with the outer normal to , and we denote them by , , , . For one of these vertices, we let be the set of representative points involved in the construction of ; hence, if is the cardinality of , we have
[TABLE]
We define four vectors related to the face : the unit vector which points from to
[TABLE]
two tangent vectors to the face
[TABLE]
and
[TABLE]
Due to the orientation chosen on and the ordering of the vertices of this face, if is the pointwise outer unit normal to on we have
[TABLE]
Since form a basis of , there are and such that
[TABLE]
The numerical fluxes are then given by: for , , and ,
[TABLE]
where
- •
(as in Section 2), and , and
- •
for , each point is associated with a genuine or degenerate cell (possibly an edge or corner of ); we then let (with if is an edge or corner on ) and, following (32), the secondary unknown located at the vertex is defined by
[TABLE]
Remark 10* (Correction of the flux in [29]).*
In [29], a similar flux is defined with right-hand side multiplied by in (36) – that is, is multiplied by . The consistency analysis in Section B.2.2 shows that this choice of flux is only consistent if the faces are asymptotically flat (that is, as the mesh size tends to zero). The flux we define above is consistent even if some faces remain non-flat as the mesh size tends to zero.
3.1.2 Surface fluxes on
We use the fluxes of the Mixed Finite Volumes [12], which is the finite volume presentation of the Hybrid Mimetic Mixed method (see [14] and [13, Section 13.2.2]). Let and define, for and denoting as usual by the unique control volume that contains in its boundary,
[TABLE]
where is the centre of mass of . Assuming that is constant along (but see Remark 11 below), the Stokes formula and the definition (15) of easily show that is a consistent approximation of the tangential gradient on in the sense that, if ,
[TABLE]
As a consequence, can be seen as the remainder of a discrete first order Taylor expansion. The HMM fluxes are then defined by: for all and all , the family is the unique solution to
[TABLE]
where we recall that is the orthogonal distance between and .
Remark 11* (Curved edges).*
The definition (38) is consistent if the only curvature of the edges is due to the curvature of , that is, the unit normal vector to on along is constant. However, the HMM remains asymptotically consistent on faces with slightly curved edges [6], in the sense that
[TABLE]
3.1.3 Properties of the fluxes
In this section, we show that, upon some mesh regularity assumption (that can be checked in practice during implementation), the inner and surface fluxes described in Sections 3.1.1 and 3.1.2 are coercive and consistent. As a consequence, Theorem 6 applies to the numerical scheme (19) based on these fluxes, and the error estimate (27) holds for this scheme.
We first define three mesh regularity factors. The first two are required to establish the properties of the inner fluxes (see Appendix), whereas the third one is linked to the properties of the HMM fluxes
The first regularity factor is related to the faces not lying on :
[TABLE]
where and if , if . 2. 2.
The definition of the second regularity factor requires the introduction of a few notations associated to a pair , where is a vertex of a face and or . We refer to Figure 3 for an illustration of these notations.
- •
If is an internal vertex, we let be the set of the two control volumes that are neighbours of , have as vertex, but are neither or . The two control volumes in have two neighbours in common: itself, and another control volume that we denote by .
- •
If , we let be the set made of the only control volume neighbour of , that has as vertex, but that is not or .
- •
If lies on the Dirichlet boundary , it is the vertex of a face . We let be the set made of this face, which is identified to the degenerate control volume .
We then need to know, for a given face , for which triplet we have, for some or and , or . These triplets are described by the following two sets
[TABLE]
The second regularity factor is then , assumed to be , such that
[TABLE]
where
[TABLE]
and
[TABLE] 3. 3.
The third regularity factor is
[TABLE]
Proposition 12** (Properties of the fluxes).**
The fluxes defined in Sections 3.1.1 and 3.1.2 satisfy Assumption 4 with , depending only on an upper bound of , and and depending only on an upper bound of .
Proof.
See Appendix B. ∎
Remark 13* (About the regularity factors).*
Bounding above imposes the proximity of a vertex and the representative points involved in its definition, as well as the non-degeneracy of the faces (whose diagonals and must have a minimal angle) and the transversality of the vector and the face . All these properties are natural given our construction of the control volumes.
The regularity factor plays the same role, for the mesh of , as the regularity factor for the mesh of . See Remark 5 for an interpretation of these terms.
Bounding below imposes that faces that share a common vertex must have comparable measures and diagonal lengths (the terms and remain bounded), and that is “not too far” from the orthogonal direction to (so that, recalling (35), remains close to while and remain small compared to ).
All these regularity factors, as well as , are easy to numerically evaluate for a given mesh during the implementation. If, as the mesh is refined, these computed factors remain bounded above (for , and ) or below (for ), then it ensures the robustness and accuracy of the numerical output since the error estimate (27) then holds. Note however that these conditions on the regularity factors are merely sufficient, not necessary; the scheme can still, in some cases, converge even if these factors do not remain properly bounded.
3.2 Alternative schemes
In the numerical tests, we will also present the results using two alternative schemes to the ones described above. The first alternative scheme is similar to (16) in a way that it approximate the oblique derivative as an advection equation on the boundary. It uses an upwind discretisation, instead of a numerically stabilized centred discretisation, for the convective term on the boundary. The second alternative approach is similar to the approximation of inner fluxes (36). It approximates the fluxes through a boundary face on by splitting the normal derivative into an oblique component, in the direction , and a tangential component to . Similar splitting, but just on uniform rectangular, radial or spherical grids, was presented in [26, 27], where, however, additional points outside domain for treatment of normal derivative were introduced which is made possible with uniform structured grids.
Upwind scheme
The boundary advection term in (16) is here discretised using an upwind approach (which, contrary to (19), does not require the introduction of numerical diffusion for stabilisation). The resulting scheme has the form
[TABLE]
where the boundary advective numerical flux , which approximates , is given by
[TABLE]
Remark 14* (Theoretical analysis).*
The theoretical analysis of this scheme can be conducted in a similar way as the scheme in Section 3.1, but leads to an theoretical convergence rate (see in particular Remark 16).
Splitting scheme
Here, the oblique derivative is not recast as a normal component and a boundary advective component. Instead, it is directly used together with a tangential approximation to reconstruct the normal fluxes. The resulting scheme has the form
[TABLE]
where the numerical normal flux , that approximates , is given by
[TABLE]
Here, the coefficients , and are given by (35) with . They therefore correspond to the decomposition of on the basis . The equation (50) approximates using the oblique derivative (see (1b)) and a tangential component, reconstructed from the boundary values of using the same principles as in Section 3.1.1.
Remark 15* (Theoretical analysis).*
Given the close proximity of the approximation (50) with the discretisation (36), the ideas developed in Appendix B could be adapted to yield an error estimate for this scheme. However, when establishing the coercivity of the method, additional boundary terms would have to be accounted for in the regularity factor (44). The scale of these additional negative terms is proportional to how tangential the oblique vector is, and the method fails to be coercive for problems with an oblique field that is too tangential to the boundary of the domain.
3.3 Results
To test the proposed methods we present three sets of numerical experiments. For all experiments, the exact solution is chosen to be , where . The regularity parameters (24), (42), (44), and (47) and the Experimental Order of Convergence (EOC) are presented.
3.3.1 Cubic domain and non-uniform mesh
The computational domain for the first set of experiments is a cube with unit edge length. The boundary , on which the oblique boundary condition is prescribed, corresponds to the bottom face of the cube. The mesh is a non-uniform one obtained constructing first a uniform grid with distance between representative points equal to , and then moving each point by a random vector with components in . Points on are only moved in a direction tangential to the boundary. Experiments with different oblique vector fields are presented, and the regularity parameters are presented in Table 1. We notice that all parameters remain in a range that makes Theorem 6 and Proposition 12 applicable.
The first experiment, whose results are presented in Table 2, shows the convergence of the method for a constant vector field . The method (19) displays a first order convergence in and energy norms, which confirms the theoretical prediction of Theorem 6 and Proposition 12. The absence of super-convergence in norm is not surprising, as specific Finite Volume methods are only known to super-converge under certain geometric conditions, and to fail to super-converge in some cases [15]. The rates of convergence for the upwind method (48) are around in norm but tend to in norm, which is expected (see Remark 14). The splitting method (49) shows the best convergence rates: above second order in norm, and above first order in .
The second experiment considers the non-constant vector field . In this case the surface divergence of (see (2)) is . The tests show similar orders of convergence, albeit slightly reduced, as in the experiment with a constant vector field; see Table 3. The slight degradation could stem from the fact that the assumption (26a) is not fully satisfied on these meshes and with this vector field, or that the asymptotic rate has not been achieved at these mesh sizes.
In the third experiment on the cube we consider a divergence free rotational vector field . The results in Table 4 show that, here again, the schemes behave in a similar way as with the other two vector fields.
3.3.2 Tesseroid domain with non-planar
The next experiments are run on a computational domain with a non-planar boundary . The discrete computational domain then does not exactly match , and vertices of the boundary faces do not have to lie on the boundary . Moreover, in this construction, the tangent space to is not well defined everywhere so the co-normal is not well defined either in the Eq. (19). In this case we approximate the normal vector by the normalised version of , where the vector is a normal to the face , the vector is normal to the neighbouring face on the other side of , and the vector is a tangent vector to the edge , chosen such that is an outward normal to .
The experiments are performed on a non-uniform mesh of the tesseroid
[TABLE]
See Fig. 5 for an illustration. The oblique boundary condition is prescribed on the non-planar face corresponding to :
[TABLE]
The regularity parameters of the considered meshes are presented in Table 5. As can be seen there, the regularity factor seems to degenerate as the mesh size is reduced, indicating that the condition that ensure the coercivity of the inner fluxes (see Proposition 12) might not hold – which does not necessarily mean that the scheme actually fails to be coercive or to converge, since this is only a sufficient condition.
The tests present the convergence of the methods for a non-constant vector field . The results presented in Table 6 are similar to the ones obtained in Section 3.3.1, with perhaps slightly better rates of convergence across the board. In any case, the apparent decay of the regularity factor does not seem to negatively impact the convergence of the schemes.
3.3.3 Spherical section domain with perturbed bottom
This series of experiments is performed on a section of a spherical domain, with a perturbed bottom boundary (see Fig. 6):
[TABLE]
The regularity parameters for the considered meshes are presented in Table 7. The coercivity constant is worse as in the tesseroid case, as it becomes negative. However, once again, since a lower bound on this constant is only a sufficient condition for the theoretical analysis, this does not mean that the schemes fail to converge, as the numerical results will show. We take the non-constant vector field . Table 8 shows that all three schemes behave in a similar way as in the previous tests of Sections 3.3.1 and 3.3.2. This indicates that our coercivity analysis (based on ) is actually a bit too conservative regarding the robustness range of the discretisations.
3.3.4 Cubic domain, almost tangential vector field
In this final series of numerical experiments with an analytical solution, we show the advantage of the proposed scheme (19) and of the upwind scheme (48) over the splitting scheme (49). The computational domain is the unit cube, with being its bottom. We take the vector field , which corresponds to the outer normal on rotated by ; this vector field is therefore almost tangential to the boundary. The tests are run on uniform meshes.
Table 9 presents the EOC for the proposed scheme and upwind scheme. The rates are sometimes degraded compared to the previous tests, but there is a clear convergence.
For the splitting scheme (49), the fact that is almost tangential leads to very large values of in (50). As a consequence, the negative coefficients in the coercivity factor are too large to be controlled by the positive coefficients; the scheme really becomes non-coercive and unstable, and the BiCGStab algorithm used to solve the system fails. This breakdown of a numerical method is probably the worst situation that one wants to avoid in practice, which indicates that in severely oblique situations the proposed new methods (19) and (48) should be preferred, despite yielding sometimes reduced rates of convergence.
3.4 Local gravity field modelling
In this section we present local gravity field modelling over Slovakia using terrestrial gravity data. The goal of this experiment is to compute a disturbing potential using presented FVM schemes with oblique BC from terrestrial measurements and Dirichlet BCs obtained from satellite based model. Then we transform obtained potential to quasi-geoidal heights and compare them with real measurements. On the upper and side boundaries, the GO_CONS_GCF_2_DIR_R5 model [7] was used and on the bottom boundary we used the surface gravity disturbances obtained from the available regular grid of gravity anomalies, with the resolution , that was compiled from original gravimetric measurements [19]. The gravity anomalies were transformed into the gravity disturbances by official digital vertical reference model DVRM (www.geoportal.sk).
The domain was bounded by meridians and parallels. The side boundaries were chosen sufficiently far from the area of Slovakia in order to mitigate an influence of the prescribed Dirichlet BC generated from the satellite-only geopotential model. For more details about this influence see [16]. The heights were interpolated from SRTM30 PLUS model and the upper boundary is in the height of 240km above the reference ellipsoid.
Three experiments with the grid density were performed using the FVM schemes (19), (48) and (49). The accuracy of the simulations was tested using GNSS-leveling. From the available dataset of 61 GNSS-leveling benchmarks, three evident outliers were removed. Hence, we tested the obtained local quasi-geoid model at 58 points. The results are summarised in Table 10 and, for the method (19), they are visualized in Fig. 7. We see a comparable precision of all the methods in this experiment. With this grid resolution the standard deviation of residuals between numerical results and measurements for all schemes is around 5cm.
4 Conclusion
We developed a framework for designing and analysing Finite Volume schemes for the Laplace equation with oblique boundary conditions. This framework, which can easily be extended to more general second order differential equations, consists in splitting the boundary condition into a normal and a tangential component, the later being handled as an advection term along the boundary of the domain; to ensure optimal convergence rates, this advection term is discretised using a centered scheme, with added numerical diffusion for stability purposes. The convergence analysis was carried out under usual coercivity and consistency assumptions on the numerical fluxes, and therefore applies to a range of possible FV discretisations. This analysis establishes first-order rates of convergence in a discrete energy () norm.
We then constructed specific fluxes, in the case where the computational domain is discretised using generalised hexahedra, and we identified geometrical conditions, easy to check during simulations, that ensure their coercivity and consistency. Two alternative discretisations of the oblique boundary conditions were also presented: the first one uses an upwind FV discretisation of the boundary advection, the second is not based on a FV discretisation on the boundary, but rather on splitting the outer normal to the boundary into its oblique component, and a tangential component discretised using finite differences and the specific geometry of the mesh.
We then provided extensive numerical tests, designed to assess the accuracy and robustness of the method, for various choices of the computational domain, and of the oblique vector field defining the boundary conditions. These tests confirmed, for all three schemes, the theoretical first-order rate of convergence in energy norm. In some tests, the energy rate of convergence is actually apparently higher than the theoretical one (but the asymptotic convergence rate might not have been attained at the considered mesh sizes). The second variant, based on a splitting of the outer normal, seems to present the best accuracy in our initial tests, when the velocity field is not too tangential to the boundary. For a nearly tangential velocity field, this splitting scheme breaks down as the numerical solver fails to find a solution to it. On the contrary, the other two variants remain robust and convergent in this extreme situation, albeit with a reduced accuracy. All three schemes were used to compute a quasi-geoidal height in the region of Slovakia. For this test, all methods give results with comparable quality.
Appendix A Proof of Theorem 6
The proof hinges on the 3rd Strang lemma of [9]. Let us first recast the scheme (19) under a variational formulation. Take , multiply (19a) by and summing over to get
[TABLE]
Using the conservativity of the fluxes (see (18)), (see (19b)) and (by definition of ), and the zero value of if is a boundary edge in , we gather the sums in the left-hand side by faces and edges as in [9, Proofs of Theorem 27 and 33] to find
[TABLE]
The solution to the scheme thus satisfies for all , with (resp. ) the bilinear form (resp. linear form) in the left-hand side (resp. right-hand side) of (51). Owing to the 3rd Strang lemma [9, Theorem 10], the estimate (27) follows if we establish the coercivity and consistency properties:
[TABLE]
and, letting be the consistency error,
[TABLE]
A.1 Coercivity
The coercivity properties (20) and (21) show that
[TABLE]
Simple algebraic identities show that
[TABLE]
By conservativity of and zero value of on boundary edges of ,
[TABLE]
Hence, since ,
[TABLE]
Using and the trace inequality (25), we write
[TABLE]
Plugging this into (55) and noticing, since , that
[TABLE]
we obtain
[TABLE]
Coming back to (54), we infer that
[TABLE]
Owing to Assumption 26, this proves (52).
A.2 Consistency
Using (16) and recalling that is defined by the right-hand side of (51), we write
[TABLE]
where we have used the conservativity of the fluxes to gather the sums by faces in the second equality. Subtracting (given by the left-hand side of (51) with replaced by ), we can split the consistency error into four terms:
[TABLE]
with, setting ,
[TABLE]
We now estimate each of these terms.
Term .
Introducing and using a Cauchy–Schwarz inequality, the consistency property (22) yields
[TABLE]
Let be the convex hull of and . If is flat, by [13, Lemma B.2] we have and thus, by definition of (which implies ),
[TABLE]
This final estimate also holds in case of non-flat , as can be seen approximating by piecewise flat surfaces. Hence,
[TABLE]
Term .
We first estimate the consistency of the fluxes involved in this term. Using the definition of the interpolant (15) we have and thus
[TABLE]
where the conclusion follows from a mean value theorem on and . Applying a Cauchy–Schwarz inequality and using (61), we infer
[TABLE]
In a similar way as in the last equalities in (59), being the convex hull of and we have
[TABLE]
Since , we conclude that
[TABLE]
Remark 16* (Centred discretisation of the advective term).*
The approximation in the first term of (17) corresponds to a centred discretisation of the advection term on . To stabilise this centred discretisation and ensure the coercivity of the scheme, we have to add the artificial diffusion through the terms in (19a). A standard option to avoid adding numerical diffusion is to directly use an upwind discretisation of the advective term, as in (48). In this case, since stability would not require to introduce artificial diffusion, we would only consider cell unknowns in (and not introduce edge unknowns), and we would take . The resulting scheme would be (48). Such a choice, however, would prevent us from introducing in (61) and the resulting estimate would be in instead of . Carrying on as in (62) but with instead of the absent , with the natural assumption that , we would arrive at (64) with instead of . The final consistency estimate, and thus error estimate, would then be in instead of .
Term .
Notice first that
[TABLE]
Hence, using a Cauchy–Schwarz inequality and the trace inequality (25),
[TABLE]
Term .
Introducing the exact surface fluxes on , we write
[TABLE]
A Cauchy–Schwarz inequality, the consistency property (23), and (63) show that
[TABLE]
For , we use the conservativity of the fluxes , the fact that for edges on the boundary of , , and the trace inequality (25) to write
[TABLE]
Combined with (66) and recalling that this shows that
[TABLE]
Gathering (60), (64), (65) and (67) in (58), we infer that (53) holds, which concludes the proof of Theorem 6.
Appendix B Proof of Proposition 12
B.1 Boundary fluxes
The coercivity of the HMM fluxes result from the construction of the method as a Gradient Discretisation Method, see [13, Chapter 13] – we note that this coercivity is purely algebraic, and not impacted by the curvature of the faces or of their edges. In the case of flat faces and edges, the consistency of the fluxes (41) is a consequence of (40), see [13, Chapter 13] or [9, Example 31].
Consider now a curved face , and assume that all edges of are “only curved along ” in the sense that is constant over for all (see Remark 11 otherwise). Because is a smooth surface, is asymptotically close to the tangent plane to at any point of (that is, the projection of in any normal direction to has length ). Taylor expansions at any point of and the consistency property (40) thus give a constant independent of the mesh such that, for ,
[TABLE]
Using this estimate and (40), the arguments developed in [13, Chapter 13] can then easily be adapted and yield (23).
B.2 Inner fluxes
B.2.1 Coercivity
Without any loss of generality we can select the vertex labels and (resp. and ) such that (resp. ). Recalling the definition (36) of the fluxes, we use the zero value on the Dirichlet boundary and the Young inequality to write
[TABLE]
In order to establish (20), we now need to find a lower bound of this quantity in terms of sums of for pairs of neighbouring control volumes. The first stage is to recast and as combinations of differences of on neighbouring control volumes. Without loss of generality, we consider . We have to deal with three cases, depending if the corresponding vertices are both internal, if one lies on , or if one lies on the Dirichlet boundary .
Case 1: Internal vertices. We assume here that and are both in . Let denote any one of these two vertices. Recalling the definitions in Section 3.1.3 (see also Figure 3) of and , we see that the set is made of the eight control volumes around whose unknowns are involved in the definition (37) of . Hence, we can decompose as
[TABLE]
Inside the sum in the right-hand side, each cell unknown appears with the coefficients represented in Figure B.2.1 (left). Our goal is to gather these terms together in order to write as a combination of terms with and neighbouring control volumes. This is done by splitting the coefficients in order to associate (parts of) each cell unknown with a neighbouring cell unknown, as in Figure B.2.1 (right).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Backus. Application of a non-linear boundary-value problem for laplace’s equation to gravity and geomagnetic intensity surveys. Q J Mech Appl Math , 21(2):195–221, 1968.
- 2[2] J. W. Barrett and C. M. Elliott. Fixed mesh finite element approximations to a free boundary problem for an elliptic equation with an oblique derivative boundary condition. Computers & Mathematics with Applications , 11(4):335 – 345, 1985.
- 3[3] A. Bjerhammar and L. Svensson. On the geodetic boundary value problem for a fixed boundary surface—a satellite approach. Bulletin géodésique , 57(1):382–393, Mar 1983.
- 4[4] A. Bradji and J. Fuhrmann. On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems. Computational and Applied Mathematics , 37(3):2533–2565, Jul 2018.
- 5[5] A. Bradji and T. Gallouët. Error estimate for finite volume approximate solutions of some oblique derivative boundary value problems. International Journal on Finite Volumes , 3(2):1–35, 2006.
- 6[6] F. Brezzi, K. Lipnikov, and M. Shashkov. Convergence of mimetic finite difference method for diffusion problems on polyhedral meshes with curved faces. Math. Models Methods Appl. Sci. , 16(2):275–297, 2006.
- 7[7] S. Bruinsma, C. Foerste, O. Abrikosov, J.-C. Marty, M.-H. Rio, S. Mulet, and B. Sylvain. The new esa satellite-only gravity field model via the direct approach. Geophysical Research Letters , 40, 07 2013.
- 8[8] R. Čunderlík, K. Mikula, and M. Mojzeš. Numerical solution of the linearized fixed gravimetric boundary-value problem. Journal of Geodesy , 82(1):15–29, Jan 2008.
