# Analysis of the finite element method for transmission/mixed boundary value problems on general polygonal domains.

1. Introduction. In this paper we study second-order, strongly elliptic operators in divergence form P = -div A[nabla] on generalized polygonal domains in the plane, where the coefficients are piecewise smooth with possibly jump discontinuities across a finite number of curves, collectively called the interface.

Let ([OMEGA]) be a bounded polygonal domain that may have curved boundaries, cracks, or vertices touching the boundary. We refer to such domains as domains with polygonal structure (see Figure 2.1 for a typical example). We assume that [bar.[OMEGA]] = [union][[bar.[OMEGA]].sub.j], where [[bar.[OMEGA]].sub.j] are disjoint domains with a polygonal structure such that the interface [GAMMA] := [union][partial derivative][[OMEGA].sub.j]\ [partial derivative][OMEGA] is a union of disjoint, piecewise smooth curves [[GAMMA].sub.k]. The curves [[GAMMA].sub.k] are allowed to intersect transversely. We are interested in the non-homogeneous transmission/mixed boundary value problem

(1.1) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

and the convergence properties of its Finite Element discretizations. Here, A = ([A.sub.ij]) is the symmetric matrix of coefficients of P, [D.sup.P.sub.v] = [[SIGMA].sub.ij][v.sup.i][A.sub.ij][[partial derivative].sub.j] is the conormal derivative associated to P, and the boundary [partial derivative][OMEGA] is partitioned into two disjoints sets [[partial derivative].sub.D][OMEGA], [[partial derivative].sub.N]C with [[partial derivative].sub.D][OMEGA] a union of closed sides of [partial derivative][OMEGA].

Transmission problems of the form in Equation (1.1) (also called "interface problems" or "inclusion problems" in the engineering literature) appear in many practical applications, in particular they are likely to appear any time that more than one type of material (or medium) is used. Therefore, they have been studied in a very large number of papers devoted to applications. Among those, let us mention the paper by Peskin [68], LeVeque and Li [51], Li and Lubkin [55], Yu, Zhou, and Wei [80]. See also the references therein. By contrast, relatively fewer papers were devoted to these problems from the point of view of qualitative properties of Partial Differential Equations. Let us nevertheless mention here the papers of Kellogg [44], Kellogg and Aziz [6], Mitrea, Mitrea, and Shi [61], Li and Nirenberg [53], Li and Vogelius [54], Roitberg and Sheftel [71, 72], and Schechter [75]. Our paper starts with some theoretical results for transmission problems and then provides applications to numerical methods. See also the papers of Kellogg [43] and Nicaise and Sandig [67], and the books of Nicaise [66] and Harutyunyan and Schulze [40].

The equation Pu = f in [OMEGA] has to be interpreted in a weak sense and then the discontinuity of the coefficients [A.sup.ij] leads to "transmission conditions" at the interface [GAMMA]. Since [GAMMA] is a union of piecewise smooth curves, we can locally choose a labeling of the non-tangential limits [u.sub.+] and [u.sub.-] of u at the smooth points of the interface [GAMMA]. We can label similarly [D.sup.P+.sub.v] and [D.sup.P-.sub.v] the two conormal derivatives associated to P at the two sides of the interface. Then the usual transmission conditions [u.sup.+] = [u.sup.-] and [D.sup.P+.sub.u] = [D.sup.P-.sub.u] at the two sides of the smooth points of the interface are a consequence of the weak formulation, and will always be considered as part of Equation (1.1). This equation does not change if we switch "+" to "-," so our choice of labeling is not essential. At the non-smooth points of r, we assign no meaning to the interface condition [D.sup.P+.sub.u] = [D.sup.P-.sub.v]. The more general conditions [u.sup.+] - [u.sup.-] = [h.sub.0] and [D.sup.P+.sub.u] - [D.sup.P-.sub.u] = [h.sub.i] can be treated with only minor modifications. We also allow the cracks to ramify as part of [partial derivative][OMEGA].

It is well-known that when [partial derivative][OMEGA] is not smooth there is a loss of regularity in elliptic boundary-value problems. Because of this loss of regularity, a quasi-uniform sequence of triangulations on [OMEGA] does not give optimal rates of convergence for the Galerkin approximations [u.sub.h] of the solution of (1.1) [78]. One needs to consider graded meshes instead (see for example [7, 12, 70]). We approach the problem (1.1) using higher regularity in weighted Sobolev spaces. For transmission problems, these results are new (see Theorems 3.1-3.3).

We therefore begin by establishing regularity results for (1.1) in the weighted Sobolev spaces [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], where the weight may depend on each vertex of [OMEGA] (see Definition (2.7)). We identify the weights that make P Fredholm following the results of Kondratiev [46] and Nicaise [66]. If no two adjacent sides are assigned Neumann boundary conditions (i. e., when there are no Neumann-Neumann vertices), we also obtain a well-posedness result for the weight parameter [??] close to 1. In the general case, we first compute the Fredholm index of P, and then we use this computation to obtain a decomposition u = [u.sub.reg] + [sigma] of the solution of u of (1.1) into a function with good decay at the vertices and a function that is locally constant near the vertices. This decomposition leads to a new well-posedness result if there are Neumann-Neumann vertices.

Our main focus is the analysis of the Finite Element Method for Equation (1.1). We are especially interested in obtaining a sequence of meshes that provides quasi-optimal rates of convergence. For this reason, in this paper we restrict to domains in the plane. However, Theorems 3.1, 3.2, and 3.3 extend to 3D (see [58] for proofs in the absence of interfaces and [16] for a proof of the regularity in the presence of interfaces in n-dimensions). We assume that [OMEGA] has straight faces and consider a sequence [T.sub.n] of triangulations of [OMEGA]. We let

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

be the finite element space of continuous functions on [OMEGA] that restrict to a polynomial of degree m [greater than or equal to] 1 on each triangle of [T.sub.n], and let [u.sub.n] [member of] [S.sub.n] be the Finite Element approximation of u, defined by equation (5.1). We then say that Sn provides quasi-optimal rates of convergence for f [member of] [H.sup.m-1]([OMEGA]) if there exists C > 0 such that

(1.2) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

for all f [member of] [H.sup.m-1]([OMEGA]). We do not assume u [member of] [H.sup.m+1] ([OMEGA]). (In three dimensions, the power m/2 has to be replaced with m/3.) Hence the sequence [S.sub.n] provides a quasi-optimal rate of convergence if it recovers the asymptotic order of convergence that is expected if u [member of] [H.sup.m+1]([OMEGA]) and if quasi-uniform meshes are used. See the papers of Brenner, Cui, and Sung [26], Brannick, Li, and Zikatanov [24], and Guzman [38] for other applications of graded meshes. Corner singularities and discontinuous coefficients have been studied also using "least squares methods" [21, 22, 29, 50, 49]. Here we concentrate on improving the convergence rate of the usual Galerkin Finite Element Method, to approximate singular solutions in the transmission problem (1.1). The new a priori estimates in augmented weighted Sobolev spaces developed in Section 4 play a crucial role in our analysis of the numerical method.

The problem of constructing sequences of meshes that provide quasi-optimal rates of convergence has received much attention in the literature--we mention in particular the work of Apel [2], Babuska and collaborators [7,11,12,13,37], Bacuta, Nistor, and Zikatanov [17], Bacuta, Bramble, and Xu [14], Costabel and Dauge [33], Dauge [34], Grisvard [36], Lubuma and Nicaise [56], Schatz, Sloan, and Wahlbin [74]. Let us mention the related approach of adaptive mesh refinements, which also leads to quasi-optimal rates of convergence in two dimensions [23,59,63]. Similar results are needed for the study of stress-intensity factors [25, 28]. However, the case of hyperbolic equations is more difficult [60]. Cracks are important in Engineering applications, see [35] and the references therein. Transmission problems are important in optics and acoustics [30]

We exploit the theoretical analysis of the operator P to obtain an a priori bound and interpolation inequalities. These in turn allow us to verify that the sequence of graded meshes we explicitly construct yields quasi-optimal rates of convergence. For transmission problems, we recover quasi-optimal rates of convergence if the data is in [H.sup.m-1]([[OMEGA].sub.j]) for each j. To account for the pathologies in [OMEGA], we work in weighted Sobolev spaces with weights that depend on a particular vertex a more general setting than the one considered in [18]. The use of inhomogeneous norms allows us to theoretically justify the use of different grading parameters at different vertices when constructing graded meshes. A priori estimates are a well-established tool in Numerical Analysis; see e.g., [4, 5, 8, 10, 20, 27,31, 39, 45, 62, 77].

At the same time, we address several issues that are of interest in concrete applications, but have received little attention. For instance, we consider cracks and higher regularity for transmission problems. Regularity and numerical issues for transmission problems were studied before by several authors; see for example Nicaise [66] and Nicaise and Sandig [67] and references therein. As in these papers, we use weighted Sobolev spaces, but our emphasis is not on singular functions, but rather on well-posedness results. This approach leads to a unified way to treat mixed boundary conditions and interface transmission conditions. In particular, there is no additional computational complexity in treating Neumann-Neumann vertices. Thus, although the theoretical results we establish are different in the case of NeumannNeumann corners than in the case of Dirichlet-Neumann or simply Dirichlet boundary conditions, the numerical method that results is the same in all these cases, which should be an advantage in implementation.

