On the solution of Laplace's equation in the vicinity of triple-junctions
Jeremy Hoskins, Manas Rachh

TL;DR
This paper analyzes the behavior of solutions to Laplace boundary integral equations near triple junctions in composite media, providing a theoretical characterization and developing efficient numerical discretization methods.
Contribution
It characterizes solution behavior near triple junctions and introduces an efficient discretization approach for boundary integral equations in such regions.
Findings
Solutions near triple junctions are well-approximated by functions of the form t^β.
The powers β depend only on material properties and boundary angles.
The proposed discretization method demonstrates high accuracy and efficiency.
Abstract
In this paper we characterize the behavior of solutions to systems of boundary integral equations associated with Laplace transmission problems in composite media consisting of regions with polygonal boundaries. In particular we consider triple junctions, i.e. points at which three distinct media meet. We show that, under suitable conditions, solutions to the boundary integral equations in the vicinity of a triple junction are well-approximated by linear combinations of functions of the form where is the distance of the point from the junction and the powers depend only on the material properties of the media and the angles at which their boundaries meet. Moreover, we use this analysis to design efficient discretizations of boundary integral equations for Laplace transmission problems in regions with triple junctions and demonstrate the accuracy and efficiency of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On the solution of Laplace’s equation in the vicinity of
triple-junctions
Jeremy Hoskins
Applied Mathematics Program, Yale University, USA.
email: [email protected]
Manas Rachh Center for Computational Mathematics, Flatiron Institute, USA.
email: [email protected]
Abstract
In this paper we characterize the behavior of solutions to systems of boundary integral equations associated with Laplace transmission problems in composite media consisting of regions with polygonal boundaries. In particular we consider triple junctions, i.e. points at which three distinct media meet. We show that, under suitable conditions, solutions to the boundary integral equations in the vicinity of a triple junction are well-approximated by linear combinations of functions of the form where is the distance of the point from the junction and the powers depend only on the material properties of the media and the angles at which their boundaries meet. Moreover, we use this analysis to design efficient discretizations of boundary integral equations for Laplace transmission problems in regions with triple junctions and demonstrate the accuracy and efficiency of this algorithm with a number of examples.
1 Introduction
Composite media, i.e. media consisting of multiple materials in close proximity or contact, are both ubiquitous in nature and fascinating in applications since their macroscopic properties can be substantially different than those of their components. One property of particular interest is the electrostatic response of composite media, typically the electric potential in the medium which is produced by an externally-applied time-independent electric field. In such situations one often assumes that the associated electric potential satisfies Laplace’s equation in the interior of each medium and that along each edge where two media meet one prescribes the jump in the normal derivative of the potential. Typically the potentials in these jump relations appear multiplied by coefficients depending on the electric permittivity. This leads to a collection of coupled partial differential equations (PDEs). In addition to classical electrostatics problems, the same equations also arise in, among other things, percolation theory, homogenization theory, and the study field enhancements in vacuum insulators (see, for example, [1, 2, 3, 4, 5, 6, 7]).
Using classical potential theory this set of partial differential equations (PDEs) can be reduced to a system of second-kind boundary integral equations (BIEs). In particular, the solution to the PDE in each region is represented as a linear combination of a single-layer and a double-layer potential on the boundary of each subregion. If the edges of the media are smooth then the corresponding kernels in the integral equation are as well. Near corners, however, the solutions to both the differential equations and the integral equations can develop singularities.
Analytically, the behavior of solutions to both the PDEs and BIEs have been the subject of extensive analysis (see, for example [8, 9, 10, 11, 12, 13, 14, 15, 16, 17]). In particular, the existence and uniqueness of solutions in an -sense is well-known, under certain natural assumptions on the material properties [18, 19]. Moreover, the asymptotic form of the singularities in the vicinity of a junction has been determined for the solutions of both the PDE and its corresponding BIE [11, 12, 8, 20, 21].
Computationally the singular nature of the solutions poses significant challenges for many existing numerical methods for solving both the PDEs and BIEs. Typical approaches involve introducing many additional degrees of freedom near the junctions which can impede the speed of the solver and impose prohibitive limits on the size and complexity of geometries which can be considered. Recursive compressed inverse preconditioning (RCIP) is one way of circumventing the difficulty introduced by the presence of junctions in the BIE formulation [22]. In this approach, the extra degrees of freedom introduced by the refinement near the junctions are eliminated from the linear system. Moreover, the compression and refinement are performed concomitantly for multiple junctions in parallel. This approach gives an algorithm which scales linearly in the number of degrees of freedom added to resolve the singularities near the junction. The resulting linear system has essentially the same number of degrees of freedom as it would if the junctions were absent.
In this paper we restrict our attention to the case of triple junctions, extending the existing analysis by showing that under suitable restrictions the solution to the BIEs can be well-approximated in the vicinity of a triple junction by a linear combination of , where is the distance from the triple junction and the ’s are a countable collection of real numbers defined implicitly by an equation depending only on the angles at which the interfaces meet and the material properties of the corresponding media. This analysis enables the construction of an efficient computational algorithm for solving Laplace’s equation in regions with multiple junctions. In particular, using this representation we construct an accurate and efficient quadrature scheme for the BIE which requires no refinement near the junction. The properties of this discretization are illustrated with a number of numerical examples.
This paper is organized as follows. In section 2 we state the boundary value problem for the Laplace triple junction transmission problem, summarize relevant properties of layer potentials, and describe the reduction of the boundary value problem to a system of boundary integral equations. In section 3 we present the main theoretical results of this work, the proofs of which are given in appendices A and B. In section 4 we discuss two conjectures extending the results of section 3 based on extensive numerical evidence. In section 5, we describe a Nyström discretization which exploits explicit knowledge of the structure of solutions to the integral equations in the vicinity of triple junctions, and in section 6 we demonstrate its effectiveness of numerical solvers. Finally, in section 7 we summarize the results and outline directions for future research.
2 Boundary value problem
Consider a composite medium consisting of a set of polygonal domains (see Figure 1) with boundaries consisting of edges and vertices . For a given edge let denote its length, its normal, the polygons to the left and right, respectively, and be an arclength parameterization of . Finally we denote the union of the regions by and denote the complement of by
Given positive constants and we consider the following boundary value problem
[TABLE]
where and are analytic functions on , and denote the regions on the left and right with respect to the normal of edge .
Remark 2.1**.**
In this work we assume that all the normals to are positively oriented with respect to the parameterization of the edge . Specifically, if is a line segment between vertices , , and is a parameterization of , given by
[TABLE]
Then the normal on edge , is given by
[TABLE]
where for a point , .
Remark 2.2**.**
The existence and uniqueness of solutions to (1) is a classical result [19].
Remark 2.3**.**
In this paper we assume that no more than three edges meet at each vertex. Similar analysis holds for domains with higher-order junctions and will be published at a later date.
Remark 2.4**.**
Here we assume that , and are positive constants. In principle the analysis presented here extends to the case where the constants are negative or complex provided the the constants across each edge are outside the closure of the essential spectrum of the double layer potential defined on the boundary, and the underlying differential equation admits a unique solution. Note that for non-negative coefficients this is always true, since these constants are all in magnitude greater than , and the spectral radius of the double layer potential is bounded by .
2.1 Layer potentials
Before reducing the boundary value problem (1) to a boundary integral equation we first introduce the layer potential operators and summarize their relevant properties.
Definition 2.1**.**
Given a density defined on the single-layer potential is defined by
[TABLE]
and the double-layer potential is defined via the formula
[TABLE]
Remark 2.5**.**
In light of the previous definition, evidently the adjoint of the double-layer potential is given by the formula
[TABLE]
Definition 2.2**.**
For we define the kernel by
[TABLE]
The following theorems describe the limiting values of the single and double layer potential on the boundary .
Theorem 2.1**.**
Suppose that is a point in the interior of the segment . Suppose the point approaches a point along a path such that
[TABLE]
for some . If , we will refer to this limit as , and if , we will refer to this limit as .
Then
[TABLE]
where p.v. refers to the fact that the principal value of the integral should be taken.
Moreover, both the limits
[TABLE]
exist and are equal.
Remark 2.6**.**
In the following we will suppress the from expressions involving layer potentials evaluated at a point on the boundary. Unless otherwise stated, in such cases the principal value should always be taken.
2.2 Integral representation
In classical potential theory the boundary value problem (1) is reduced to a boundary integral equation for a new collection of unknowns , related to , in the following manner
[TABLE]
We note that by construction is harmonic in , . Enforcing the jump conditions across the edges and applying theorem 2.1 yields the following system of integral equations for the unknown densities and
[TABLE]
for
We note that the preceding representation has several advantages. Firstly, the kernels of integral equations (14) and (15) are smooth except at the vertices. In particular, the weakly-singular and hypersingular terms arising from the single-layer potential and the derivative of the double-layer potential, respectively, are absent. Secondly, the equations for the single-layer density and the double-layer density are completely decoupled and can be analyzed separately. Moreover, (15) is the adjoint of (14) and hence the structure of solutions to (15) can be inferred from the behavior of solutions to (14).
Remark 2.7**.**
The above representation also appears in [21] and is related to the work in [16]. It has been shown in [18] that the boundary integral equations (14),(15) are well-posed for .
2.3 The single-vertex problem
The following lemma reduces the problem of analyzing the behavior of the densities and in the vicinity of a triple junction with locally-analytic data to the analysis of an integral equation on a set of three intersecting line segments.
Lemma 2.1**.**
Let satisfy the boundary integral equation (14) and (15), respectively. Consider three edges and meeting at a vertex . If denotes the coordinates of the vertex then there exists an such that
[TABLE]
are analytic functions of for all . Here denotes the ball of radius centered at .
Remark 2.8**.**
We note that by choosing sufficiently small we can assume that the intersection of all three-edges with are of length . Moreover, since Laplace’s equation is invariant under scalings the subproblem associated with the corner can be mapped to an integral equation on three intersecting edges of unit length.
In light of the preceding remark, in the remainder of this paper we restrict our attention to the geometry shown in Figure 2.
The following notation will be used in our analysis of triple junctions.
Remark 2.9**.**
Suppose that and are two (possibly identical) edges of a triple junction in which all edges are of length one. For and in and let
[TABLE]
and
[TABLE]
for any Note that if then both quantities are identically zero for any and If then the principal value is not required.
Finally, in the following we will also denote the restrictions of and to an edge by and respectively.
3 Main results
In this section we state several theorems which characterize the behavior of the solutions to eqs. 14 and 15 for the single-vertex problem with piecewise smooth boundary data and Before doing so we first introduce some convenient notation. To that end, let and be three edges of unit length meeting at a vertex as in Figure 2. Let and be the angles at which they meet and suppose that are real numbers summing to . Let denote the region bordered by and the region bordered by and and denote the region bordered by and . Finally, let and be the parameters corresponding to and define the constants and by
[TABLE]
Remark 3.1**.**
We note the following properties of which, for notational convenience, we will denote by and respectively. Firstly, since are positive real numbers, it follows that . Secondly, a simple calculation shows that . Thus, at each triple junction, there are two parameters which encapsulate the relevant information regarding material properties at that junction. For the rest of the paper, in a slight abuse of notation, we will refer to as the material parameters.
Next we define several quantities which will be used in the statement of the main results. Let denote the set of indices and . Let , and denote the bounded operators in eq. 14 and eq. 15 respectively. For any operator , , and , we denote the restriction of to the edge by . For example, given , and ,
[TABLE]
where the operators are defined in eq. 17.
We are interested in the following two problems:
for what collection of are , and piecewise smooth functions on each of the edges , ; and 2. 2.
given , a polynomial of degree at most , construct an explicit basis for and .
In section 3.1, we address these questions for , while in section 3.2 we present analogous results for .
3.1 Analysis of
Suppose that , where denotes the distance along the edge from the triple junction, and and are constants.
In the following theorem, we derive necessary conditions on such that is a smooth function on each edge , .
Theorem 3.1**.**
Let denote the matrix given by
[TABLE]
Suppose that is a positive real number such that and that is a null-vector of . Let , . Then is an analytic function of , for , on each of the edges , .
The above theorem guarantees that for appropriately chosen densities , the potential is an analytic function on each of the edges.
We now consider the construction of a basis for , when , for some .
In order to prove this result, we require a collection of satisfying the conditions of theorem 3.1. The following lemma states the existence of a countable collection of which are analytic on a subset of .
Lemma 3.1**.**
Suppose that are irrational numbers summing to , and . Then there exists a countable collection of open subsets of denoted by as well as a corresponding set of functions , , such that for all . The corresponding null-vectors of are also analytic functions. Finally, for any , .
In the following theorem, we present the main result of this section which gives a basis for .
Theorem 3.2**.**
Consider the same geometry as in fig. 2, where , and sum to and and are irrational. Let , , be as defined in lemma 3.1, and for any positive integer , let denote the region of common analyticity of , i.e., . Finally, suppose that , are real constants, and define by
[TABLE]
1. Then there exists an open region with such that the following holds. For all , there exist constants , , , such that
[TABLE]
satisfies
[TABLE]
for , where is a constant.
3.2 Analysis of
Suppose that , where denotes the distance on the edge from the triple junction, and and are constants. In the following theorem, we discuss necessary conditions on guaranteeing that is a smooth function on each edge , .
Theorem 3.3**.**
Let denote the matrix given by
[TABLE]
Suppose that is a positive real number such that and let denote a corresponding null-vector of . Let , . Then is an analytic function of , for , on each of the edges , .
Before proceeding a few remarks are in order.
Remark 3.2**.**
We note that . Thus, the existence of , which satisfy the conditions of theorem 3.3 is guaranteed by lemma 3.1.
Remark 3.3**.**
For a given , if there exists a such that is piecewise smooth then there also exists a vector such that is also a smooth function. However, the requirement that implies that for , only ’s which satisfy are admissible.
For , note that for (see proof of lemma 3.1 contained in section A.1). These densities are essential for the proof of theorem 3.2, since these are the only basis functions for which the projection of their image under onto the constant functions are non-zero.
However, since , the densities are excluded from the representation for the solution to the equation . Note that, unlike , , , , have a non-zero projection onto the constants (see lemma B.2).
The following theorem is a converse of theorem 3.3 under suitable restrictions.
Theorem 3.4**.**
Consider the same geometry as in fig. 2, where , and are irrational numbers summing to Let , , be as defined in lemma 3.1. Let denote the open subset of on which and are analytic and For any positive integer , let denote the region of common analyticity of , i.e., . Finally, suppose that , are real constants, and define by
[TABLE]
1.
Then there exists an open region with such that the following holds. For all , there exist constants , , , such that
[TABLE]
satisfies
[TABLE]
for , where is a constant.
4 Conjectures
There are four independent parameters that completely describe the triple junction problem, any two out of the three angles and any two of the parameters Let , denote the subset of associated with the four free parameters that completely describe any triple junction given by
[TABLE]
When , are irrational multiples of , and are in the neighborhoods of , , and , the results theorems 3.2 and 3.4 construct an explicit basis of non-smooth functions for the solutions of , and , and show that this basis maps onto the space of boundary data given by piecewise polynomials on each of the edges meeting at the triple junction. However, extensive numerical studies suggest that both of these results can be improved significantly. In particular, we believe that this analysis extends to all , except for a set of measure zero. Moreover, on the measure zero set where this basis is not sufficient, we expect the solution to have additional logarithmic singularities; including functions of the form should be sufficient to fix the deficiency of the basis. We expect the analysis to be similar in spirit to the analysis carried out for the solution of Dirichlet and Neumann problems for Laplace’s equations on vicinity of corners (see [25, 26]).
In this section, we present a few open questions for further extending the results theorems 3.2 and 3.4, and present numerical evidence to support these conjectures.
4.1 Existence of
The solutions , , , are constructed as the implicit solutions of (recall that ). Note that where is as defined in eq. 52. From this, it follows that always satisfies for all , and that results in three linearly independent basis functions of the form since .
The remaining , , , are constructed in the following manner. simplifies significantly along , , and , and the existence of which satisfy is guaranteed based on the explicit construction detailed in [28]. The construction then uses the implicit function theorem to extend the existence of to a subset of . The implicit function theorem is a local result and only guarantees existence in local neighborhoods of the initial points. However, extensive numerical evidence suggests that the are well-defined and analytic for all and all . In fig. 3, we plot a few of these functions to illustrate this result.
Conjecture 4.1**.**
There exists a countable collection of , , which satisfy . Moreover, these are analytic functions of , and , for all .
An alternate strategy for proving this result is by making the following observation. For fixed , consider the curve defined by
[TABLE]
where is an integer. This defines a curve in for which for each . Then consider the family of hyperboloids parameterized by given by
[TABLE]
It follows immediately that the solutions to can be characterized geometrically as points in the intersection of the hyperboloid with the curve .
4.2 Completeness of the singular basis
Having identified the , and the corresponding null vectors for , and for , the second part of the proof shows that every set of boundary data which is a polynomial of degree less than or equal to on each of the edges, has a solution to the integral equations eqs. 14 and 15 in the basis for and for which agrees with the boundary data with error .
This part of the proof relies on constructing an explicit mapping from the coefficients of the density in the to the coefficients of Taylor expansions for Then, along , , or , based on the results in [28], we show that this mapping is invertible along these edges. It then follows from the continuity of determinants that the mapping is invertible for open neighborhoods of the line segments , , . This implies that in the basis there exists a such that , for all boundary data in the space of polynomials with degree less than or equal to .
While we prove this result for an open neighborhood of the line segments , , , when the angles are irrational multiples of , we expect the bases to have this property for all except for a measure zero set. Moreover, this measure zero set is the set of for which the multiplicity of as a repeated root of is not the same as the dimension of the null space of .
Conjecture 4.2**.**
Suppose that 4.1 holds, i.e. are analytic functions. Suppose further that , are real constants, and suppose that
[TABLE]
1. Then there exists a measure zero set such that for all the following result holds. There exist constants , , , such that
[TABLE]
satisfies
[TABLE]
for , where is a constant.
In fig. 3, we plot sections of the zero measure set on which 4.2 does not hold.
5 Discretization of eqs. 14 and 15
In this section we discuss a numerical method for solving eqs. 14 and 15 for the unknown densities which exploits the analysis of their behavior in the vicinity of triple junctions. There are two general approaches for discretizing these integral equations: Galerkin methods, in which the densities and is represented directly in terms of appropriate basis functions, and Nyström methods, where the solution is represented in terms of its values at specially chosen discretization nodes. In this paper, we use a Nyström discretization for solving eq. 14, though we note that the expansions in theorems 3.2 and 3.4 can also be used to construct efficient Galerkin discretizations.
In [23], the authors developed a Nyström discretization for resolving the singular behavior of solutions to integral equations in the vicinity of corners. In this approach, the authors obtain a basis of solutions to the integral equation in the vicinity of the corner by solving a small number of local problems. Based on these families of solutions, discretization nodes capable of interpolating the span of these solutions, coupled with quadratures for handling far-field interactions (inner products of the basis of solutions with smooth functions), and special quadratures for handling near interactions (for resolving the near singular behavior of the kernel in the vicinity of the corner) are developed. This approach was later specialized for the solution of Laplace’s equation on polygonal domains to obtain universal discretization nodes, and quadrature rules [24].
Recent advances in the analysis of integral equations for Laplace’s equation have provided analytic representations of solutions to integral equations in the vicinity of the corners [25, 26], obviating the need for obtaining the span of solutions in the vicinity of corners through numerical means. Based on the approach above, these analytical results have been exploited to construct universal discretization and quadratures for solutions in vicinity of corners [27]. We briefly discuss the construction of the Nyström discretization in [27] below. Let denote the family of functions
[TABLE]
Then there exist , , an orthogonal basis , , and a matrix whose condition number is , with the following features. For any , there exists , such that
[TABLE]
Let denote the samples of the function at the discretization nodes scaled by the square root of the quadrature weights. The matrix maps to its coefficients in the basis. Finally the weights are such that
[TABLE]
Specialized quadrature rules for handling the near-singular interaction between corner panels which meet at the same vertex are also constructed. The Dirichlet problem for Laplace’s equation can then be discretized using panels with scaled Gauss-Legendre nodes for panels which are away from corners, and using scaled nodes for panels at corners.
In the vicinity of triple junctions, the behavior of the solution of eq. 14 can be represented to high-order as a linear combination of functions in . Thus the discretization for the Dirichlet problem discussed above can be used to obtain a Nyström discretization for eq. 14. Unfortunately, the same is not true when solving eq. 15, since the singular behavior of is not contained in the span of . In particular, the leading order singularity in is of the form where . The nature of the singularity of is similar to the singular behavior of solutions to integral equations corresponding to the Neumann problem on polygonal domains.
Recall that eq. 15 is the adjoint of eq. 14. Thus, formally, one could use the transpose of the Nyström discretization of eq. 14 to solve eq. 15. Specifically, if are the unknown values of at the discretization nodes, and denote the samples of the boundary data for eq. 15 at the discretization nodes, then we solve the linear system
[TABLE]
where is the matrix corresponding to Nyström discretization of eq. 14. The solution is a high-order accurate weak solution for the density which can be used to evaluate the solution to eq. 15 accurately away from the corner panels of the boundary . This weak solution can be further refined to obtain accurate approximations of the potentials in the vicinity of corner panels through solving a sequence small linear systems for updating the solution in the vicinity of the corner panels. This procedure is discussed in detail in [32].
6 Numerical examples
We illustrate the performance of the algorithm with several numerical examples. In each of the problems let denote the exterior domain and denote the interior regions. Let , , denote points outside of the region for . The results in sections 6.2 and 6.3 have been computed using dense linear algebra routines, while the results in sections 6.1 and 6.4 have been computed using GMRES where the matrix vector product computation has been accelerated using fast multipole methods [33].
6.1 Accuracy
In order to demonstrate the accuracy of our method we solve the PDE with boundary data corresponding to known harmonic functions using our discretization of the integral equation formulation. We set and set for . We then compute the boundary data
[TABLE]
and solve for . Given the discrete solution for , we compare the computed solution and plot the error in the computed at targets in the interior of each of the regions. In figs. 4 and 5, we demonstrate the results for two sample geometries.
Remark 6.1**.**
Note that we do not use special quadratures for handling near boundary targets which is responsible for the loss of accuracy close to the boundary. For panels away from the corner, the potential at near boundary targets can be computed accurately using several standard methods such as Quadrature by expansion, or product quadrature (see [29, 30, 31]). In order to evaluate the solution at points lying close to a corner panel a different approach is required. A detailed description of a computationally efficient algorithm for evaluating the solution accurately arbitrarily close to a corner is presented in [32].
6.2 Condition number dependence on
In this section, we discuss the dependence of the condition number of the discretized linear systems as a function of the material parameters of the regions. Recall that the condition number of a linear system , which we denote by , is the ratio of the largest singular value to the the smallest singular value , i.e. . As discussed in section section 3, for fixed angles the integral equation and the analytical behavior of integral equations eqs. 14 and 15 are solely a function of defined in eq. 19. Furthermore, can be expressed in terms of which are contained in the interval . As before, let and . Since the discrete linear system corresponding to eq. 15, is the adjoint of the linear system corresponding to eq. 14, it suffices to study the condition number for either linear system.
In fig. 6, we plot the condition number of the discretization of eq. 14 as we vary , by holding the values of in each of the regions to be fixed. In particular, we set , , , and . , can then be defined in terms of as
[TABLE]
We note that the problem is well-behaved for almost all values of and becomes ill-conditioned as we approach the line and . This behavior is expected since the underlying physical problem also has rank-deficiency along these limits since these values of the parameters correspond to interior Neumann problems in regions and respectively.
6.3 Condition number dependence on angles at the triple junction
In this section we discuss the the dependence of the condition number of the discretized linear systems as a function of the angles at the triple junction. Let , denote the angles at the triple junction, then . The three angles at any triple junction can be parameterized by in the simplex . Suppose that we split this simplex into regions as shown in fig. 7. By symmetry it suffices to vary the angles .
The physical problem as either of the angles approach [math] or becomes increasingly ill-conditioned due to close-to-touching interactions on the entire edge (not just near the corner). In order to avoid these issues and to automate geometry generation as we vary the angles , we use two different types of geometries for regions I and IV which are shown in fig. 7.
Resolving the close-to-touching interactions has numerical consequences as well; due to the increased number of quadrature nodes required as the angles tend to [math] in the universal quadrature rules. In order for the universal quadrature rules to remain efficient, they are generated for the range . Regions with narrower angles should be handled on case to case basis and region with careful discretization of the boundary coupled with special purpose quadrature rules which account for the specific singular behavior of the solutions in the vicinity of triple junctions. In fig. 7, the top right missing corner corresponds to .
Referring to fig. 7, we observe that the condition number of the discrete linear systems varies mildly as we vary the angles , with a maximum condition number of . The discontinuity in the plot is explained by the different choice of geometries for regions I, IV.
6.4 Application - Polarization computation
In this section, we demonstrate the efficiency of our approach for computing polarization tensors for a perturbed hexagonal lattice with cavities. The polarization computation corresponds to the following particular setup of the triple junction problem, , , , where denotes the permittivity of the medium, and or , where , , and are the conductivities of the regions on either side of the edge . If is the solution corresponding to and is the solution corresponding to , then the polarization tensor is the matrix given by
[TABLE]
Note that in this particular setup, we only need to solve the problem corresponding to the operator , as the solution for is . Let denote the solutions of eq. 15 corresponding to boundary data and respectively. Using properties of the single layer potential, the integrals of the polarization tensor can be expressed in terms of as
[TABLE]
We compare the efficiency of our approach to RCIP which to the best of our knowledge is the state of the art method for such problems. The geometry is generated using a regular hexagonal lattice inside the unit square whose vertices are perturbed in a random direction by a tenth of the side length, and the permittivity is region is given by where is a uniform random number between . The choice of parameters for the problem setup is identical to the setup in section 11 in [34].
We discretize the geometry with panels on each edge of roughly equal size, and the reference solution is computed using panels on each edge. The geometry contains vertices, edges, and regions. There are degrees of freedom for the coarse discretization (approximately degrees of freedom per edge) and degrees of freedom for the reference solution. These discretizations required iterations for GMRES to converge to a relative residual of , and the absolute error in the polarization tensor when compared to the reference solution is . In comparison, RCIP using approximately degrees of freedom per edge in a hexagonal lattice with inclusions obtained an accuracy of in computing the entry of the polarization matrix and required GMRES iterations to converge.
The polarization tensor for this configuration, correct to 13 significant digits, is given by
[TABLE]
Remark 6.2**.**
We note that the performance of our approach is close to current state of the art methods such as RCIP [22]. In our examples, further improvements in speed can be achieved using additional compression techniques to reduce the degrees of freedom in the resulting linear system [35, 36].
7 Concluding remarks and future work
In this paper we analyze the systems of boundary integral equations which arise when solving the Laplace transmission problem in composite media consisting of regions with polygonal boundaries. Our discussion is focused on the particular case of composite media with triple junctions (points at which three distinct media meet) though our analysis extends to higher-order junctions in a natural way.
We show that under some restrictions the solutions to the boundary integral equations corresponding to a triple junction is well-approximated by a linear combination of powers where denotes the distance from the corner along the edge, and the is a countable collection of real numbers obtained by solving a certain equation depending only on the material properties of the media and the angles at which the interfaces meet.
In addition to the theoretical interest of the result, our analysis also enables an easy construction of near-optimal discretizations for triple junctions. In particular, RCIP which is the leading method for solving electrostatic problems on multiple junction interfaces, requires approximately discretization nodes per edge to compute solutions to near machine precision accuracy, where as our proposed discretization achieves an accuracy of using roughly discretization nodes per edge. Finally, we illustrate the properties of this discretization with a number of numerical examples.
The results of this paper admit a number of natural extensions and generalizations. Firstly, the analysis outlined in this paper extends almost immediately to junctions involving greater numbers of media. However, the construction of an efficient Nyström discretization of higher-order junctions requires special care since the solutions to corresponding integral equations are not functions on the boundary. (in fact the solutions are known to be functions on the boundary [21]). Secondly, with a small modification a similar analysis should be possible for boundary integral equations arising from triple junction problems for other partial differential equations such as the Helmholtz equation, Maxwell’s equations, and the biharmonic equation. This line of inquiry is being vigorously pursued and will be reported at a later date.
Finally, a similar approach will also work for generating discretizations of triple junctions in three dimensions. This is particularly valuable since geometric singularities in three-dimensions can often result in prohibitively large linear systems. Accurate discretization with few degrees of freedom would greatly improve the size and complexity of systems which could be simulated.
8 Acknowledgments
The authors would like to thank Alex Barnett, Charles Epstein, Leslie Greengard, Vladimir Rokhlin, and Kirill Serkh for many useful discussions.
Appendix A Analysis of
First we present the proof of theorem 3.1. In order to do so, we require the following technical lemma which describes the double layer potential defined on a straight line segment with density at an arbitrary point near the boundary. Here is the distance along the segment.
Lemma A.1**.**
Suppose that is an edge of unit length oriented along an angle , parameterized by , . Suppose that (see fig. 9) where , and . Suppose that for , where . If is not an integer, then
[TABLE]
If is an integer, then
[TABLE]
In the following lemma, we compute the potential , in the vicinity of triple junction with angles , material parameters , where and are constants (see fig. 2).
Lemma A.2**.**
Consider the geometry setup of the single vertex problem presented in section 3. For a constant vector , suppose that the density on the edges is of the form
[TABLE]
If is not an integer, then
[TABLE]
where is defined in eq. 21 and
[TABLE]
If is an integer, then
[TABLE]
where
[TABLE]
Proof.
The result follows from repeated application of lemma A.1 for computing . ∎
The proof of theorem 3.1 then follows immediately from lemma A.2.
We now turn our attention to the proof of lemma 3.1, which provides a construction of satisfying the conditions of theorem 3.1. In order to do that, we first observe that if one of , or is [math], then the expression of simplifies significantly, and there exists an explicit construction of satisfying . Recall that we use interchangeably use the following variables for the material properties . Having established the existence of analytic on a 1-D manifold which is a subset , we now analytically continue these values of to carve out the open region on which can be analytically extended. This proof is discussed in section A.1.
A.1 Existence of satisfying theorem 3.1
The determinant of the matrix is given by
[TABLE]
where , and
[TABLE]
Given the formula above, for all when is an integer, . When , the matrix has rank-2, since the matrix is similar to an anti-symmetric matrix and is not identically zero. The null vector of is given by , i.e., the pair always satisfies eq. 21. When , and hence for any , the pair satisfies eq. 21. Based on this observation we set
[TABLE]
We now turn our attention to constructing the remaining , the corresponding vectors , and their regions of analyticity , , . From eq. 51, the remaining values of as a function of the material parameters are defined implicitly via the roots of the equation , where and is defined in eq. 52.
It turns out that the implicit solutions of , are known when , , or . This gives us an initial value for defining in order to apply the implicit function theorem, and extend it to a region containing the segments , , or . Given this strategy, let be defined as follows (see fig. 10)
[TABLE]
In the following, we will consider only the segment ; and construct an open region which contains on which we define a family of functions , , which satisfy the conditions of lemma 3.1. Analogous results hold for the open sets containing the remaining segments with almost identical proofs. The region of analyticity for is then given by .
Definition A.1**.**
For and let be the solution to the equation
[TABLE]
such that
[TABLE]
Similarly, for let be the solution to the equation
[TABLE]
such that
[TABLE]
The existence of for and satisfying these conditions is guaranteed by the following lemma A.3, proved in [28].
Lemma A.3**.**
Suppose that , and and is irrational. Consider the equations
[TABLE]
Then there exist an countable collection of functions such that
* for all and * 2. 2.
the functions are analytic in , 3. 3.
** 4. 4.
* and for all *
The following lemma extends the domain of definition of the functions , , to some open subset containing .
Lemma A.4**.**
Suppose and are positive numbers summing to , and , , and are irrational numbers. Suppose that are defined as above for and . For , the function satisfies
[TABLE]
Moreover, there exists a unique extension of to an analytic function of on an open neighborhood which satisfies
[TABLE]
Proof.
We begin by observing that for satisfies
[TABLE]
[TABLE]
Upon multiplication by
[TABLE]
and using eq. 66 we get
[TABLE]
which does not vanish for all . Thus by the implicit function theorem, there exists an analytic extension of to a neighborhood which satisfies . ∎
The following theorem establishes the analyticity of the null vectors of in a neighborhood of when
Theorem A.1**.**
For each , and , the matrix defined in eq. 21 has a null-vector whose entries are analytic functions of on .
Proof.
Since is such that the matrix is singular, it has a null vector . Moreover, as long as and is not an integer, the matrix has rank at least . Thus [math] is an eigenvalue of with multiplicity for all . Since the entries of the matrix are analytic functions of , we conclude that the entries of are analytic on . ∎
Finally, each is an open subset containing the segments , . Then is an open subset of containing . Thus, for any finite , .
A.2 Completeness of density basis
Recall that for any which satisfy the conditions of theorem 3.1, and , the potential corresponding to any of these densities is an analytic function. In order to show that, the potential corresponding to a particular collection of span all polynomials of a fixed degree on all the three edges meeting at the triple junction, we explicitly write down the linear map from the coefficients of the density in the basis to the coefficients of Taylor series of the potentials on each of the edges using lemma A.2. We then observe that this mapping is invertible along the line segments corresponding to , , or , and since the mapping is an analytic function of the parameters , it must also be invertible in an open region containing the segments , or . This part of the proof is discussed in section A.2.
For any integer , let , denote the common region of analyticity of , , , i.e. , where . By construction, for all . We now prove the result theorem 3.2 in one of the components of , say . The proof for the other components follows in a similar manner.
Let , and suppose that
[TABLE]
Then, using lemma A.2, since are such that , the potential corresponding to this density on the boundary is given by
[TABLE]
where are the matrices given by
[TABLE]
Let denote the matrix whose blocks are given by , .
Recall that on , , , , satisfies , satisfies , , and the corresponding vectors , , , are given by
[TABLE]
where
[TABLE]
Furthermore, the matrices and defined in eq. 48, and eq. 50 respectively, also simplify to
[TABLE]
and
[TABLE]
Let denote the coefficient of in the Taylor expansions of respectively. Let denote the permutation matrix whose action is given by
[TABLE]
Then along , the matrix is demonstrated in fig. 11.
The matrices are diagonal and are given by
[TABLE]
The matrices are Cauchy matrices whose entries are given by
[TABLE]
Since we have assumed , to be irrational, we note that and that for all . Thus, the diagonal matrices are invertible. Furthermore on , neither of or , take on integer values lemma A.3. Thus, the Cauchy matrices are invertible.
Let denote the bottom-right block. Then from the structure of and the fact that the diagonal matrix is invertible, it is clear that is invertible if and only if is invertible.
Remark A.1**.**
The matrix is the mapping from the coefficients of the singular basis of solutions for the transmission problem with angle and material parameter to the corresponding coefficients of the Taylor expansion of the potential on the edges . The invertibility of follows from the analysis in [28]. We present the proof here in terms of the notation used in this paper.
Upon applying an appropriate permutation matrix to from the right and the left, we note that
[TABLE]
The matrix is invertible if and only if it’s bottom right corner is invertible. Let denote the identity matrix, then the bottom right corner of factorizes as as
[TABLE]
which is clearly invertible since the matrices are invertible.
Finally, using all of these results, it follows that the matrix is invertible for all . Since all of the quantities involved are analytic, on every compact subset of , we conclude that the matrix is invertible in an open neighborhood . By construction .
Appendix B Analysis of
All the proofs for the analysis of are similar to the corresponding proofs of . We only present the analogs of lemmas A.1 and A.2.
In the following lemma we present the directional derivative of a single layer potential defined on straight line segment with density at an arbitrary point near the boundary. Here is the distance along the segment, at an arbitrary point near the boundary.
Lemma B.1**.**
Suppose that is an edge of unit length oriented along an angle , parameterized by , . Suppose that and (see fig. 9) where , and . Suppose that for , where . If is not an integer, then
[TABLE]
If is an integer, then
[TABLE]
In the following lemma, we compute the potential at a triple junction with angles , and material parameters (see fig. 2).
Lemma B.2**.**
Consider the geometry setup of the single vertex problem presented in section 3. For a constant vector , suppose that the density on the edges is of the form
[TABLE]
If is not an integer, then
[TABLE]
where is defined in eq. 25, and is defined in eq. 48. If is an integer, then
[TABLE]
where is defined in eq. 50.
Proof.
The result follows from repeated application of lemma B.1 for computing . ∎
The proof of theorem 3.3 then follows immediately from lemma B.2.
In the following lemma, we prove that , , , defined in section A.1 satisfy for all in an open subset .
Lemma B.3**.**
Suppose that , , , are as defined in section A.1. Then there exists an open subset , such that for all . Moreover for any , .
Proof.
Since , the statement is trivially true with . Since on , or , for appropriate parameters , we conclude that , on , or , for , . Since are analytic on , there exists an open subset containing the segments , or , which we denote by , such that for all . Since each is an open subset of , containing , we conclude that .
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. J. Lee, “Pseudo-random-number generators and the square site percolation threshold,” Physical Review E , vol. 78, no. 3, p. 031131, 2008.
- 2[2] D. Fredkin and I. Mayergoyz, “Resonant behavior of dielectric objects (electrostatic resonances),” Physical Review Letters , vol. 91, no. 25, p. 253902, 2003.
- 3[3] G. W. Milton, “The theory of composites,” The Theory of Composites, by Graeme W. Milton, pp. 748. ISBN 0521781256. Cambridge, UK: Cambridge University Press, May 2002. , p. 748, 2002.
- 4[4] L. Tully, A. White, D. Goerz, J. Javedani, and T. Houck, “Electrostatic modeling of vacuum insulator triple junctions,” in 2007 16th IEEE International Pulsed Power Conference , vol. 2, pp. 1195–1200, IEEE, 2007.
- 5[5] E. Tuncer, Y. V. Serdyuk, and S. M. Gubanski, “Dielectric mixtures: electrical properties and modeling,” IEEE Transactions on Dielectrics and Electrical Insulation , vol. 9, no. 5, pp. 809–828, 2002.
- 6[6] L. G. Fel, V. S. Machavariani, and D. J. Bergman, “Isotropic conductivity of two-dimensional three-component symmetric composites,” Journal of Physics A: Mathematical and General , vol. 33, no. 38, p. 6669, 2000.
- 7[7] Y. N. Ovchinnikov, “Conductivity of a periodic two-component system of rhombic type,” Journal of Experimental and Theoretical Physics , vol. 98, no. 1, pp. 162–169, 2004.
- 8[8] R. Craster and Y. V. Obnosov, “A three-phase tessellation: solution and effective properties,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences , vol. 460, no. 2044, pp. 1017–1037, 2004.
