Abstract
Optimal a priori and a posteriori error estimates are derived for three variants of Nitsche’s mortar finite elements. The analysis is based on the equivalence of Nitsche’s method and the stabilised mixed method. Nitsche’s method is defined so that it is robust with respect to large jumps in the material and mesh parameters over the interface. Numerical results demonstrate the robustness of the a posteriori error estimators.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Nitsche’s method [23] is by now a well-established and successful method, e.g., for domain decomposition [4, 18, 25], elastic contact problems [7, 8, 10,11,12], and as a fictitious domain method [5, 6, 14]. However, its mathematical analysis has not, as yet, been entirely satisfactory. In fact, for an elliptic problem with a variational formulation in \(H^1\), the existing a priori estimates require that the solution is in \(H^s\), with \(s>3/2\); cf. [4, 12]. Moreover, the a posteriori analysis has been based on a non-rigorous saturation assumption; cf. [4, 9].
In our paper [24], we made the observation that there is a close connection between the Nitsche’s method for Dirichlet conditions and a certain stabilised mixed finite element method, and we advocated the use of the former since it has the advantage that it directly yields a method with an optimally conditioned, symmetric, and positive-definite stiffness matrix. The a priori error analysis is also very straightforward but, as understood from above, not optimal.
The purpose of the present paper is to show that this connection can be used to improve the error analysis of the domain decomposition problem, i.e. we will derive optimal error estimates, both a priori and a posteriori. We consider three similar but distinct Nitsche’s mortar methods. Two of the methods have appeared previously in the literature [19,20,21] and the third one is a simpler master–slave formulation where the stabilisation term is present only on the slave side of the interface. The methods are designed so that they are robust with respect to large jumps in the material and mesh parameters over the interface. The robustness is achieved by a proper scaling of the stabilisation/Nitsche terms; cf. [19, 25]. For simplicity we consider the Poisson problem with two subdomains. The analysis, however, carries over to other problems such as the transmission problem for which the Nitsche’s method was applied in [18]. In a forthcoming paper [16], we will extend these results, and our previous work on variational inequalities [17], to elastic contact problems including different material properties.
The plan of the paper is the following. In the next section, we present the model transmission problem, rewrite it in a mixed saddle point variational form and prove its stability in appropriately chosen continuous norms. In Sect. 3, we present three different stabilised mixed finite element methods and their respective Nitsche formulations. In Sect. 4, we prove the stability of the discrete saddle point formulations and derive optimal a priori error estimates. In Sect. 5, we perform the a posteriori error analysis and show that the residual estimators are both reliable and efficient. In Sect. 6, we report the results of our numerical computations.
2 The model problem
Suppose that the polygonal or polyhedral domain \(\Omega \subset {\mathbb {R}}^d\), \(d\in \{2,3\}\), is divided into two non-overlapping parts \(\Omega _i\), \(i=1,2\), and denote their common boundary by \(\Gamma = \partial \Omega _1 \cap \partial \Omega _2\). We assume that \(\partial \Gamma \subset \partial \Omega \), with \(\partial \Gamma \) being the boundary of the \(n-1\) dimensional manifold \(\Gamma .\)
We consider the problem: find functions \(u_i\) that satisfy
where \(k_i > 0,\ i=1,2,\) are material parameters, \(f \in L^2(\Omega )\) is a load function and \(n_i\) denote the outer normal vectors to the subdomains \(\Omega _i, i=1,2\). In what follows we often write \(n = n_1 = -n_2\). Throughout the paper we assume that \(k_1\ge k_2\).
The standard variational formulation of problem (2.1) reads as follows: find \(u\in H^1_0(\Omega )\) such that
where \(k\vert _ {\Omega _i}=k_i\) and \(u\vert _ {{\overline{\Omega }}_i}\, =u_i\). On the interface \(\Gamma \), the restriction of the solution u lies in the Lions–Magenes space \( H^{\frac{1}{2}}_{00}(\Gamma )\) (c.f. [22, Theorem 11.7, p. 66] or [26, Chapter 33]), with its intrinsic norm defined as
where \(\rho (x)\) is the distance from x to the boundary \(\partial \Gamma \).
The mixed formulation follows from imposing the continuity condition on \( \Gamma \) in a weak form by using the normal flux as the Lagrange multiplier, viz.
The Lagrange multiplier belongs to the dual space \(Q = \big (H^{\frac{1}{2}}_{00}(\Gamma )\big )^\prime \), equipped with the norm
where \(\langle \cdot , \cdot \rangle : Q^\prime \times Q \rightarrow {\mathbb {R}}\) stands for the duality pairing.
Let
and define the bilinear and linear forms, \({\mathcal {B}}: (V \times Q) \times (V \times Q) \rightarrow {\mathbb {R}}\) and \({\mathcal {L}}: V \rightarrow {\mathbb {R}}\) by
where w and v denote the pair of functions \(w = (w_1, w_2) \in V_1 \times V_2\) and \(v = (v_1, v_2) \in V_1 \times V_2\). Furthermore, denotes the jump in the value of w over \(\Gamma \). The mixed variational formulation of (2.1) reads as follows: find \((u, \lambda ) \in V \times Q\) such that
The norm in \(V\times Q\) used in the analysis is scaled by the material parameters, viz.
Theorem 1
(Continuous stability) For every \((w,\xi ) \in V\times Q\) there exists \((v,\mu ) \in V \times Q\) such that
and
Proof
In both subdomains, we have the inf-sup condition (cf. [2])
Therefore
The stability follows now from the Babuška–Brezzi theory [2]. \(\square \)
Remark 1
Given that \(k_1\ge k_2\), it holds with some constants \(C_1,C_2>0\) that
This defines a norm that will be used in the following for defining and analysing a “master–slave” formulation.
3 The finite element methods
We start by defining the stabilised mixed method. The subdomains \(\Omega _i\) are divided into sets of non-overlapping simplices \({\mathcal {C}}_h^i\), \(i = 1,2\), with h referring to the mesh parameter. The edges/facets of the elements in \({\mathcal {C}}_h^i\) are divided into two meshes: \({\mathcal {E}}_h^i\) consisting of those which are located in the interior of \(\Omega _i\), and \({\mathcal {G}}_h^i\) of those that lie on \(\Gamma \). Furthermore, by \({\mathcal {G}}_h^\cap \) we denote the boundary mesh obtained by intersecting the edges/facets of \({\mathcal {G}}_h^1\) and \({\mathcal {G}}_h^2\). In particular, each \(E \in {\mathcal {G}}_h^\cap \) corresponds to a pair \((E_1, E_2) \in {\mathcal {G}}_h^1 \times {\mathcal {G}}_h^2\) such that \(E = E_1 \cap E_2\). In the subdomains, we define the finite element subspaces
where \(p\ge 1\). The finite element space for the dual variable consists of discontinuous piecewise polynomials, also of degree p, defined at the intersection mesh \({\mathcal {G}}_h^\cap \):
We will now introduce three slightly different stabilised finite element methods and the corresponding Nitsche’s formulations for problem (2.1).
3.1 Method I
We define a bilinear form \({\mathcal {B}}_h : (V_h \times Q_h) \times (V_h \times Q_h) \rightarrow {\mathbb {R}}\) through
where \(\alpha > 0\) is a stabilisation parameter and
a stabilising term, with \(h_E\) denoting the diameter of \(E \in {\mathcal {G}}_h^i\). The first stabilised finite element method is written as: find \((u_h, \lambda _h) \in V_h \times Q_h\) such that
Note that testing with \((0,\mu _h) \in V_h\times Q_h \) in (3.5) yields the equation
Hence, denoting by \(h_i : \Gamma \rightarrow {\mathbb {R}}\), \(i=1,2\), a local mesh size function such that
equation (3.6) can be written as
Now, since each \( E \in {\mathcal {G}}_h^\cap \) is an intersection of a pair \((E_1, E_2) \in {\mathcal {G}}_h^1 \times {\mathcal {G}}_h^2\) and the polynomial degree is p for all variables, we obtain the following expression for the discrete Lagrange multiplier
where
and
Substituting expression (3.9) into the discrete variational formulation leads to the Nitsche formulation: find \(u_h \in V_h\) such that
where the bilinear form \(a_h\) is defined through
with
and the jump term and the function \(\gamma \) are given by
Note that (3.11) is a convex combination of two fluxes as in the method suggested in [25]. The formulation (3.12) corresponds to the method introduced in [21], and to the second method proposed for problem (2.1) in [19, pp. 468–470].
3.2 Method II: Master–slave formulation
Assume that \(k_1 \gg k_2\). The norm equivalence (2.14) suggests using only the term from the “less rigid” subdomain \(\Omega _2\) for stabilisation in (3.4). Calling \(\Omega _1\) the master domain and \(\Omega _2\) the slave domain and stabilising from the slave side only, yields a mixed stabilised finite element as in (3.5) except that
Note that the space for the Lagrange multiplier is still defined by (3.2).
The corresponding Nitsche’s formulation reads as in (3.12) with the bilinear form \(b_h\) defined simply as
3.3 Method III: Stabilisation using a convex combination of fluxes [4, 19, 20, 25]
Let us reformulate (3.5) by considering the stabilising term
where denotes the convex combination (3.11) and \(\beta \) is defined by (3.10). To derive the corresponding Nitsche’s method, we proceed as above and obtain an equivalent expression for the discrete Lagrange multiplier:
Substituting this back to the stabilised formulation leads to the method (3.12) with \(b_h\) given by
This exact method was discussed before in [20]. A similar method with a slightly different definition for the convex combination of fluxes was considered in [19].
Remark 2
(On the choice of the method) The performance of the different methods is equal by all practical measures when \(k_1 \gg k_2\). The variational formulation of Method III has fewer terms and is therefore simpler to implement than Method I whereas the master–slave formulation (Method II) is clearly the simplest of them all, both when it comes to the implementation and the analysis.
4 A priori error analysis
In this section, we perform a priori error analyses of the stabilised formulations which then, by construction, carry over to the Nitsche’s formulations. We will perform the analysis in full detail for Method I and briefly indicate the differences in analysing the other two methods.
In order to prove the a priori estimate (Theorem 3), we need a stability estimate for the discrete bilinear form \({\mathcal {B}}_h\). The stability estimate is proven using Lemma 1 which follows from a scaling argument:
Lemma 1
(Discrete trace estimate) There exists \(C_I > 0\), independent of h, such that
The discrete stability of Method I will be established in the mesh-dependent norm
Note, however, that trivially we have
Theorem 2
(Discrete stability) Suppose that \(0< \alpha < C_I\). Then for every \((w_h,\xi _h) \in V_h \times Q_h\) there exists \((v_h,\mu _h) \in V_h \times Q_h\) such that
and
Proof
Applying the discrete trace estimate leads to stability in the mesh-dependent part of the norm
Next, we recall the steps (cf. [15]) for extending the result to the continuous part of the norm. By the continuous inf-sup condition (2.13), for any \(\xi _h \in Q_h\) there exists \(v\in V \) such that
Consequently, there exist positive constants \(C_2, \, C_3, \, C_4\), such that for the Clément interpolant \(I_h v\in V_h\) of v it holds
Using the Cauchy–Schwarz inequality, the arithmetic-geometric mean inequality, and the discrete trace estimate (Lemma 1), we then see that
Combining estimates (4.5) and (4.9), we finally obtain
where the last bound follows from choosing \(0<\delta < C_1/C_5\).
In order to obtain (4.4), we first use the triangle inequality and (4.8) to get
The claim follows by adding
to both sides of the inequality. \(\square \)
We will need one more lemma before we can establish an optimal a priori estimate. Let \(f_h\in V_h\) be an approximation of f and define
Moreover, for each \(E \in {\mathcal {G}}_h^i\), denote by \(K(E) \in {\mathcal {C}}_h^i\) the element satisfying \(\partial K(E) \cap E = E\).
Lemma 2
For an arbitrary \((v_h, \mu _h) \in V_h \times Q_h\) it holds
Proof
Let \(b_E \in P_d(E) \cap H^1_0(E)\), \(E \in {\mathcal {G}}_h^1\), be the edge/facet bubble function with maximum value one. Define \(\sigma _E\) as the polynomial defined on K(E) through
We have by the norm equivalence in polynomial spaces
Let \(\sigma = \sum _{E \in {\mathcal {G}}_h^1} \sigma _E\). Testing the continuous variational problem with \((v_1, v_2, \mu ) = (\sigma , 0, 0)\) gives \((k_1 \nabla u_1, \nabla \sigma )_{\Omega _1} - \langle \sigma , \lambda \rangle - (f,\sigma )_{\Omega _1} = 0\). This leads to
By inverse estimates
Using the Cauchy–Schwarz and the trace inequalities, it then follows that
In view of the standard lower bound for interior residuals [27] and the discrete inequalities (4.12), we conclude that
The estimate in \(\Omega _2\) is proven similarly. Adding the estimates in \(\Omega _1 \) and \(\Omega _2\) leads to (4.11). \(\square \)
The proof of the a priori estimate is now straightforward.
Theorem 3
(A priori estimate) The exact solution \((u,\lambda ) \in V \times Q\) of (2.8) and the discrete solution \((u_h,\lambda _h) \in V_h \times Q_h\) of (3.5) satisfy
Proof
The discrete stability estimate guarantees the existence of \((w_h,\xi _h) \in V_h \times Q_h\), with \( {\left| \left| \left| (w_h,\xi _h) \right| \right| \right| }_h =1\), such that for any \((v_h,\mu _h) \in V_h \times Q_h\) it holds
We have
The first term above is estimated using the continuity of \({\mathcal {B}}\) in the continuous norm
For the second term, the Cauchy–Schwarz inequality, Lemma 2 and the discrete trace estimate yield
\(\square \)
Remark 3
(Method II) The discrete stability can be established in the norm
and, as seen from its proof, Lemma 2 is valid individually for both stabilising terms. We thus obtain the a priori estimate
where
Remark 4
(Method III) The analysis of the third method is similar, albeit a bit more cumbersome. The crucial observation is that we can write
where
Given that \(0 \le \alpha _i(x) \le 1 \ \ \forall x\in \Gamma , i=1,2,\) and \(\alpha _1+\alpha _2=1\), it can be verified using the triangle inequality that the a priori estimate of Theorem 3 holds also for Method III.
5 A posteriori estimate
Let us first define local residual estimators corresponding to the finite element solution \((u_h,\lambda _h)\) through
with \(i =1,2\). The global error estimator is then denoted by
In the following theorem we show that the error estimator \(\eta \) is both efficient and reliable.
Theorem 4
(A posteriori estimate) It holds that
and
Proof
The continuous stability estimate of Theorem 1 guarantees the existence of a pair \((v,\mu ) \in V \times Q\), with \( {\left| \left| \left| (v,\mu ) \right| \right| \right| }=1\), that satisfies
Let \(I_h v\in V_h\) be the Clément interpolant of \(v \in V\). The stabilised method is consistent, thus
Therefore, we can write
After integration by parts, the first term yields
On the other hand, for the Clément interpolant it holds
For the first three terms in (5.8), we thus get
The last term in (5.8) is estimated using the following discrete inverse inequality for the \(H^{1/2}_{00}(\Gamma ) \) norm (cf. [1, 13])
viz.
On the other hand, from the Cauchy–Schwarz and the discrete trace inequalities and from (5.9), it follows that
The upper bound (5.5) can now be established by joining the above estimates.
The lower bound (5.6) follows from Lemma 2 together with standard lower bounds, cf. [27]. \(\square \)
We end this section by reiterating that the purpose of the mixed stabilised formulation is to perform the error analysis. We advocate the use of Nitsche’s formulation for computations and note that substituting the discrete Lagrange multiplier (3.9) in the error indicators, we obtain for \(E\in {\mathcal {G}}_h^1\)
and for \(E\in {\mathcal {G}}_h^2\)
Remark 5
(Method II) The local estimators \(\eta _K, \eta _{E,\Omega } \) and \(\eta _{E,\Gamma }\) are defined through (5.1)–(5.3) and the estimates (5.5) and (5.6) hold true in the norm (4.16). After substituting the discrete Lagrange multiplier
into the error indicators, we for the corresponding Nitsche’s formulation obtain
for \(E\in {\mathcal {G}}_h^2\), and
for \(E\in {\mathcal {G}}_h^2\).
Remark 6
(Method III) Once again the local estimators for the stabilised method are defined as in (5.1)–(5.3) and the a posteriori estimates (5.5) and (5.6) hold true. In the Nitsche’s formulation, the error indicators depending on the Lagrange multiplier are given by (5.12) and (5.13).
6 Numerical results
We experiment with the proposed method by solving the domain decomposition problem adaptively with \(\Omega _1 = (0,1)^2\), \(\Omega _2 = (1,2) \times (0,1)\), \(f = 1\), \(\alpha = 10^{-2}\) and linear elements. After each solution we mark a triangle \(K \in {\mathcal {C}}_h^i\), \(i=1,2\), for refinement if it satisfies \({\mathcal {E}}_K > \theta \max _{K^\prime \in {\mathcal {C}}_h^1 \cup {\mathcal {C}}_h^2} {\mathcal {E}}_{K^\prime }\) where \(\theta = \tfrac{1}{\sqrt{2}}\) and
The set of marked elements is refined using the red-green-blue strategy, see e.g. Bartels [3].
Changing the material parameters from \((k_1,k_2)=(1,1)\) to \((k_1,k_2)=(10,0.1)\), and finally to \((k_1,k_2) = (0.1, 10)\) produces adaptive meshes where the domain with a smaller material parameter receives more elements, see Figs. 1, 2 and 3. This is in accordance with results on adaptive methods for linear elastic contact problems, see e.g. Wohlmuth [28] where it is demonstrated that softer the material, more the respective domain is refined.
Next we solve the domain decomposition problem in an L-shaped domain with \(\Omega _1 = (0,1)^2\), \(\Omega _2 = (1,2) \times (0,2)\) and \(k_1=k_2=1\). The resulting sequence of meshes is depicted in Fig. 4 and the global error estimator as a function of the number of degrees-of-freedom N is given in Fig. 5. Note that the exact solution is in \(H^{5/3-\varepsilon }\), \(\varepsilon >0\), in the neighbourhood of the reentrant corner which limits the convergence rate of uniform refinements to \(O(N^{-1/3})\).
We finally remark that Methods II and III yield very similar numerical results.
References
Ainsworth, M., Kelly, D.W.: A posteriori error estimators and adaptivity for finite element approximation of the non-homogeneous Dirichlet problem. Adv. Comput. Math. 15(2001), 3–23 (2002)
Babuška, I.: The finite element method with Lagrangian multipliers. Numer. Math. 20, 179–192 (1973)
Bartels, S.: Numerical Approximation of Partial Differential Equations, vol. 64 of Texts in Applied Mathematics. Springer, Berlin (2016)
Becker, R., Hansbo, P., Stenberg, R.: A finite element method for domain decomposition with non-matching grids. ESAIM Math. Model. Numer. Anal. 37, 209–225 (2003)
Burman, E., Hansbo, P.: Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method. Appl. Numer. Math. 62, 328–341 (2012)
Burman, E., Hansbo, P.: Fictitious domain methods using cut elements: III. A stabilized Nitsche method for Stokes’ problem. ESAIM Math. Model. Numer. Anal. 48, 859–874 (2014)
Burman, E., Hansbo, P., Larson, M.G.: The penalty-free Nitsche method and nonconforming finite elements for the Signorini problem. SIAM J. Numer. Anal. 55, 2523–2539 (2017)
Chouly, F., Fabre, M., Hild, P., Mlika, R., Pousin, J., Renard, Y.: An overview of recent results on Nitsche’s method for contact problems. In: Bordas, S., Burman, E., Larson, M., Olshanskii, M. (eds.) Geometrically Unfitted Finite Element Methods and Applications, vol. 121 of Lecture Notes in Computational Science and Engineering, pp. 93–141. Springer, Berlin (2017)
Chouly, F., Fabre, M., Hild, P., Pousin, J., Renard, Y.: Residual-based a posteriori error estimation for contact problems approximated by Nitsche’s method. IMA J. Numer. Anal. 38, 921–954 (2018)
Chouly, F., Hild, P., Renard, Y.: A Nitsche finite element method for dynamic contact: 1. Space semi-discretization and time-marching schemes. ESAIM Math. Model. Numer. Anal. 49, 481–502 (2015)
Chouly, F., Hild, P., Renard, Y.: A Nitsche finite element method for dynamic contact: 2. Stability of the schemes and numerical experiments. ESAIM Math. Model. Numer. Anal. 49, 503–528 (2015)
Chouly, F., Hild, P., Renard, Y.: Symmetric and non-symmetric variants of Nitsche’s method for contact problems in elasticity: theory and numerical experiments. Math. Comput. 84, 1089–1112 (2015)
Dahmen, W., Faermann, B., Graham, I.G., Hackbusch, W., Sauter, S.A.: Inverse inequalities on non-quasi-uniform meshes and application to the mortar element method. Math. Comput. 73, 1107–1138 (2004)
Fabre, M., Pousin, J., Renard, Y.: A fictitious domain method for frictionless contact problems in elasticity using Nitsche’s method. SMAI J. Comput. Math. 2, 19–50 (2016)
Franca, L.P., Stenberg, R.: Error analysis of Galerkin least squares methods for the elasticity equations. SIAM J. Numer. Anal. 28, 1680–1697 (1991)
Gustafsson, T., Stenberg, R., Videman, J.: On Nitsche’s method for elastic contact problems. Preprint. arXiv:1902.09312
Gustafsson, T., Stenberg, R., Videman, J.: Mixed and stabilized finite element methods for the obstacle problem. SIAM J. Numer. Anal. 55, 2718–2744 (2017)
Heinrich, B., Nicaise, S.: The Nitsche mortar finite-element method for transmission problems with singularities. IMA J. Numer. Anal. 23, 331–358 (2003)
Juntunen, M.: On the connection between the stabilized Lagrange multiplier and Nitsche’s methods. Numer. Math. 131, 453–471 (2015)
Juntunen, M.: On the local mesh size of Nitsche’s method for discontinuous material parameters. In: Abdulle, A., Deparis, S., Kressner, D., Nobile, F., Picasso, M. (eds.) Numerical Mathematics and Advanced Applications ENUMATH 2013, vol. 103 of Lecture Notes in Computational Science and Engineering, pp. 57–63. Springer, Berlin (2015)
Juntunen, M., Stenberg, R.: Nitsche’s method for discontinuous material parameters. In: Persson, K., Revstedt, J., Sandberg, G., Wallin, M. (eds.) Proceedings of the 25th Nordic Seminar on Computational Mechanics, Lund University (pp. 95–98) (2012)
Lions, J.-L., Magenes, E.: Non-homogeneous Boundary Value Problems and Applications, vol. 1. Springer-Verlag, Berlin, Heidelberg (1972)
Nitsche, J.: Über ein Variationsprinzip zur Lösung von Dirichlet-Problemen bei Verwendung von Teilräumen, die keinen Randbedingungen unterworfen sind. Abh. Math. Sem. Univ. Hamburg 36, 9–15 (1971)
Stenberg, R.: On some techniques for approximating boundary conditions in the finite element method. J. Comput. Appl. Math. 63, 139–148 (1995)
Stenberg, R.: Mortaring by a method of J. A. Nitsche. In: Idelsohn, S., Oñate, E., Dvorkin, E. (eds.) Computational Mechanics—New Trends and Applications. CIMNE, Barcelona (1998)
Tartar, L.: An Introduction to Sobolev Spaces and Interpolation Spaces, vol. 3 of Lecture Notes of the Unione Matematica Italiana. Springer, Berlin (2007)
Verfürth, R.: A Posteriori Error Estimation Techniques for Finite Element Methods. Oxford University Press, Oxford (2013)
Wohlmuth, B.: Variationally consistent discretization schemes and numerical algorithms for contact problems. Acta Numerica 20, 569–734 (2011)
Acknowledgements
Open access funding provided by Aalto University. The work of the authors was supported by Tekes (Decision number 3305/31/2015), the Finnish Cultural Foundation, the Portuguese Science Foundation (FCOMP-01-0124-FEDER-029408) and project PTDC/MAT-PUR/28686/2017), and the Finnish Society of Science and Letters.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Gustafsson, T., Stenberg, R. & Videman, J. Error analysis of Nitsche’s mortar method. Numer. Math. 142, 973–994 (2019). https://doi.org/10.1007/s00211-019-01039-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00211-019-01039-5