The paper is organized as follows. In Section 2, we introduce the notion of domain with polygonal structure and discuss the precise formulation of the transmission/boundary value problem (1.1) in the weighted Sobolev space [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. In Section 3, we state and prove preliminary results concerning regularity and solvability of the problem (1.1) when the interface is smooth and no two adjacent sides of [OMEGA] are given Neumann boundary conditions (Theorems 3.1, 3.2, 3.3). In Section 4, we consider the more difficult case of Neumann-Neumann vertices and non-smooth interfaces. We exploit these results and spectral analysis to obtain a new well-posedness result in a properly augmented space [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], and arbitrarily high regularity of the weak solution u in each subdomain [[OMEGA].sub.j] (Theorems 4.5 and 4.7). For simplicity, we state and prove these results for the model example of P = div(A[NABLA]u), A a piecewise constant function, which will be used for numerical tests. By contrast, when interfaces cross, compatibility conditions on the coefficients need be imposed to obtain higher regularity in [H.sup.s]([OMEGA]), 1 < s < 3/2 [69]. In Section 5, we tackle the explicit construction of graded meshes giving quasi-optimal rates of convergence for the FEM solution of the mixed boundary/transmission problem (1.1) in the case of a piecewise linear domain, and derive the necessary interpolation estimates (Theorems 5.11 and 5.12). In Section 6, we test our methods and results on several examples and verify the optimal rate of convergence.

[FIGURE 2.1 OMITTED]

We hope to extend our results to three dimensional polyhedral domains. The regularity results are known to extend to that case [16]. The problem is that the space of singular functions is infinite dimensional in the three dimensional case. Further ideas will therefore be needed to handle the case of three dimensions.

2. Formulation of the problem. We start by describing informally the class of "domains with a polygonal structure" [OMEGA], a class of domains introduced (with different names and slightly different definitions) by many authors. Here we follow most closely [34]. Next we describe in more detail the formulation of the transmission/mixed boundary value problem (1.1) associated to P and interface [GAMMA]. The coefficients of P may have jumps at [GAMMA].

2.1. The domain. The purpose of this section is to provide an informal description of the domains under consideration, emphasizing their rich structure and their suitability for transmission/mixed boundary value problems. In Figure 2.1, we exemplify the various types of singularities, some of geometric nature, others stemming from solving the transmission/mixed boundary value problem (1.1). These singularities are discussed in more detail below.

We consider bounded polygonal-like domains [OMEGA] that may have cracks or vertices that touch a smooth part of the boundary. Recall that polygonal domains are not always Lipschitz domains, however, the outer normal to the boundary is well-defined except at the vertices. If cracks are present, then the outer normal is not well-defined since [partial derivative][bar.[OMEGA]] [not equal to] [partial derivative][OMEGA]. In order to study cracks, we model each smooth part of a crack as a double covering of a smooth curve. We then distinguish the two normal directions in which we approach the boundary. This distinction is also needed when we study vertices that touch the boundary. When cracks ramify, we need further to differentiate from which direction we approach the point of ramification. This distinction will be achieved by considering the connected neighborhoods of B(x, r)[intersection]C, when x is on the boundary, as in Dauge [34]. More precisely, we will distinguish for each point of the boundary the side from which we approach it. This defines, informally, the "unfolded boundary" [[partial derivative].sup.u][OMEGA] of [OMEGA]. What is most important for us in this concept, is that each smooth crack point p of [OMEGA] will be replaced in [[partial derivative].sup.u][OMEGA] by two points, corresponding to the two sides of the crack and the two possible non-tangential limits at p of functions defined on [OMEGA].

We really need the distinction between the usual boundary [partial derivative][OMEGA] and the unfolded boundary [[partial derivative].sup.u][OMEGA], since it plays a role in the implementations. Moreover, we can define the "inner-pointing normal" vector consistently [??] at every smooth point of [[partial derivative].sup.u][OMEGA], even at crack points (but not at vertices). The outer normal to [[partial derivative].sup.u][OMEGA] is defined by v = -[??]. Similarly, we defined the "unfolded closure" [??] := [OMEGA] [union] [[partial derivative].sup.u][OMEGA]. The test functions used in our implementation will be defined on [sup.u][bar.[??]] and not on [bar.[OMEGA]] (this point is especially relevant for the difficult and important case of cracks that are assigned Neumann boundary conditions on each side). More details will be included in a forthcoming paper [52].

When considering mixed boundary conditions, it is well known that singularities appear at the points where the boundary conditions change (from Dirichlet to Neumann). These singularities are very similar in structure to the singularities that appear at geometric vertices. We therefore view "vertices" simply as points on the boundary with special properties, the geometric vertices being "true vertices" and all others being "artificial vertices." The set of artificial vertices includes, in particular, all points where the type of boundary conditions change, but may include other points as well (coming from the interface for example). This choice allows for a greater generality, which is convenient in studying operators with singular coefficients.

We therefore fix a finite set V [subset] [[partial derivative].sup.u][OMEGA], which will serve as the set where we allow singularities in the solution of our equation. We shall call the set V the set of vertices of [OMEGA]. The set of vertices V will contain at a minimum all non-smooth points of the boundary or of the interface, all points where the boundary conditions change, and all points where the boundary intersects the interface, but there could be other points in V as well. In particular, V is such that all connected components of [[partial derivative].sup.u][OMEGA]\V consist of smooth curves on which a unique type of boundary condition (Dirichlet or Neumann) is given. In particular, the structure on [OMEGA] determined by V is not entirely given by the geometry and depends also on the specifics of the transmission/boundary value problem. This structure, in turns, when combined with the introduction of the unfolded boundary, gives rise to the concept of a domain with a polygonal structure, introduced in [34] and discussed at length in [58] (except the case of a vertex touching a smooth side).

2.2. The equation. We consider a second order scalar differential operator with real coefficients [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

(2.1) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

We assume, for simplicity, that [A.sup.ij] = [A.sup.ji]. The model example, especially for the numerical implementation, is the operator P = div A[nabla], where A is a piece-wise constant function. Under some mild assumptions on the lower-order coefficients, the results in the paper extend also to operators of the form [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Our methods apply as well to systems and complex-valued operators, but we restrict to the scalar case for the sake of clarity of presentation. In [58], we studied the system of anisotropic elasticity [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] in 3 dimensions (in the notation above (2.1), [A.sup.ij] = [[[C.sub.pq]].sup.ij]).

We assume throughout the paper that P is uniformly strongly elliptic, i.e.,

(2.2) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

for some constant C > 0 independent of x [member of] [bar.[OMEGA]] and [xi] [member of] [R.sup.2].

We also assume that we are given a decomposition

(2.3) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

where [[OMEGA].sub.j] are disjoint domains with a polygonal structure, and define the interface

(2.4) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

which we assume to be the union of finitely many piecewise smooth curves [[GAMMA].sub.k]. We allow the curves [[GAMMA].sub.k], to intersect, but we require these intersections to be transverse, i. e., not tangent. We take the coefficients of the differential operator P to be piecewise smooth in [OMEGA] with possible jumps only along [GAMMA], that is, the coefficients of P on [[OMEGA].sub.j] extend to smooth functions on [bar.[[OMEGA].sub.j]]. Also, we assume that all the vertices of the domains with a polygonal structure [[OMEGA].sub.j] that are on the boundary of [OMEGA] are already included in the set V of vertices of [OMEGA].

To formulate our problem, we introduce inhomogeneous weighted Sobolev spaces, where the weight depends on the vertex, considered before in [57]. Let d(x, Q) be the distance from x to Q [member of] V, computed using paths in [sup.u][bar.[OMEGA]] and let

(2.5) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

Let [??] = ([a.sub.Q]) be a vector with real components indexed by Q [member of] V. We denote t + [??] = (t + [a.sub.Q]), but write t instead of [??] if all the components of [??] are equal to t. We then set

(2.6) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

and define the mth weighted Sobolev space with weight a by

(2.7) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

The distance function v is continuous on [sup.u][bar.[OMEGA]] but it is not smooth at the vertices. Whenever derivatives of v are involved, we implicitly assume that v has been replaced by a more regular weight function [.sub.[OMEGA]]. This weight function is comparable to v and induces an equivalent norm on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. One can describe the spaces [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] also using certain dyadic partitions of unity. See [1, 33, 47, 58] for example. Such partitions of unity allow also to define spaces on the (unfolded) boundary of [OMEGA], [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], s [member of] R, for which the usual interpolation, duality, and trace properties still apply.

Our first goal is to study solvability of the problem (1.1) in [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. The boundary conditions are given on each side in the unfolded boundary [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], where we assume that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

such that [[partial derivative].sub.D][OMEGA] a union of closed sides of [OMEGA]. We impose Neumann data [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] and Dirichlet data [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. By the surjectivity of the trace map, we can reduce to the case gD = 0 (in trace sense).

For m = 0, the problem (1.1) must be interpreted in an appropriate weak (or variational) sense, which we now discuss. For each u, v [member of] [H.sup.1]([OMEGA]), we define the bilinear form [B.sub.P](u, v)

(2.8) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

and denote by [D.sup.P.sub.v] the conormal derivative operator associated to P, given by

(2.9) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

The definition of [D.sup.P.sub.v]u is understood in the sense of the trace at the boundary. In particular, when u is regular enough [D.sup.P.sub.v]u is defined almost everywhere as a non-tangential limit, consistently with v being defined only almost everywhere on [[partial derivative].sup.u][OMEGA]. We recall that v is defined on [[partial derivative].sup.u][OMEGA] except at the vertices because the smooth crack points of [partial derivative][OMEGA] are doubled in [[partial derivative].sup.u][OMEGA].

Since [OMEGA] is a finite union of Lipschitz domains, Green's Lemma holds for functions in [H.sup.2]([OMEGA])[36], that is,

(2.10) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Hence, we let

(2.11) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

and we define the weak solution u of equation (1.1) with gD = 0 as the unique [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] satisfying

(2.12) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]* is defined by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], the integrals being duality pairings between distributions and (suitable) functions.

When u is regular enough, problem (1.1) is equivalent to the following mixed boundary value/interface problem

(2.13) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where it is crucial that [partial derivative]N[OMEGA] and [[partial derivative].sub.D][OMEGA] are subsets of the unfolded boundary. (Recall that the unfolded boundary is defined by doubling the smooth points of the crack. In particular, one can have Dirichlet boundary conditions on one side of the crack and Neumann boundary conditions on the other side of the crack.) In (2.13), [u.sup.+] and [u.sup.-] denote the two non-tangential limits of u at the two sides of the interface [GAMMA]. This choice can be done consistently at each smooth point of [GAMMA]. Similarly, [D.sup.P+.sub.v] and [D.sup.P-.sub.v] denote the two conormal derivatives associated to P and the two sides of [GAMMA]. Note that the singularities in the coefficients of A are taken into account in the definitions of [D.sup.P+.sub.v] and [D.sup.P-.sub.v]. If u is only in [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] and satisfy (2.12), then the difference [D.sup.P+.sub.v] u - [D.sup.P-.sub.v] u may be non-zero (so (2.13) is not strictly satisfied), but may be included as a distributional term in f.

Thus the usual transmission conditions [u.sup.+] = [u.sup.-] and [D.sup.P+.sub.v]u = [D.sup.P-.sub.v]u at the two sides of the interface are a consequence of the weak formulation, and will always be considered as part of equation (1.1). The slightly more general conditions [u.sup.+] - u- = [h.sub.0] and [D.sup.P+.sub.v]u - [D.sup.P-.sub.v]u = [h.sub.1] can be treated with only minor modifications, as explained in [67]. More precisely, the term [h.sub.0] can be treated using extensions similarly to the term gD. The term [h.sub.1] can be treated by introducing in the the weak formulation the term [[integral].sub.[GAMMA]][h.sub.1]uds, where ds is arc length on [GAMMA].

In order to establish regularity and solvability of (2.13), under the hypothesis that P is uniformly strongly elliptic, we shall use coercive estimates. We say that P is coercive on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] if there exists [theta] > 0 and [gamma] [member of] R such that

(2.14) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

If this inequality holds for some [gamma] < 0, we say that P is strictly coercive on [H.sub.0] (or strictly positive) and write P > 0. The operator P in (2.1) is always coercive on [H.sub.0]. If there are no Neumann-Neumann vertices and the interface [GAMMA] is smooth, then P is strictly coercive on [H.sub.0], as it will be discussed in the next section.

3. Preliminary results. Our approach in studying singularities for problem (2.13) is based on solvability in weighted spaces rather than on singular functions expansions. We begin with three results on regularity and well-posedness for the boundary-value problem (2.13), which we first state and then prove. See [17, 18, 42, 43, 44, 6, 46, 47, 65, 66, 67] for related results. In particular our result should be compared with [66], especially Theorem 3.12. By "well-posedness" we mean "existence and uniqueness of solutions and continuous dependence on the data." Recall that for transmission problems we assume that all the vertices of the domains with a polygonal structure [[OMEGA].sub.j] that are on the boundary of [OMEGA] are included in the set of vertices of [OMEGA]. Below, if no interface is given, we take [OMEGA] = [[OMEGA].sub.1]. When [OMEGA] [not equal to] [[OMEGA].sub.1] [not equal to] 0, we have a proper transmission problem.

We first deal with the general case of an interface that is the union of finitely many piecewise smooth curves with transverse intersections, and establish that the transmission/mixed boundary problem (1.1) satisfies a regularity property. We assume that the non-smooth points of the interface [GAMMA] are included in the vertices of the adjacent domains [[OMEGA].sub.j] (the self-intersection points, which are assumed to be transverse, are also included in the set of vertices). This regularity result is crucial in obtaining the necessary a priori estimates for quasi-optimal rates of convergence in Section 5 for transmission problems.

We first state our main results on regularity and well-posedness and then we prove them.

Theorem 3.1. Assume that P = - div A[nabla] is a uniformly strongly elliptic, scalar operator in divergence form on [OMEGA] with piecewise smooth coefficients. Also, assume that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. is a solution of the transmission/mixed boundary problem

(1.1). Let m [greater than or equal to] 0, and suppose that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], and f: [OMEGA][right arrow] R is such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], for each j, and we have the estimate

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

