τ1 τ3
τ2
x3
x4 x2
x1 x5
Figure 4.3: Connectivity table.
We use the connectivity table (see Figure 4.3) to determine the mapping between global and local indices of nodes building the triangular mesh. For example, the point x4 is the second vertex of the triangleτ2, i.e., x4=x22. Furthermore, forϕ4|τ2 we have
ϕ4|τ2(x) =ϕ4|τ2(R4(ξ)) = ˆϕ2(ξ) =ξ1 for x∈τ2,ξ∈ˆτ .
As in the case of piecewise constant basis functions we can identify a function Tϕ(∂Ω)∋gϕ=
N
k=1
gkϕk
with a vector [g1, . . . , gN]T ∈ CN. For the approximation of a smooth enough functiong we can either use an interpolation, i.e.,
gk=g(xk).
For a function g ∈L2(∂Ω) it is more appropriate to define the projection Pϕ: L2(∂Ω)→ Tϕ(∂Ω) as
Pϕg:= arg min
gϕ∈Tϕ(∂Ω)
∥g−gϕ∥L2(∂Ω).
The coefficients for real-valued functions can be found in the same way as for the piecewise constant functions as the solution to the system of linear equations
N
k=1
gk⟨ϕk, ϕj⟩L2(∂Ω)=⟨g, ϕj⟩L2(∂Ω) for j∈ {1, . . . , N}.
In the case of complex-valued functions we can separately search for the real parts and the imaginary parts of the coefficients.
The space Tϕ(∂Ω) will be used for the approximation of the Dirichlet data, i.e., the values of the solution on∂Ω.
4.3 Discretized Boundary Integral Equations
In the following sections we describe the discretization of the boundary integral equations derived in Section 3.5. Although the collocation method will be mentioned, we will prefer
54 4 Discretization and Numerical Realization
the well studied Galerkin scheme based on the corresponding variational formulations. To approximate the Dirichlet and Neumann boundary data we use continuous piecewise affine functions and piecewise constant functions, respectively.
4.3.1 Interior Dirichlet Boundary Value Problem
The solution to the interior Dirichlet boundary value problem (3.24) is given by the rep-resentation formula (3.25) with unknown Neumann data gN := γ1,intu. To compute the missing values we use the Fredholm integral equation of the first kind
(VκgN)(x) = 1
2gD(x) + (KκgD)(x) forx∈∂Ω or equivalently
∂Ω
gN(y)vκ(x,y) dsy= 1
2gD(x) +
∂Ω
gD(y)∂vκ
∂ny
(x,y) dsy forx∈∂Ω (4.3) with the fundamental solution vκ and the normal derivative
∂vκ
∂ny(x,y) = 1 4π
eiκ∥x−y∥
∥x−y∥3(1−iκ∥x−y∥)⟨x−y,n(y)⟩.
The corresponding variational formulation reads
⟨VκgN, s⟩∂Ω =
1
2I+Kκ
gD, s
∂Ω
for all s∈H−1/2(∂Ω) or
∂Ω
s(x)
∂Ω
gN(y)vκ(x,y) dsydsx
= 1 2
∂Ω
s(x)gD(x) dsx+
∂Ω
s(x)
∂Ω
gD(y)∂vκ
∂ny(x,y) dsydsx. We seek the solution in the approximate form
gN≈gN,h :=
E
ℓ=1
gℓNψℓ∈Tψ(∂Ω) (4.4)
which can be identified with a vectorgN∈CE. Furthermore, we use theL2 projection to approximate the given Dirichlet data
gD≈gD,h:=
N
j=1
gjDϕj ∈Tϕ(∂Ω), (4.5)
which corresponds to a vector gD ∈ CN. The solution gN,h is given by the Galerkin For the left-hand side of (4.6) we obtain
E The right-hand side of (4.6) yields
N
56 4 Discretization and Numerical Realization
The Galerkin equations (4.6) can thus be rewritten into the system of linear equations Vκ,hgN=
1
2Mh+Kκ,h
gD.
The approximate solution to (3.24) can be obtained using the discretized representation formula
u(x)≈uh(x) :=
E
ℓ=1
gℓN
τℓ
vκ(x,y) dsy−
N
j=1
gDj
∂Ω
ϕj(y)∂vκ
∂ny(x,y) dsy. (4.11) Another approach to the discretization of the boundary integral equations is the col-location method. Because the relation (4.3) is valid for all x ∈ ∂Ω, we can insert the midpointsxk∗ into (4.3) to obtain the system of linear equations
Vκ,hgN=
1
2Mh+Kκ,h
gD
with
CE×E ∋Vκ,h[k, ℓ] := 1 4π
τℓ
eiκ∥xk∗−y∥
∥xk∗−y∥dsy, RE×N ∋Mh[k, j] :=ϕj(xk∗),
CE×N ∋Kκ,h[k, j] :=
∂Ω
ϕj(y) 1 4π
eiκ∥xk∗−y∥
∥xk∗−y∥3(1−iκ∥xk∗−y∥)⟨xk∗−y,n(y)⟩dsy. Contrary to the Galerkin scheme, the system matrix Vκ,h arising from the collocation method is in general non-symmetric and the stability of the method is still an open problem.
Although the collocation scheme can be derived for other boundary integral equations in the same way, in the following sections we prefer the Galerkin discretization.
4.3.2 Interior Neumann Boundary Value Problem
The solution to the interior Neumann boundary value problem (3.32) is given by the representation formula (3.33) or by its discretized version (4.11). To compute the missing Dirichlet datagD:=γ0,intu we use the hypersingular equation
(DκgD)(x) = 1
2gN(x)−(Kκ∗gN)(x) forx∈∂Ω or
−γ1,int
∂Ω
gD(y)∂vκ
∂ny
(x,y) dsy = 1
2gN(x)−
∂Ω
gN(y)∂vκ
∂nx
(x,y) dsy for x∈∂Ω
with
The corresponding variational problem reads
⟨DκgD, t⟩∂Ω = Inserting the approximations of the Cauchy data (4.4), (4.5) into (4.12) we obtain the Galerkin equations Using Theorem 3.14, the left-hand side of (4.13) yields
N
For the right-hand side of (4.13) we obtain
E
58 4 Discretization and Numerical Realization
ΓD
ΓN
ED (Dirichlet elements) EN (Neumann elements) ND (Dirichlet nodes) NN(Neumann nodes)
Figure 4.4: Triangulation of∂Ω for the mixed boundary value problem.
with matricesMh andKκ,hdefined by (4.8) and (4.9), respectively. The Galerkin equations (4.13) can now be represented as
Dκ,hgD=
1
2MTh −KTκ,h
gN.
Note that in the system of linear equations above the transpositions are not conjugate transpositions and only involve reordering of the original matrices.
4.3.3 Interior Mixed Boundary Value Problem
For the solution to the interior mixed boundary value problem (3.37) we consider the symmetric approach given by the variational formulation
a(s, t, q, r) =F(q, r) for all q∈H−1/2(ΓD), r ∈H1/2(ΓN) (4.15) with unknown functions s∈H−1/2(ΓD),t∈H1/2(ΓN), the bilinear form
a(s, t, q, r) :=⟨Vκs, q⟩ΓD − ⟨Kκt, q⟩ΓD+⟨Kκ∗s, r⟩ΓN+⟨Dκt, r⟩ΓN, the right-hand side
F(q, r) :=
1
2I+Kκ
˜ gD, q
ΓD
− ⟨Vκ˜gN, q⟩ΓD+
1
2I−Kκ∗
˜ gN, r
ΓN
− ⟨Dκ˜gD, r⟩ΓN and some fixed prolongations of the Cauchy datag˜D,g˜N.
Before we proceed, we divide the boundary elements into two groups, ED denoting the set of all elements with the Dirichlet boundary condition and EN denoting the set of Neumann elements. Similarly, we divide the set of boundary nodes into sets ND and NN
(see Figure 4.4). Note that in the following text we also use the symbols ED,EN,ND and NN to denote the cardinality of the corresponding sets.
Note that for smooth enough functions t, swe have t|ΓD = 0 and s|ΓN = 0. Thus, we seek the unknown functions in the approximate forms
t≈th :=
i∈NN
tiϕi ∈Tϕ(ΓN), s≈sh :=
j∈ED
sjψj ∈Tψ(ΓD) (4.16)
represented by vectors t ∈ CNN and s ∈ CED, respectively. Moreover, we define the
N = 0 with ΓN− denoting the Neumann part of the boundary without elements adjacent to ΓD and g˜N,h|ΓD = 0. Inserting the approximate representations (4.16), (4.17) into the variational formulation (4.15) we obtain the system of Galerkin equations
a(sh, th, ψk, ϕℓ) =F(ψk, ϕℓ) for allk∈ED, ℓ∈NN. (4.18) For the left-hand side of (4.18) we obtain
⟨Vκs, ψk⟩ΓD =
Note that the matrices from the previous formulae are submatrices of (4.7), (4.9) and (4.14) with dimensions
Vκ,h ∈CED×ED, Kκ,h ∈CED×NN, Dκ,h∈CNN×NN. For the right-hand side of (4.18) we have
⟨˜gD, ψk⟩ΓD =
60 4 Discretization and Numerical Realization
with ΓD+ denoting the Dirichlet part of the boundary together with Neumann elements adjacent to ΓD. Again, the matrices from the above relations are submatrices of (4.8), (4.9), (4.7) and (4.14) with dimensions
M¯h ∈RED×ND, K¯κ,h∈CED×ND, V¯κ,h∈CED×EN,
¯¯
Mh ∈REN×NN, K¯¯κ,h∈CEN×NN, D¯κ,h ∈CNN×ND. The system of Galerkin equations can now be rewritten as
Note that similarly as for the interior Neumann problem the transpositions do not involve the complex conjugation.
4.3.4 Exterior Dirichlet Boundary Value Problem
In the following three sections we describe the solution to exterior boundary value problems.
Since the discretization techniques are identical to those mentioned above, the discussion will be more succinct.
The approximate solution to the exterior Dirichlet boundary value problem (3.43) is given by the discretized representation formula (3.44), i.e.,
u(x)≈uh(x) :=− with unknown Neumann data gN,h. To obtain the missing data we use the variational formulation corresponding to the Fredholm integral equation (3.45), i.e.,
⟨VκgN, s⟩∂Ω = Inserting the approximations of the Cauchy data (4.4), (4.5) into (4.20) we obtain the system of Galerkin equations
E
and the related system of linear equations Vκ,hgN=
with the matrices given by (4.7), (4.8) and (4.9).
4.3.5 Exterior Neumann Boundary Value Problem
The solution to the exterior Neumann boundary value problem (3.48) is given by the representation formula (3.49) and its discretized variant (4.19). To compute the missing Dirichlet data we use the hypersingular boundary integral equation (3.51) and the related variational problem Substituting the approximate boundary data gD,h,gN,hinto (4.21) we obtain the Galerkin equations
62 4 Discretization and Numerical Realization
and the system of linear equations Dκ,hgD=
−1
2MTh −KTκ,h
gN,
given by the matrices (4.14), (4.8) and (4.9). Again, the transpositions do not involve the complex conjugation.
4.3.6 Exterior Mixed Boundary Value Problem
Lastly, let us consider the exterior mixed boundary value problem (3.53). Similarly as in the case of the interior mixed problem we use the symmetric approach given by the variational formulation
a(s, t, q, r) =F(q, r) for all q∈H−1/2(ΓD), r ∈H1/2(ΓN) (4.22) with unknown functions s∈H−1/2(ΓD),t∈H1/2(ΓN), the bilinear form
a(s, t, q, r) :=⟨Vκs, q⟩ΓD− ⟨Kκt, q⟩ΓD+⟨Kκ∗s, r⟩ΓN+⟨Dκt, r⟩ΓN the right-hand side
F(q, r) :=
−1
2I+Kκ
˜ gD, q
ΓD
− ⟨Vκ˜gN, q⟩ΓD+
−1
2I−Kκ∗
˜ gN, r
ΓN
− ⟨Dκ˜gD, r⟩ΓN and some fixed prolongations of the Cauchy data˜gD,g˜N. Inserting the discretized functions sh, thfrom (4.16) and the prolongationsg˜D,g˜Nfrom (4.17) into (4.22) we obtain the system of Galerkin equations
a(sh, th, ψk, ϕℓ) =F(ψk, ϕℓ) for all k∈ED, ℓ∈NN and the related system of linear equations
Vκ,h −Kκ,h KTκ,h Dκ,h
s t
=
−V¯κ,h −12M¯h+ ¯Kκ,h
−12M¯¯Th −K¯¯Tκ,h −D¯κ,h
gN gD
with the matrices defined in Section 4.3.3. The transpositions in the above given system do not involve the complex conjugation of the elements.