for a constant C that is independent of u and the data f, gN, and gD.

Note that, in the above result, the spaces [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. are defined intrinsically, i. e., without reference to [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]., using as weight the distance to the set of vertices of [[OMEGA].sub.k], which includes also the points of [[bar.[OMEGA]].subj] where r is not smooth or where it ramifies.

The next two results deal with solvability of the problem (1.1), in the case of a smooth interface and when [[partial derivative].sup.u][OMEGA] contains no adjacent sides with Neumann boundary conditions. (The condition that [GAMMA] is smooth in particular implies that [GAMMA] is a disjoint union of smooth curves.) These results are also the basis for the analysis in Section 4 in the presence of Neumann-Neumann vertices and general interfaces (Theorems 4.5 and 4.7, where an augmented domain for the operator is required). Recall that the weak solution u is given in equation (2.12) with [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. (because we take gD = 0).

Theorem 3.2. Assume that P is a uniformly strongly elliptic, scalar operator on [bar.[OMEGA]]. Assume also that no two adjacent sides [OMEGA] are given Neumann boundary conditions and that the interface [GAMMA] is smooth. Then P is strongly coercive on [H.sub.0] and for each vertex Q of [OMEGA] there exists a positive constant [[eta].sub.Q] with the following property: for any [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] with there exists a unique weak solution [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] of equation

(2.13), and we have the estimate

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

for a constant C = C([??]) that is independent of [PHI].

When the data is more regular, we can combine the above two theorems into a well-posedness result for the transmission/mixed boundary problem. We note that continuous dependence of the solution on the data immediately follows from the estimate below since the boundary-value problem is linear.

THEOREM 3.3. Let m [greater than or equal to] 1. In addition to the assumptions of Theorem 3.2, assume that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] and that f : [OMEGA] [right arrow] R is such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Then the solution [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] of equation (2.13) satisfies [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], for all j, and we have the estimate

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

If [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], that is, if lower order coefficients are included, our results extend to the case when [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], where [??] = ([b.sup.i])

Let us denote by Pv = ((c)P|n3, Dp)v := (Pv|nl,..., Pv|nN, Dpv), decorated with various indices. As a corollary to the theorem, we establish the following isomorphism.

COROLLARY 3.4. We proceed as in [58]. Let m [greater than or equal to] 1. Under the assumptions of Theorem 3.3, the map

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

is an isomorphism for [absolute value of [a.sub.Q]] < [eta]Q. See [58] for more details of this method.

We next turn to the proofs of Theorems 3.1, 3.2, and 3.3. We will only sketch proofs and concentrate on the new issues raised by the presence of interfaces, referring for more details to [1, 17, 58], where similar results were established for mixed boundary value problems in homogeneous [K.sup.m.sub.a] spaces.

Proof of Theorem 3.1. Using a partition of unity, it is enough to prove the result on the model problem (2.13) with [OMEGA] = [R.sup.n] and [GAMMA] = {[x.sub.n] = 0}, that is, no boundary and one interface. We can assume without loss of generality that u has compact support on a fixed ball B centered at the origin. Then by known regularity results [71] (see also [66] and references therein), if u [member of] [H.sup.1.sub.0](B) and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

We next turn to the proof of well-posedness for the transmission/mixed boundary problem (2.13), namely, to the proofs of Theorems 3.2 and 3.3. As before, we denote [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] where [[partial derivative].sub.D][OMEGA] is assumed non empty, and we set [H.sub.0] = [H.sub.[??]] Strict coercivity of P on [H.sub.0] then ensues in the standard fashion from a weighted form of Poincare inequality, which we now recall.

Lemma 3.5. Let [OMEGA] [subset] [R.sup.2] be a domain with a polygonal structure. Let v(z) be the canonical weight function on [OMEGA] and let [partial derivative].sub.D][OMEGA] be a non-empty closed subset of the unfolded boundary [[partial derivative].sup.u][OMEGA] such that [[partial derivative].sup.u][OMEGA] = [[partial derivative].sub.D]\[OMEGA] is a union of oriented open sides of [OMEGA], no two of which are adjacent. Then there exists a constant [C.sub.[OMEGA]] > 0 such that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for any u [member of] [H.sup.1]([OMEGA)) satisfying u = 0 on [[partial derivative].sub.D][OMEGA].

In particular, any u [member of] [H.sup.1]([OMEGA]) satisfying the assumptions of the above theorem will be automatically in [K.sup.0.sub.1]([OMEGA]). This estimate is a consequence of the corresponding estimate on a sector, which can be proved in the usual way, given that are only finitely many vertices and that near each vertex Q, [sup.u][??] is diffeomorphic to a sector of angle 0 < [alpha] [less than or equal to] 2[pi] [17, 65] (the angle is 2[pi] at crack tips).

Proof of Theorems 3.2 and 3.3. We first observe that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

using the strong ellipticity condition, equation (2.2). By Lemma 3.5, -[DELTA] is strictly coercive on [H.sub.0], given the hypotheses on [[partial derivative].sup.u][OMEGA]. Therefore, if u [member of] [H.sub.0]

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The first part of Theorem 3.2 is proved.

Next, we employ the maps

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

of Corollary 3.4. To prove the rest of the Theorems 3.2 and 3.3, we will show that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] a is an isomorphism for m [greater than or equal to] 0 and [absolute value of cq] < [[eta].sub.q]. Since [B.sub.P] is strictly coercive on [H.sub.0], it satisfies the assumptions of the Lax-Milgram lemma, and hence [B.sup.*.sub.P] : [H.sub.0] [right arrow] [H.sup.*.sub.0] is an isomorphism, where [B.sup.*.sub.P](u)(v) = [B.sub.P](u, v). That is, [[??].sub.0,0 is an isomorphism. Hence, Theorems 3.2 and 3.3 are established for m = 0 and [??] = 0.

To extend the results to the case [??] [not equal to] 0 with [absolute value of [a.sub.QW] < [[eta].sub.q], we exploit continuity. Let [r.sub.[OMEGA]] be a smoothing of v outside the vertices. As in [1, 58], the family of operators [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] act on the same space and depend continuously on [??]. Since [P.sub.0,0] is an isomorphism, we obtain that [P.sub.0,[??]] is an isomorphism for a close to 0. In particular, there exists vq > 0 such that for [absolute value of [a.sub.Q]] < [[eta].sub.q], [P.sub.0,[??]] is an isomorphism. The proof of Theorems 3.2 and 3.3 are complete for m = 0.

It only remains to prove Theorem 3.3 for m [greater than or equal to] 1. Indeed, Theorem 3.1 gives that [[??].sub.m,[??]] is surjective for [absolute value [a.sub.Q]] < [[eta].sub.Q], since it is surjective for m = 0. This map is also continuous and injective (because it is infective for m = 0), hence it is an isomorphism. Consequently [[??].sub.m,[??]], [absolute value of [a.sub.Q]] < [[eta].sub.Q], is an isomorphism by the open mapping theorem.

The above three theorems extend to the case of polyhedral domain in three dimensions using the methods of [58] and [16]. The case of three dimensions will be however treated separately, because the 3D Neumann problem is significantly more complex, especially when it comes to devising efficient numerical methods. The case of Neumann-Neumann adjacent faces in 3D cannot be treated by the methods of this paper alone, however.

4. Neumann-Neumann vertices and nonsmooth interfaces. In this section, we obtain a new type of well-posedness for the problem (1.1) in the spaces [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] that applies also to general interfaces and to Neumann-Neumann vertices. Our result combines the singular function decompositions with more typical well-posedness results. Singular function decompositions for interface problems have been discussed also in [43, 42, 66, 67] and more recently [79], to give just a few examples.

We restrict to a special class of operators P, for which the spectral analysis is amenable. Specifically, we consider the case of the Laplace operator [DELTA], when there are Neumann-Neumann vertices but no interface, and the case of -div A[nabla], with A piecewise constant, when there are interfaces. In this last case, the operator is still a multiple of the Laplacian on each subdomain. Except for the explicit determination of the constants [[eta].sub.Q], our results extend to variable coefficients. In both cases, we can compute explicitly the values of the weight [a.sub.Q] for which the operator P is Fredholm. These values will be used to construct the graded meshes in Section 5.

4.1. The Laplace operator. When P = -[DELTA], the Laplace operator, it is possible to explicitly determine the values of the constants [[eta].sub.Q] appearing in Theorems 3.2 and 3.3. In this subsection, we therefore assume that P = -[DELTA] and there are no interfaces, that is, [OMEGA] = [[OMEGA].sub.1].

Recall that to a Fredholm operator T : X [right arrow] Y between Banach spaces is associated a unique number, called the index, defined by the formula ind(T) = dim ker(T) - dim(Y/X). For a discussion of Fredholm operators, see e.g., [73].

For each vertex Q [member of] V, we let [[alpha].sub.Q] be the interior angle of [[partial derivative.sup.u][OMEGA] at Q. In particular, [alpha].sub.Q] = 2[pi] if Q is the tip of a crack, and [alpha]Q = [pi] if Q is an artificial vertex. We then define

(4.1) [[SIGMA].sub.Q] := {k[pi]/[alpha].sub.Q]},

where k [member of] Z if Q [member of] V is a Neumann-Neumann vertex, k [member of] Z \ {0} if Q [member of] V is a Dirichlet-Dirichlet-- vertex, and k [member of] 1/2 + Z otherwise. The operator pencil [P.sub.Q]([tau]) (or indicial family) associated to -[DELTA] at Q is [P.sub.Q]([tau]) := [([tau] - ie).sup.2] - [[partial derivative].sup.2.sub.[theta]], where (r, [sigma]), where (r, [theta]) are local polar coordinates at Q. The operator [P.sub.Q]([tau]) is defined on functions in [H.sup.2]([0, [[alpha].sub.Q]) that satisfy the given boundary conditions, and is obtained by evaluating

(4.2) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

P([tau]) is invertible for all [tau] [member of] R, as long as [epsilon] [??] [[SIGMA].sub.Q].

We are again interested in the well-posedness of the problem (1.1) when Neumann-Neumann vertices exist. We therefore consider the operator

(4.3) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

which is well defined for m [greater than or equal to] 1. Recall that we can extend [[DELTA].SUB.[??]] to the case m = 0 as

(4.4) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

where u [member of] [H.sub.[??]] and v [member of] [H.sub.[-??]] (recall that [H.sub.[??]] is defined in (2.11)). For transmission problems, a similar formula allows to extend the operator (P, [[partial derivative].sup.v.sub.P]) to the case m = 0.

Following Kondratiev [46] and Nicaise (for the case of transmission problems) [66] we can prove the result below, using also the regularity theorem 3.1.

THEOREM 4.1. Let P = -[DELTA], m [greater than or equa to] 0, and [??] = ([a.sub.Q]). Also, let [[??].sub.[??]] be the operator defined in equations (4.3) and (4.4) for the case when there is no interface. Then [[??].sub.[??] is Fredholm if, and only if, [a.sub.Q] [??] [[SIGMA].sub.Q]. Moreover, its index is independent of m.

Proof. The Fredholm criterion is well known [46, 48, 76]. (The case m = 0 was not treated explicitly, but it is proved in exactly the same way.) We prove that the index is independent of m. Indeed, if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], then the regularity theorem, Theorem 3.1, implies that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. The same observation for the adjoint problem shows that the index is independent of m.

The case m = 0 is relevant because in that case

(4.5) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

an equation that does not make sense (in any obvious way) for other values of m. It is then possible to determine the index of the operators [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] by the following index calculation. Recall that in this subsection we assume the interface to be empty. Let [??] = ([a.sub.Q]) and [??] = ([b.sub.Q]) be two vectorial weights that correspond to Fredholm operators in Theorem 4.1. Let us assume that there exists a vertex Q such that [a.sub.Q] < [b.sub.Q] but [a.sub.R] = [b.sub.R] if R [not equal to] Q. We count the number of values in the set ([a.sub.Q], [b.sub.Q]) [intersection] [[SIGMA].sub.Q], with the values corresponding to k = 0 in the definition of [[SIGMA].sub.Q], equation (4.1), counted twice (because of multiplicity, which happens only in the case of Neumann-Neumann boundary conditions). Let N be the total number. The following result, which can be found in [66] (see also [32, 46, 47, 64, 65]), holds.

THEOREM 4.2. Assume the conditions of Theorem 4.1 are satisfied. Also, let us assume that [a.sub.Q] < [b.sub.Q] but [a.sub.R] = [a.sub.R] if R [not equal to] Q, and let N be defined as in the paragraph above. Then

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.],

This theorem allows to determine the index of [[??].sub.[??]]. For simplicity, we compute the index only for [a.sub.Q] > 0 and small. Let [[delta].sub.Q] be the minimum values of s [member of] [[SIGMA].sub.Q] (0, [infinity]). Then [[delta].sub.Q] = [pi]/[[alpha].sub.Q], if both sides meeting at Q are assigned the same type of boundary conditions, and by 2[[delta].sub.Q] = [pi]/[[alpha].sub.] otherwise.

THEOREM 4.3. Assume the conditions of Theorem 4.1 are satisfied and let [N.sub.0] be the number of vertices Q such that both sides adjacent to Q are assigned Neumann boundary conditions. We assume the interface to be empty. Then [[DELTA].sub.a] is Fredholm for 0 < [a.sub.Q] < [[delta].sub.q] with index

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

Consequently, A- j has index -N0 for 0 < cjq < Jq.

For transmission problems, we shall count in N0 also the points where the interface r is not smooth. Each such point is counted exactly once. On the other hand, a point where a crack ramifies is counted as many times as it is covered in thick closure " fi, so in effect we are counting the vertices in "fi and not in fi.

Proof. Since the index is independent of m > 0, we can assume that m = 0. A repeated application of Theorem 4.2 (more precisely of its generalization for m = 0) for each weight [a.sub.Q] gives that ind([[??].sub.[??]]) - ind([[??].sub.[??]]) = -2[N.sub.0] (each time when we change an index from -[a.sub.Q] to [a.sub.Q] we lose a 2 in the index, because the value k = 0 is counted twice). Since [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] we have ind([[??].sub.-[??]]) = -ind([[??].sub.[??]]), and therefore the desired result.

We now proceed to a more careful study of the invertibility properties of [[??].sub.[??]. In particular, we will determine the constants vq appearing in Theorems 3.2 and 3.3.

For each vertex Q [membe of] V we choose a function [x.sub.Q] [member of] [C.sub.[infinity]]([??]) that is constant equal to 1 in a neighborhood of Q and satisfies [[partial derivative].sub.v][X.sub.Q] = 0 on the boundary. We can choose these functions to have disjoint supports.

Let [W.sub.s] be the linear span of the functions [X.sub.Q] that correspond to Neumann-Neumann vertices Q. (For transmission problems, we have to take into account also the points where the interface [GAMMA] is not smooth. This is achieved by including a function of the form [x.sub.Q] for each point Q of the interface where the interface is not smooth. The condition [[partial derivative].sub.v][X.sub.Q] = 0 on the boundary becomes, of course, unnecessary.) We shall need the following version of Green's formula.

LEMMA 4.4. Assume all [a.sub.Q] [greater than or equal to] 0 and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Then ([DELTA]u,v) ([nabla]u, [nabla]v) = [([[partial derivative].sub.v]u, v)[partial derivative][OMEGA].

Proof. Assume first u and v are constant close to the vertices, then we can apply the usual Green's formula after smoothing the vertices without changing the terms in the formula. In general, we notice that C(u, v) := ([DELTA]u, v) + ([nabla]u, [nabla]v) = ([[partial derivative].sub.v],uv) depends continuously on u and v (since by hypothesis [a.sub.Q] [greater than or equal to] 0 [for all] Q) and we can then use a density argument.

Recall that we assume the interface to be empty. Then we have the following solvability (or well-posedness) result.

THEOREM 4.5. Let [??] = ([a.sub.Q]) with 0 < [a.sub.Q] < [[delta].sub.Q] and m [greater than or equal to] 1. Assume [[partial derivative].sub.D][OMEGA] [not equal to] 0. Then for any [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] and any [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], there exists a unique [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] satisfying [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] Moreover,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for a constant C > 0 independent of f and gN. When [[partial derivative].sub.D][OMEGA] = 0 (the pure Neumann problem), the same conclusions hold ifconstant functions are factored out.

Proof. Using the surjectivity of the trace map, we can reduce to the case gD = 0 and gN = 0. Let [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Since m [greater than or equal to] 1, the map

(4.6) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

is well defined and continuous. Then Theorem 4.3 implies that the map of equation (4.6) has index zero, given that the dimension of [W.sub.s] is [N.sub.0]. When there is at least a side in [[partial derivative].sub.D][OMEGA], this map is in fact an isomorphism. Indeed, it is enough to show it is injective. This is seen as follows. Let u [member of] V be such that [DELTA]u = 0. By Green's formula (Lemma 4.4), we have ([nabla]u, [nabla]u) = (-[DELTA]u, u) + ([[partial derivative].sub.v]u, u)[partial derivative][OMEGA] = 0. Therefore u is a constant. If there is at least one Dirichlet side, the constant must be zero, i.e, u = 0. In the pure Neumann case, the kernel of the map of equation (4.6) consists of constants. Another application of Green's formula shows that ([DELTA]u, 1) = 0, which identifies the range of [DELTA] in this case as the functions with mean zero.

The same argument as in the above proof gives that [[??].sub.[??]] j is injective, provided all components of [??] are non-negative, a condition that we shall write as [??] [greater than or equal to] 0). From equation (4.5), it then follows that [[??].sub.-[??]] is surjective whenever it is Fredholm. This observation implies

Theorem 3.2 for [??] = 0. Note that [[??].sub.0] is Fredholm precisely when there are no Neumann-Neumann faces. For operators of the form - div A[nabla] with A piecewise smooth, we have to assume also that the interface [GAMMA] is smooth, otherwise the Fredholm property for the critical weight [??] = 0 is lost.

We can now determine the constants vq in Theorems 3.2 and 3.3.

THEOREM 4.6. Assume P = -[DELTA]. Then we can take [[eta].sub.Q] = [[delta].sub.Q] in Theorem 3.2.

Proof. Assume that [absolute value of [a.sub.Q]] < [[eta].sub.Q]. Then [[??].sub.[??]] is Fredholm of index zero, since [[??].sub.[??]] depends continuously on [??] and it is of invertible for [??] = 0 as observed above in the context of Theorem 3.2. Assume then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for some u [member of] [H.sub.[??]]. The singular function expansion of u close to each vertex implies u [member of] [H.sub.[??]] for all [??] = ([b.sub.Q]) with 0 < [b.sub.Q] < [[eta].sub.Q] [47, 66], where [[eta].sub.Q] is the exponent s of the first singular function [r.sup.s][phi]([theta]), in polar coordinates centered at Q. Since [[??].sub.[??]] a is injective for [b.sub.Q] > 0, [[??].sub.[??]] is injective for [absolute value of [a.sub.Q]] < [[eta].sub.q]. Hence it must be an isomorphism, as it is Fredholm of index zero.

4.2. Transmission problems. The results of the previous section remain valid for general operators and transmission problems with [??] = [union][[??].sub.j], with a different (more complicated) definition of the sets [[SIGMA].sub.Q]. We consider only the case P = -divA[nabla]u = [adelta]A, where A is a piecewise constant function. Then, on each subdomain [[omeg].sub.j], [[DELTA].sub.A] is a constant multiple of the Laplacian and the associated conormal derivative is a constant multiple of [[partial derivative].sub.v], v the unit outer normal. We assume all singular points on [partial derivative][[OMEGA].sub.j] on the boundary of [OMEGA] are in the set of vertices of the adjacent domains [OMEGA].sub.j]. Moreover, we assume that the points where the interfaces intersect are also among the vertices of some [OMEGA].sub.j].

Then for each vertex Q, the set Sq is determined by {[ or -][square root of [lambda]], where A ranges through the set of eigenvalues of -[[partial derivative].sub.[theta]]A[[partial derivative].sub.[theta]] on [H.sup.2]([0, a[pi]]) with suitable boundary conditions. When Q an internal singular point, we consider the operator -[[partial derivative].sub.[theta]]A[[partial derivative].sub.[theta]] on [H.sup.2] ([0,2[pi]]) with periodic boundary conditions. We still take [[eta].sub.q] > 0 to be the least value in [[SIGMA].sub.Q] [intersection] (0, [infinity]).

We define again [[??].sub.[??]] = ([[DELTA].sub.A], [[partial derivative].sub.v]) but only for m = 0 or 1. For m = 0, it is given as in equation (4.4) with [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. For m = 1, the transmission conditions [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] must be incorporated. Here [A.sup.+] and [A.sup.-] are the limit values of A at the two sides of the interface [GAMMA] (notice that A is only locally constant on [GAMMA]). In view of Corollary 3.4, we set

(4.7) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

For higher values of m, additional conditions at the interface are needed. (These conditions are not included in (2.13).) We will however obtain higher regularity on each subdomain.

The theorems of the previous section then remain true for the transmission problem with the following changes. In Theorem 4.1, we take only m = 0 or m = 1. In Theorem 4.3, we again assume only m = 0 or m = 1 and in N0 we also count the number of internal vertices (that is, the vertices on the interface that are not on the boundary). The proofs are as in Kondratiev's paper [46]. Theorem 4.2 is essentially unchanged. In particular, we continue to count twice [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], so that N0 is the number of Neumann-Neumann vertices plus the number of internal vertices. The points where the boundary conditions change (Dirichlet-Neumann points) are not included in the calculation of [N.sub.0].

Let us state explicitly the form of Theorem 4.5, which will be needed in applications. In the following statement, [W.sub.s] is the linear span of the functions [x.sub.Q] with Q corresponding to Neumann-Neumann vertices and internal vertices. We require that all the functions [x.sub.Q] have disjoint supports. Also, recall that for each Neumann-Neumann vertex Q, the function [x.sub.Q] satisfies [X.sub.Q] = 0 on [[partial derivative].sub.D][OMEGA] and [[partial derivative].sub.v][X.sub.Q] = 0 on [[partial derivative].sub.N][OMEGA], However, the functions [X.sub.Q] corresponding to internal vertices Q need not satisfy any boundary conditions.

Theorem 4.7. Let [??] = ([a.sub.Q]) with 0 < [a.sub.Q] < [[delta].sub.Q] and m [greater than or equal to] 1. Assume that [partial derivstive [a.sub.Q] = 0. Then for any f : [omega] [right arrow] R such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], for all j, and any [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], we can find a unique [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] satisfying [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], and the transmission conditions [u.sup.+] = [u.sup.-] and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] on the interface [GAMMA]. Moreover,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for a constant C > 0 independent off and gN. The same conclusions hold for the pure Neumann problem ifconstant functions are factored.

Proof. Assume first m = 1. Then the same proof as that of Theorem 4.5 applies, since in this case we can restrict to the boundary and apply Green's formula. For the other values of m we use the case m = 1 to show the existence of a solution and then use the regularity result of Theorem 3.1 in each [[omega].sub.j].

We conclude this section with a few simple observations. First of all, any norm can be used on the finite-dimensional space [W.sub.s], as they are all equivalent. Secondly, [W.sub.s] [intersection] [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], whenever [a.sub.q] > 0 for any Neumann-Neumann vertex Q or internal Q.

Finally, the condition [a.sub.q] [member of] (0, [[eta].sub.]Q) can be relaxed to |[a.sub.Q]| < [[eta].sub.Q] for the vertices that are either Dirichlet-Dirichlet or Dirichlet-Neumann. We can also increase [a.sub.q], provided that we include more singular functions. Most importantly, since [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], it follows that the solution provided by the Theorem 4.7 is the same as the weak solution of the Neumann problem provided by the coercivity of the form [B.sub.p] on [H.sup.1] ([omega]).

5. Estimates for the Finite Element Method. The purpose of this section is to construct a sequence of (graded) triangular meshes [T.sub.n] in the domain [omega] that give the quasioptimal rate of convergence for the Finite Element approximation of the mixed boundary value/interface problem (2.13).

For this and next section we make the following conventions. We assume that the boundary of [omega] and the interface [GAMMA] are piecewise linear and we fix a constant m [member of] N corresponding to the degree of approximation. For simplicity, we also assume for the theoretical analysis that there are no cracks or vertices touching the boundary, that is that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. The case when [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] can be addressed by using neighborhoods and distances in [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

5.1. A note on implementation. We include a numerical test on a domain with a crack in Section 6. In these tests, the "right" space of approximation functions consists of functions

defined on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], and not on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (we need different limits according to the connected component from which we approach a crack point). Therefore the nodes used in the implementation will include the vertices of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], counted as many times as they appear in that set. The same remark applies to ramifying cracks, where even more points have to be considered where the crack ramifies.

5.2. Approximation away from the vertices. We start by discussing the simpler approximation of the solution u far from the singular points. We recall that all estimates in the spaces [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] localize to subsets of [omega]. Let T be a mesh of [omega]. By a mesh or a triangulation of [omega] we shall mean the same thing. We denote by [??](T, m) the Finite Element space associated to the mesh T. That is, [??](T, m) consists of all continuous functions x : [??] - R such that x coincides with a polynomial of degree [greater than or equal to] m on each triangle T [member of] T. Eventually, we will restrict ourselves to the smaller subspace S(T, m) [subset] [??](T, m) of functions that are zero on the Dirichlet part of the boundary [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. To simplify our presentation, we assume [g.sub.N] = 0 in this section although our results extend to the case [g.sub.N] [not equal to] 0. Then, the Finite Element solution [u.sub.S] [member of] S(T, m) for equation (2.13) is given by

(5.1) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

We denote by [u.sub.I] = [u.sub.I,T,m] [member of] [??](T, m) the Lagrange interpolant of u [member of] C([omega]). We recall its definition for the benefit of the reader. First, given a triangle T, let [[t.sub.0], [t.sub.1], [t.sub.2]] be the barycentric coordinates on T. The nodes of the degree m Lagrange triangle T are the points of T whose barycentric coordinates [[t.sub.0],[t.sub.1],[t.sub.2]] satisfy m[t.sub.j] [member of] Z. The degree m Lagrange interpolant [u.sub.I,t,m] of u is the unique function [u.sub.I,t,m] [member of] {??](T, m) such that u = [u.sub.I,t,m] at the nodes of each triangle [T.sub.i] [member of] T. The shorter notation [u.sub.I] will be used when only one mesh is understood in the discussion (recall that m is fixed). The interpolant [u.sub.I] has the following approximation property [8, 27, 31, 77].

Theorem 5.1. Let T be a triangulation of [omega]. Assume that all triangles [T.sub.i] in T have angles [less than or equal to] [alpha] and sides of length [greater than or equal to] h. Let u [member of] [H.sup.m+1]([omega]) and let [u.sub.I] := [u.sub.I,T,m] [member of] [??](T, m) be the degree m Lagrange interpolant of u. Then, there exist a constants C([alpha], m) > 0 independent ofu such that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The following estimate for the interpolation error on a proper subdomain of [omega] then follows from the equivalence of the [H.sup.m]([omega])-norm and the [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.][MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]-norm on proper subsets [omega]. Recall the modified distance function [??] defined in equation (2.5). If G is an open subset of [omega], we define

(5.2) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. and we let [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] denote the corresponding norm.

Proposition 5.2. Fix [alpha] > 0 and 0 < [xi] < [??]. Let [subset] [omega] be an open subset such that [??] > [xi] on G. Let T = ([T.sub.j]) be a triangulation of [omega] with angles [less than or equal to] [alpha] and sides [greater than or equal to] h. Then for each given weight [??], there exists C = C([alpha], [xi], m, [??]) > 0 such that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

The next step is to extend the above estimates to hold near the vertices. To this end, we consider the behavior of the [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] under appropriate dilations. Let us denote by B(Q, [??]) the ball centered at a vertex Q with radius [??]. We choose a positive number [??] such that

(i) the sets [V.sub.i] := [omega] [intersection] B([Q.sub.i],[??]) are disjoint,

(ii) [V](x) = [[absolute value of] x - [Q.sub.i] on [V.sub.i]],

(iii) [V](x) [less than or equal to] l/2 outside the set V := [union] [V.sub.i].

We note that the space [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] depends only on the weight [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Hence we will denote it simply by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

For the rest of this subsection, we fix a vertex Q = [Q.sub.i], and with abuse of notation we set V := [V.sub.i] = [omega] [intersection] B(Q, [??]). We then study the local behavior with respect to dilations of a function [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] with support in the neighborhood V of a vertex Q. Therefore, we translate the origin to agree with Q and call again (x, y) the new coordinates. Let G be a subset of V such that [xi] [greater than or equal to] V (x) [greater than or equal to] l on G. For any fixed 0 < [lambda] < 1, we set G' := [lambda] G = {[lambda]x [absolute value of] x [member of] G}. Then, we define the dilated function [v.sub.[lambda]](x) := v([lambda]x), for all (x, y) [member of] G. We observe that since V is a (straight) sector, if G [subset] V then G' [subset] V. The following simple dilation lemma can be proved by direct calculation.

Lemma 5.3. Let G [subset] V and G' = [lambda]G, 0 < A < 1. If [u.sub.[lambda]](x) := u ([lambda]x), then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

Lemma 5.3 and Proposition 5.2 easily give the following interpolation estimate near a vertex Q.

Lemma 5.4. Let G' [subset] V be a subset such that V > [xi] > 0 on G'. Let T be triangulation of G' with angles [lessthan or equal to] [alpha] and sides [greater than or equal to] h. Given [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (V, [theta]), a [less than or equal to] 0, the degree m Lagrange interpolant [u.sub.I,T] of u satisfies

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

with C(k, [alpha], m) independent of [xi], h, a, and u.

This lemma will be used for [xi] [right arrow] 0, while Proposition 5.2 will be used with a fixed [xi].

5.3. Approximation near the vertices. We are now ready to address approximation near the singular points. To this extent, we work with the smaller Finite Element Space S(T, m) defined for any mesh T of [omega] as

(5.3) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. This definition takes into account that the variational space associated to the mixed boundary value/interface problem (1.1) is [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] .

Remark 5.5. We recall that when the interface is not smooth or there are NeummanNeumann vertices, by Theorem 3.2 for any [absolute value of] [a.sub.q] < [[eta].sub.Q] the variational solution u of (1.1) can be written u = [u.sub.reg] + [w.sub.s] with [u.sub.reg] : [omega] [right arrow] R, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], and [w.sub.s] [member of] [W.sub.s]. The space [W.sub.s] is the linear span of functions Xi [member of] [C.sup.[infinity].sub.c]([V.sub.i]), one for each Neumann-Neumann or interface vertex [Q.sub.i], such that [X.sub.i] equals 1 on [V.sub.i] and satisfied [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. For each vertex Q, we therefore fix [a.sub.Q] [subset] (0, [[eta].sub.Q]), and we let [epsilon] = min{[a.sub.Q]}. With this choice, we have that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], so that the interpolants of u can be defined directly, since [W.sub.s] consists of smooth functions. Moreover, the condition that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] be integrable in a neighborhood of each vertex shows that [u.sub.reg] must vanish at each vertex. Therefore u(Q) = w(Q) for each Neumann-Neumann or interface vertex Q.

[FIGURE 5.1 OMITTED]

We now ready to introduce the mesh refinement procedure. For each vertex Q, we choose a number [k.sub.Q] [member of] (0,1/2] and set k = ([k.sub.Q]).

Definition 5.6. Let T be a triangulation of [omega] such that no two vertices of [omega] belong to the same triangle of T. The k refinement of T, denoted by k(T) is obtained by dividing each side AB ofT in two parts as follows. Ifneither A nor B is a vertex, then we divide AB into two equal parts. Otherwise, if A is a vertex, we divide AB into AC and CB such that [absolute value of] AC = [k.sub.Q] [absolute value of] AB.

This procedure will divide each triangle T into four triangles. (See Figure 5.1). Let us notice that the assumption that no two vertices of [omega] belong to the same triangle of the mesh is not really needed. Any reasonable division of an initial triangulation will achieve this condition. For instance, we suggest that if two vertices of i belong to the same triangle of the mesh, then the corresponding edge should be divided into equal parts or in a ratio given by the ratio of the corresponding k constants.

Definition 5.7. We define by induction [T.sub.n+1] = k([T.sub.n]), where the initial mesh [T.sub.0] is such that every vertex of [omega] is a vertex of a triangle in [T.sub.0] and all sides of the interface [GAMMA] coincide with sides in the mesh. In addition, we choose [T.sub.0] such that there is no triangle that contains more than one vertex and each edge in the mesh has length [greater than or equal to] [?????]/2 (with [??] chosen as in Section 5.2).

We observe that, near the vertices, this refinement coincides with the ones introduced in [3, 12, 17, 70] for the Dirichlet problem. One of the main results of this work is to show that the same type of mesh gives optimal rates of convergence for mixed boundary value and interface problems as well.

We denote by [u.sub.I,n] = [u.sub.I,T,n,m] [member of] [S.sub.n] := S([T.sub.n], m) the degree m Lagrange interpolant associated to u [member of] C([??]) and the mesh [T.sub.n] on [omega], and investigate the approximation properties afforded by the triangulation [T.sub.n] close to a fixed vertex Q. The most interesting cases are when Q is either a Neumann-Neumann vertex or a vertex of the interface. We shall therefore assume that this is the case in what follows. With abuse of notation we let a = [a.sub.Q] and k = [k.sub.Q] with [k.sub.Q [member of] (0,[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]). We also fix a triangle T [member of] [T.sub.0] that has Q as a vertex. Then Theorem 4.7 gives that the solution u of our interface problem decomposes as u = ureg + ws, with [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

We next let [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] = [K.sub.n]T [member of] [T.sub.n] be the triangle that is similar to T with ratio [K.sub.n], has Q as a vertex, and has all sides parallel to the sides of T. Then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for n [less than or equal to] 1 (with [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] = T). Furthermore, since k < 1/2 and the diameter of T is [greater than or equal to] [??]/2, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for all n [less than or equal to] 0. Recall that we assume all functions in [W.sub.s] are constant on neighborhoods of vertices. We continue to fix T [member of] [T.sub.0] with vertex Q. The following interpolation estimate holds.

Lemma 5.8. Let 0 < k = [k.sub.Q] < [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] and 0 < a = {a.sub.Q] < [[eta].sub.q]. Let us denote by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] the triangle with vertex Q obtained from T after N refinements. Let [u.sub.I,N] be the degree m Lagrange interpolant of u associated to [T.sub.N]. Then, if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where C depends on m and k, but not on N.

Proof. By hypothesis [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. To simplify the notation, we let [PHI] = [u.sub.reg]. By Remark 5.5, if N is large enough we can assume that w = u(Q) a constant on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. We again denote the dilated function [[PHI].sub.[lambda]](x, y) = [PHI]([LAMBDA]x, [LAMBDA]y), where (x, y) are coordinates at Q and 0 < [lambda] < 1. We choose [lambda] = [k.sup.N-1]. Then, [[PHI].sub.[lambda]](x, y) [member of] [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] by Lemma 5.3. We next introduce the auxiliary function v = x [PHI] x on [T.sub.K], where x : [T.sub.K] [right arrow] [0,1] is a smooth function that depends only on V and is equal to 0 in a neighborhood of Q, but is equal to 1 at all the nodal points different from Q. Consequently,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where C depends on m and the choice of the nodal points. Moreover, since </>(Q) = 0 by Remark 5.5, the interpolant of v if given by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. We also observe that the interpolant of w on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] is equal to w, because they are both constants, and hence [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Therefore

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

which gives the desired inequality. The second and the eighth relations above are due to Lemma 5.3, and the sixth is due to Proposition 5.2. ?

We now combine the bounds on [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] of the previous lemma with the bounds on sets of the form [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] of Lemma 5.4 to obtain the following estimate on an arbitrary, but fixed, triangle T [member of] [T.sub.0] that has a vertex Q in common with [omega] (the more difficult case not handled by Proposition 5.2).

Proposition 5.9. Let T [member of] [T.sub.0] such that a vertex Q of T belongs to V. Let 0 < kq [greater than or equal to] [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], 0 < [a.sub.Q] < [[eta].sub.Q. Then there exists a constant C > 0, such that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Proof. As before, we set [k.sub.Q = k and [a.sub.Q] = a. As in the proof of Lemma 5.8, we have [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. We may thus assume that u = [u.sub.reg]. The rest is as in [17, 18].

Remark 5.10. If T denotes the union of all the initial triangles that contain vertices of [omega], then T is a neighborhood of the set of vertices in [??]. Furthermore, the interpolation error on T is obtained as [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] by summing up the squares of the estimates in Proposition 5.9 over all the triangles, as long as [k.sub.Q] is chosen appropriately.

We now combine all previous results to obtain a global interpolation error estimate on i.

Theorem 5.11. Let m [less than or equal to] 1 and for each vertex Q [member of] V fix 0 < [a.sub.Q] < [[eta].sub.Q] and 0 < [k.sub.Q] < [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Assume that the conditions of Theorem 4.7 are satisfied and let u be the corresponding solution problem (2.13) with f : [omega] [right arrow] R such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] for all j. Let [T.sub.n] be the n-th refinement of an intial triangulation [T.sub.O] as in Definition 5.7 Let [S.sub.n] := [S.sub.n] ([T.sub.n, m) be the associated Finite Element space given in equation (5.3) and let [u.sub.n] = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] [member of] [S.sub.n] be the Finite Element solution defined in (5.1). Then there exists C > 0 such that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

Proof. Let [T.sub.i] be the union of initial triangles that contain a given vertex [Q.sub.i]. Recall from Theorem 4.7 that the solution of problem (2.13) can be written as u = [u.sub.reg] + w with w [member of] [W.sub.s] and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]. Because u - [u.sub.I] = [u.sub.reg] - [u.sub.reg,I] on [V.sub.i]we use the previous estimates to obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The first inequality is based on Cea's Lemma and the second inequality follows from Propositions 5.2 and 5.9.

We can finally state the main result of this section, namely the quasi-optimal convergence rate of the Finite Element solution computed using the meshes [T.sub.n].

Theorem 5.12. Under the notation and assumptions of Theorem 5.11, un = [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] [member of] [S.sub.n] := S([T.sub.n], m) satisfies

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for a constant C > 0 independent off and n.

Proof. Let again [T.sub.n] be the triangulation of [omega] after n refinements. Then, the number of triangles is O([4.sup.n]) given the refinement procedure of Definition 5.6. Therefore dim([S.sub.n]) [congruent to] [4.sup.n] so that Theorem 5.11 gives

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

The proof is complete.

Using that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] if [a.sub.Q] [member of] (0,1) for all vertices q, we obtain the following corollary.

Corollary 5.13. Let 0 < [a.sub.Q] [greater than or equal to] min{1,[[eta].sub.Q]} and 0 < kq < 2-j/oq for each vertex Q [member of] V. Then, under the hypotheses of Theorem 5.12,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

for a constant C > 0 independent off [member of] [H.sup.m-1] ([omega]) and n.

Note that we do not claim that u [member of] K [??] ([omega]) (which is in general not true).

6. Numerical tests. In this section, we present numerical examples which test for the quasi-optimal rates of convergence established a priori in the previous section. The convergence history of the Finite Element solution supports our results. Recall the Finite Element solution [u.sub.n] [member of] [S.sub.n] is defined by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

To verify the theoretical prediction, we focus on the more challenging problem where Neumann-Neumann vertices and interfaces are present. We start by testing different configurations of mixed Dirichlet/Neumann boundary conditions, but no interface, on several different domains for the simple model problem (6.1),

(6.1) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.].

In particular, we consider non-convex domains i with a crack. In this case, the optimal grading can be computed explicitly beforehand. We then perform a test for the model transmission problem

(6.2) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where a is a piece-wise constant function. We have run also a few tests with m = 2, which also seem to confirm our theoretical results. However, more refinement steps seem to be necessary in this case to achieve results that are as convincing as in the case m = 1. Thus more powerful (i. e., faster) algorithms and codes will need to be used to test the case m = 2 completely.

6.1. Domains with cracks and Neumann-Neumann vertices. We discuss the results of two tests for the mixed boundary value problem (6.1). In the first test, we impose pure Dirichlet boundary conditions, i. e., we take [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.], but on a domain with a crack. Specifically, we let [omega] = (0,1) x (0,1) \ {(x, 0.5), 0 < x < 0.5} with a crack at the point (0.5,0.5); see Figure 6.1. The presence of the crack forces a singularity for [H.sup.2] solutions at the tip of the crack. By the arguments in Section 4, any mesh grading 0 <a <[eta] = [pi]/2[pi] =1/2 should yield quasi-optimal rates of convergence as long as the decay ratio k of triangles in subsequent refinements satisfies k = [2.sup.-1/a] < [2.sup.-1/n] = 0.25 near the crack tip. In fact, in this case the solution is [H.sup.2] away from the crack, but is only in [H.sup.s], s < 1 + [eta] = 1-5, near the crack (following [46]). Recall that the mesh size h after j refinements is O([2.sup.j]). Thus, quasi-uniform meshes should give a convergence rate no better than [h.sup.0.5] [78].

[FIGURE 6.1 OMITTED]

[FIGURE 6.2 OMITTED]

In the second test, [omega] is the non-convex domain of Figure 6.2 with a reentrant vertex Q. The interior angle at Q is 1.65[pi]. We impose Neumann boundary conditions on both sides adjacent to the vertex Q, and Dirichlet boundary conditions on other edges. Again, an [H.sup.2] solution will have a singularity at the reentrant corner In this case, the arguments of Sections 4 and 5 imply that we can take 0 < a < [eta] = [pi]/1.65[pi] [approximately equal to] 0.61 for the mesh grading, and consequently, the quasi-optimal rates of convergence should be recovered as long as the decay ratio k of triangles in subsequent refinements satisfies k = [2.sup.-1/a] < [2.sup.-1/[eta] [approximately equal to] 0.32 near Q .

The convergence history for the FEM solutions in the two tests are given respectively in Table 6.1 and Table 6.2. Both tables confirm the predicted rates of convergence. The leftmost column in each table of this section contains the number of refinements from the initial triangulation of the domain. In each of the other columns, we list the convergence rate of the numerical solution for the problem (6.1) computed by the formula

(6.3) [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

where [u.sub.j] is the Finite Element solution after j mesh refinements. Therefore, since the dimension of the space [S.sub.n] grows by the factor of 4 with every refinement for linear finite element approximations, e should be very close to 1 if the numerical solutions yield quasi-optimal rates of convergence, an argument convincingly verified in the two tables. In Table 6.2, for example, we achieve quasi-optimal convergence rate whenever the decay ratio k < 0.32, since e [right arrow] 1 after a few refinements. On the other hand, if k > 0.32, the convergence rates decrease with successive refinements due to the effect of the singularity at Q. In fact, for k = 0.5 we expect the values of e to approach 0.61, which is the asymptotical convergence rate on quasi-uniform meshes for a function in [H.sup.1.61].

[FIGURE 6.3 OMITTED]

6.2. Domains with artificial vertices. We discuss again a test for the model mixed boundary value problem (6.1), but now we test convergence in the presence of an artificial vertex, where the boundary conditions change on a given side. We take the domain to be the unit square [OMEGA] = (0,1) x (0,1) and we impose the the mixed boundary conditions [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] = {(x, 0), 0 < x < 0.5}, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] = [omega] \ [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] (see Figure 6.4). In this case, the solution is [H.sup.2] near all geometric vertices, as the interior angle is [pi]/2, but it does possess a singularity at the artificial vertex Q = (0.5,0), where the boundary conditions change. Near such a vertex, the maximum mesh grading from Section 4 is [[eta].sub.Q] = 0.5[pi]/[pi] = 0.5. Then, quasi-optimal rates of convergence can be obtained on graded meshes if the decay ratio k of triangles in subsequent refinements satisfies 0 < k = [2.sup.-1/a] < [2.sup.-1/[eta] = 0.25 near the singular point (0. 5, 0). The optimal rate is again supported by the convergence history of the numerical solution in Table 6.3.

6.3. Transmission problems. We discuss finally a test for the model transmission problem (6.2), The singularities in the solution arise from jumps in the coefficient a across the interface. As discussed in Section 5, quasi-optimal rates of convergence can be achieved a priori by organizing triangles in the initial triangulation so that each side on the interface is a side of one the triangles as well. We verify a posteriori that this construction yields the predicted rates of convergence. We choose the domain again to be the square [omega] = ( - 1, 1) x ( - 1, 1) with a single, but nonsmooth, interface [GAMMA] as in Figure 6.5, which identifies two subdomains [[omega].sub.j], j = 1, 2. We also pick the coefficient a(x, y) in (6.2) of the form

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.]

[FIGURE 6.4 OMITTED]

The large jump across the interface makes the numerical analysis more challenging. The solution of (6.2) may have singularities in [H.sub.2] at the points [Q.sub.1] = (-1,1), [Q.sub.2] = (1,0) where the interface joins the boundary, and at [Q.sub.3] = (0,0), which is a vertex for the interface (there are no singularities again in H2 at the square geometric vertices).

Again based on the results of Sections 4 and 5, for each singular point [Q.sub.i], i = 1, 2,3, there exists a positive number vi, depending on the interior angle and the coefficients, such that, if the decay rate Ki of triangles in successive refinements satisfies 0 < [K.sub.i] < [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII.] near each vertex [Q.sub.1], quasi-optimal rate of convergence can be obtained for the finite element solution. We observe that the solution belongs to [H.sup.2] in the neighborhood of a vertex, whenever [[eta].sub.i] [less than or equal to] 1, and therefore, a quasi-uniform mesh near that vertex is sufficient in this case.

Instead of computing [[eta].sub.i] explicitly, as a formula is not readily available, we test different values of [K.sub.i] < 0.5 near each singular points until we obtain values of e approaching 1. This limit signals, as discussed above, that we have reached quasi-optimal rates of convergence for the numerical solution. The value of e is given in equation (6.3). Once again, the convergence history in Table 6.4 strongly supports the theoretical findings. In particular, no special mesh grading is needed near the points (-1,1) and (1,0). Near the internal vertex (0,0), however, we found the optimal grading ratio to be [k.sub.3] [member of] (0.3,0.4), in agreement with the results of

Theorem 4.7 and Theorem 5.12. Figure 6.5 shows the mesh refinement near (0,0) when k = 0. 2.

[FIGURE 6.5 OMITTED]

[FIGURE 6.6 OMITTED]

We notice that our tests involve values of k that are very small, yet the optimal convergence rate is preserved. We expect, however, that if k becomes even smaller, it may take longer to observe the optimal rate of convergence. On the other hand, the angle condition is not an issue, by the results of Babuska and Aziz, who have shown that the problem arises when some angles of the triangles become large [9]. In fact, in our refinement, the maximum size of the resulting angles does not increase with each refinement. This maximum size can also be chosen not to be too large in the initial triangulation, and hence in all triangulations. However, as k becomes smaller, our procedure leads to smaller and smaller angles, although the minimum size of these angles do not decrease with each refinement. Even the smallness of the angles can be dealt with by choosing a different method of dividing the triangles close to the singularities, leading to a slightly different graded mesh, as in [52]. The constant [k.sub.Q] associated to each singular point Q will be the same in the new family of graded meshes.

The methods used in this paper can be generalized to deal with polyhedral domains in three dimensions. See [19] and the references therein. However, the resulting algorithm is significantly more complicated and it leads to meshes that do not satisfy the minimum angle condition. On the other hand, for point singularities such as the ones arising in the study of Schrodinger operators, this procedure simplifies and is almost identical to the one in two dimensions presented here [15, 41].

6.4. Conclusion. It is well known that the singular solutions of elliptic equations in polyhedral domains can be conveniently studied using the weighted Sobolev spaces [K,sub.a.sup.m] However, the classical results on solvability (i.e., well-posedness) in weighted spaces [K,sub.a.sup.m] do not extend to the case of boundary-value problems where adjacent sides of a corner are endowed with Neumann boundary conditions, or to transmission problems. In this paper, we succeed to establish new a priori estimates (well-posedness, regularity and the Fredholm property) for the solution of the transmission problem (1.1) in augmented weighted Sobolev spaces (see Section 4) in the presence of non-smooth interfaces and Neumann-Neumann vertices. Using these theoretical results, we construct a class of graded meshes that recover the optimal rate of convergence of the Finite Element approximation. Our numerical tests for different problems give convincing evidence of the improvement in the convergence rate on these graded meshes. The use of augmented weighted Sobolev spaces in the analysis of other numerical methods for these transmission problems, for example in the study of the adaptive Finite Element Method, is a promising future direction of our research [59, 63].

Acknowledgements. We thank Constantin Bacuta, Bruce Kellogg, and Ludmil Zikatanov for useful discussions. We thank Anne-Margarette Sandig and Serge Nicaise for sending us their papers and for useful suggestions. We would like to also thank an anonymous referee for carefully reading our paper.

* Received November 20, 2008. Accepted for publication November 12, 2009. Published online March 15, 2010.

Recommended by T. Manteuffel. A.M. was partially supported by NSF Grant DMS 0708902. V.N. and H.L. were partially supported by NSF grant DMS-0555831, DMS-0713743, and OCI 0749202.

REFERENCES

[1] B. AMMANN AND V. NISTOR, Weighted sobolev spaces and regularity for polyhedral domains, CMAM, 196 (2007), pp. 3650-3659.

[2] T. APEL, Anisotropic finite elements: local estimates and applications, Advances in Numerical Mathematics, B. G. Teubner, Stuttgart, 1999.

[3] T. APEL, A. SANDIG, AND J. R. WHITEMAN, Graded mesh refinement and error estimates forfinite element solutions ofelliptic boundary value problems in non-smooth domains, Math. Methods Appl. Sci., 19 (1996), pp. 63-85.

[4] D. ARNOLD AND R. FALK, Well-posedness of the fundamental boundary value problems for constrained anisotropic elastic materials, Arch. Rational Mech. Anal., 98 (1987), pp. 143-165.

[5] D. ARNOLD, R. SCOTT, AND M. VOGELIUS, Regular inversion of the divergence operator with Dirichlet boundary conditions on a polygon, Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4), 15 (1988), pp. 169-192 (1989).

[6] A. K. AZIZ AND B. KELLOGG, On homeomorphisms for an elliptic equation in domains with corners,, Differential Integral Equations, 8 (1995), pp. 333-352.

[7] I. BABUSKA, Finite element method for domains with corners, Computing, 6 (1970), pp. 264-273.

[8] I. BABUSKA AND A. K. AZIZ, Survey Lectures on the Mathematical Foundations of the Finite Element Method, Proc. Sympos., Univ. Maryland, Baltimore, 1972.

[9] --, On the angle condition in the finite element method, SIAM J. Numer. Anal., 13 (1976), pp. 214-226.

[10] I. BABUSKA, U. BANERJEE, AND J. OSBORN, Survey of meshless and generalized finite element methods: a unified approach, Acta Numer., 12 (2003), pp. 1-125.

[11] I. BABUSKA AND B. Q. GUO, The h-p version of the finite element method for domains with curved boundaries, SIAM J. Numer. Anal., 25 (1988), pp. 837-861.

[12] I. BABUSKA, R. B. KELLOGG, AND J. PiTKARANTA, Direct and inverse error estimates for finite elements with mesh refinements, Numer. Math., 33 (1979), pp. 447-471.

[13] I. BABUSKA, T. VON PETERSDORFF, AND B. ANDERSSON, Numerical treatment ofvertex singularities and intensity factors for mixed boundary value problems for the Laplace equation in R3, SIAM J. Numer. Anal., 31 (1994), pp. 1265-1288.

[14] C. BACUTA, J. BRAMBLE, AND J. XU, Regularity estimates for elliptic boundary value problems in Besov spaces, Math. Comp., 72 (2003), pp. 1577-1595.

[15] C. BACUTA, H. Li, AND V. NISTOR, Analysis of Schrodinger operators with more singluarpotentials. work in progress, preliminary title.

[16] C. BACUTA, A. MAZZUCATO, V. NISTOR, AND L. ZIKATANOV, Interface and mixed boundary valueproblems on n-dimensional polyhedral domains. IMA preprint, 2009.

[17] C. BACUTA, V. NISTOR, AND L. ZIKATANOV, Improving the rate of convergence of 'high order finite elements 'on polygons and domains with cusps, Numer. Math., 100 (2005), pp. 165-184.

[18] --, Improving the rate of convergence of high-order finite elements on polyhedra. I. A priori estimates,,

Numer. Funct. Anal. Optim., 26 (2005), pp. 613-639.

[19] --, Improving the rate of convergence of high-order finite elements on polyhedra. II. Mesh refinements and interpolation, Numer. Funct. Anal. Optim., 28 (2007), pp. 775-824.

[20] U. BANERJEE AND J. OSBORN, Estimation of the effect of numerical integration in finite element eigenvalue approximation, Numer. Math., 56 (1990), pp. 735-762.

[21] M. BERNDT, T. A. MANTEUFFEL, AND S. MCCORMICK, Analysis offirst-order system least squares (FOSLS) for elliptic problems with discontinuous coefficients. II, SIAM J. Numer. Anal., 43 (2005), pp. 409-436.

[22] M. BERNDT, T. A. MANTEUFFEL, S. MCCORMICK, AND G. STARKE, Analysis of first-order system least squares (FOSLS) for elliptic problems with discontinuous coefficients. I, SIAM J. Numer. Anal., 43 (2005), pp. 386-408.

[23] P. BiNEV, W. DAHMEN, AND R. DEVORE, Adaptive finite element methods with convergence rates, Numer. Math., 97 (2004), pp. 219-268.

[24] J. BRANNICK, H. Li, AND L. ZIKATANOV, Uniform convergence of the multigrid V-cycle on graded meshes for corner singularities, Numer. Linear Algebra Appl., 15 (2008), pp. 291-306.

[25] S. C. BRENNER, Multigrid methods for the computation of singular solutions and stress intensity factors. I. Corner singularities, Math. Comp., 68 (1999), pp. 559-583.

[26] S. C. BRENNER, J. CUI, F. Li, AND L.-Y. SUNG, A nonconforming finite element method for a two dimensional curl-curl and grad-div problem, Numer. Math., 109 (2008), pp. 509-533.

[27] S. C. BRENNER AND R. SCOTT, The mathematical theory of finite element methods, vol. 15 of Texts in Applied Mathematics, Springer, New York, second ed., 2002.

[28] S. C. BRENNER AND L.-Y. SUNG, Multigrid methods for the computation of singular solutions and stress intensity factors. II. Crack singularities, BIT, 37 (1997), pp. 623-643.

[29] Z. CAI, T. A. MANTEUFFEL, S. F. MCCORMICK, AND J. RUGE, First-order system LL* (FOSLL*): scalar elliptic partial differential equations, SIAM J. Numer. Anal., 39 (2001), pp. 1418-1445.

[30] F. CAKONI, D COLTON, AND P. MONK, On the use oftransmission eigenvalues to estimate the index of refraction from far field data, Inverse Problems, 23 (2007), pp. 507-522.

[31] P. CiARLET, The Finite Element Method for Elliptic Problems, vol. 4 of Studies in Mathematics and Its Applications, North-Holland, Amsterdam, 1978.

[32] M. COSTABEL, Boundary integral operators on curved polygons, Ann. Mat. Pura Appl. (4), 133 (1983), pp. 305-326.

[33] M. COSTABEL AND M. DAUGE, Singularities of electromagnetic fields in polyhedral domains, Arch. Ration. Mech. Anal., 151 (2000), pp. 221-276.

[34] M. DAUGE, Elliptic Boundary Value Problems on Corner Domains, vol. 1341 of Lecture Notes in Mathematics, Springer, Berlin, 1988.

[35] C. DUARTE, O. HAMZEH, T. Liszka, AND W. TWORZYDLO, A generalized finite element method for the simulation of three dimensional dynamic crack propagation, Comput. Methods Appl. Mech. Engrg., 190 (2001), pp. 2227-2262.

[36] P. GRIS VARD, Elliptic problems in nonsmooth domains, vol. 24 of Monographs and Studies in Mathematics, Pitman, Boston, 1985.

[37] B. GUO AND I. BABUSKA, Regularity of the solutions for elliptic problems on nonsmooth domains in R3. I Countably normed spaces on polyhedral domains, Proc. Roy. Soc. Edinburgh Sect. A, 127 (1997), pp. 77-126.

[38] J. GuzmAn, Quadrature and Schatz's pointwise estimates for finite element methods, BIT, 45 (2005), pp. 695-707.

[39] W. HACKBUSCH, Multigrid methods and applications, vol. 4 of Springer Series in Computational Mathematics, Springer-Verlag, Berlin, 1985.

[40] G. HARUTYUN YAN AND B. -W. SCHULZE, Elliptic mixed, transmission and singular crack problems, vol. 4 of EMS Tracts in Mathematics, European Mathematical Society, Zurich, 2008.

[41] E. HUNSICKER, V. NISTOR, AND J. SOFO, Analysis of periodic Schrodinger operators: regularity and approximation of eigenfunctions, J. Math. Phys., 49 (2008), pp. 083501, 21.

[42] R. B. KELLOGG, Singularities in interfaceproblems, in Numerical Solution ofPartial Differential Equations, II (SYNSPADE 1970) (Proc. Sympos., Univ. of Maryland, College Park, Md., 1970), Academic Press, New York, 1971, pp. 351-400.

[43] --, Higher order singularities for interface problems, in The mathematical foundations of the finite element method with applications to partial differential equations (Proc. Sympos., Univ. Maryland, Baltimore, Md., 1972), Academic Press, New York, 1972, pp. 589-602.

[44] --, On the Poisson equation with intersecting interfaces, Applicable Anal., 4 (1974/75), pp. 101-129.

[45] R. B. KELLOGG AND J. E. OSBORN, A regularity result for the Stokes problem in a convex polygon, J. Functional Analysis, 21 (1976), pp. 397-431.

[46] V. A. KONDRAT'EV, Boundary value problems for elliptic equations in domains with conical or angular points, Transl. Moscow Math. Soc., 16 (1967), pp. 227-313.

[47] V. KOZLOV, V. Maz'ya, AND J. ROSSMANN, Spectral problems associated with corner singularities of solutions to elliptic equations, vol. 85 ofMathematical Surveys and Monographs, American Mathematical Society, Providence, RI, 2001.

[48] R. L AUTER AND V. NIS TO R, Analysis ofgeometric operators on open manifolds: a groupoid approach, in Quantization of Singular Symplectic Quotients, N. Landsman, M. Pflaum, and M. Schlichenmaier, eds., vol. 198 of Progress in Mathematics, Birkhauser, Basel - Boston - Berlin, 2001, pp. 181-229.

[49] E. LEE AND T. A. MANTEUFFEL, FOSLL* methodfor the eddy current problem with three-dimensional edge singularities, SIAM J. Numer. Anal., 45 (2007), pp. 787-809.

[50] E. LEE, T. A. MANTEUFFEL, AND C. WESTPHAL, Weighted-norm first-order system least squares (FOSLS) for problems with corner singularities, SIAM J. Numer. Anal., 44 (2006), pp. 1974-1996.

[51] R. LEVEQUE AND Z. Li, The immersed interface method for elliptic equations with discontinuous coefficients and singular sources, SIAM J. Numer. Anal., 31 (1994), pp. 1019-1044.

[52] H. LI, A. MAZZUCATO, AND V. NISTOR, Numerical methods for exceptional domains. in preparation.

[53] Y. Li AND L. NiRENBERG, Estimates for elliptic systems from composite material, Comm. Pure Appl. Math., 56 (2003), pp. 892-925.

[54] Y. Li AND M. VOGELIUS, Gradient estimates for solutions to divergence form elliptic equations with discontinuous coefficients, Arch. Ration. Mech. Anal., 153 (2000), pp. 91-151.

[55] Z. Li AND S. LUBKIN, Numerical analysis of interfacial two-dimensional Stokes flow with discontinuous viscosity and variable surface tension, Internat. J. Numer. Methods Fluids, 37 (2001), pp. 525-540.

[56] J. LUBUMA AND S. NICAISE, Dirichlet problems in polyhedral domains. II. Approximation by FEM and BEM, J. Comput. Appl. Math., 61 (1995), pp. 13-27.

[57] V. MAZ'YA AND J. ROSSMANN, Weighted Lp estimates of solutions to boundary value problems for second order elliptic systems in polyhedral domains, Z. Angew. Math. Mech., 83 (2003), pp. 435-467.

[58] A. MAZZUCATO AND V. NISTOR, Well posedness and regularity for the elasticity equation with mixed bound ary conditions on polyhedral domains and domains with cracks, Arch. Ration. Mech. Anal., 195 (2010), pp. 25-73.

[59] K. MEKCH AY AND R. NOCHETTO, Convergence of adaptive finite element methods for general second order linear elliptic PDEs, SIAM J. Numer. Anal., 43 (2005), pp. 1803-1827.

[60] R. MELROSE AND J. WUNSCH, Propagation of singularities for the wave equation on conic manifolds,, Invent. Math., 156 (2004), pp. 235-299.

[61] D. MITREA, M. MITREA, AND Q. SHI, Variable coefficient transmission problems and singular integral operators on non-smooth manifolds, J. Integral Equations Appl., 18 (2006), pp. 361-397.

[62] P. MONK, Finite element methods for Maxwell's equations, Numerical Mathematics and Scientific Computation, Oxford University Press, New York, 2003.

[63] P. MORIN, R. NOCHETTO, AND K. SiEBERT, Convergence of adaptive finite element methods, SIAM Rev., 44(2002), pp. 631-658.

[64] S. MOROIANU AND V. NISTOR, Index and homology ofpseudodifferential operators on manifolds with boundary. in Perspectives in operator algebras and mathematical physics, F. P. Boca, ed., Theta Ser. Adv. Math., Theta, Bucharest, 8, 2008, pp. 123-148.

[65] S. A. NAZAROV AND B. A. PLAMENEVSKY, Elliptic Problems in Domains with Piecewise Smooth Boundaries, vol. 13 of Expositions in Mathematics, de Gruyter, New York, 1994.

[66] S. NICAISE, Polygonal Interface Problems, Lang, Peter Publishing, 1993.

[67] S. NICAISE AND A. SANDIG, General interface problems. I, II, Math. Methods Appl. Sci., 17 (1994), pp. 395-429,431-450.

[68] C. PESKIN, Numerical analysis of blood flow in the heart, J. Comput. Phys., 25 (1977), pp. 220-252.

[69] M. PET ZOLD T, Regularity results for laplace interface problems in two dimensions, Z. Anal. Anwendungen, 20 (2001), pp. 431-455.

[70] G. RAUGEL, Resolution numerique par une methode d 'elements finis du probleme de Dirichlet pour le lapla cien dans un polygone, C. R. Acad. Sci. Paris Ser. A-B, 286 (1978), pp. A791-A794.

[71] J. ROITBERG AND Z. Seftel', On equations of elliptic type with discontinuous coefficients, Dokl. Akad. Nauk SSSR, 146 (1962), pp. 1275-1278.

[72] -, General boundary-value problems for elliptic equations with discontinuous coefficients, Dokl. Akad. Nauk SSSR, 148 (1963), pp. 1034-1037.

[73] W. RUDIN, Functional Analysis, International Series in Pure and Applied Mathematics, McGraw-Hill, New York, second ed., 1991.

[74] A. SCHATZ, I. SLOAN, AND L. WAHLBIN, Superconvergence in finite element methods and meshes that are locally symmetric with respect to a point, SIAM J. Numer. Anal., 33 (1996), pp. 505-521.

[75] M. SCHECHTER, A generalization of the problem of transmission, Ann. Scuola Norm. Sup. Pisa (3), 14 (1960), pp. 207-236.

[76] E. SCHROHE, Spectral invariance, ellipticity, and the Fredholm property for pseudo differential operators on weighted Sobolev spaces., Ann. Global Anal. Geom., 10 (1992), pp. 237-254.

[77] C. SCHWAB, p- and hp- Finite Element Methods: Theory and Applications in Solid and Fluid Mechanics, Oxford University Press, New-York, 1999.

[78] L. B. WAHLBIN, On the sharpness of certain local estimates for H1 projections into finite element spaces: influence of a re-entrant corner, Math. Comp., 42 (1984), pp. 1-8.

[79] L. YING, Two dimensional interface problems for elliptic equations, J. Partial Differential Equations, 16 (2003), pp. 37-48.

[80] S. YU, Y. ZHOU, AND G. WEI, Matched interface and boundary (MIB) method for elliptic problems with sharp-edged interfaces, J. Comput. Phys., 224 (2007), pp. 729-756.

HENGGUANG Li ([dagger]), ANNA MAZZUCATO ([double dagger]), AND VICTOR NISTOR ([double dagger])

([dagger]) Department of Mathematics, Syracuse University, Syracuse, NY 13244 (hli19@syr. edu)

([double dagger]) Department of Mathematics, The Pennsylvania State University, University Park, PA 16802 (mazzucat | nistor@math.psu.edu)
```TABLE 6.1
Convergence history for a crack domain.

j\K e : K = 0.1 e : K = 0.2 e : K = 0.3 e : K = 0.4

3 0.76 0.79 0.79 0.83
4 0.88 0.90 0.89 0.82
5 0.94 0.95 0.91 0.79
6 0.97 0.97 0.92 0.76
7 0.99 0.98 0.91 0.73
8 0.99 0.98 0.91 0.71
9 1.00 0.99 0.90 0.69

j\K e : k = 0.5

3 0.77
4 0.76
5 0.70
6 0.63
7 0.57
8 0.54
9 0.52

TABLE 6.2
Convergence history in the case of a Neumann-Neumann vertex.

j\K e : K = 0.1 e : K = 0.2 e : K = 0.4 e : K = 0.5

3 0.91 0.93 0.95 0.94
4 0.96 0.97 0.97 0.96
5 0.98 0.99 0.98 0.95
6 0.99 1.00 0.98 0.93
7 1.00 1.00 0.97 0.89
8 1.00 1.00 0.96 0.84

TABLE 6.3
Convergence history in the case of an artificial vertex.

j\K e : K = 0.1 e : K = 0.2 e : K = 0.3 e : K = 0.4

3 0.84 0.87 0.87 0.84
4 0.91 0.93 0.91 0.85
5 0.95 0.95 0.91 0.82
6 0.97 0.96 0.91 0.78
7 0.99 0.97 0.90 0.75
8 0.99 0.98 0.90 0.72
9 1.00 0.98 0.89 0.70

j\K e : K = 0.5

3 0.81
4 0.77
5 0.70
6 0.63
7 0.57
8 0.54
9 0.52

TABLE 6.4
Convergence history for the transmission problem.

j\K e : K = 0.1 e : K = 0.2 e : K = 0.3 e : K = 0.4

3 0.82 0.83 0.84 0.83
4 0.91 0.91 0.91 0.90
5 0.97 0.97 0.96 0.94
6 0.99 0.99 0.98 0.95
7 1.00 0.99 0.99 0.95
8 1.00 1.00 1.00 0.95

j\K e : K = 0.5

3 0.78
4 0.83
5 0.86
6 0.85
7 0.82
8 0.80
```
COPYRIGHT 2010 Institute of Computational Mathematics
No portion of this article can be reproduced without the express written permission from the copyright holder.