# Shape Reconstruction for Unsteady Advection-Diffusion Problems by Domain Derivative Method

Authors: Wenjing Yan; Jian Su; Feifei Jing
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

This paper is concerned with the numerical simulation for shape reconstruction of the unsteady advection-diffusion problems. The continuous dependence of the solution on variations of the boundary is established, and the explicit representation of domain derivative of corresponding equations is derived.
This allows the investigation of iterative method for the ill-posed problem. By the parametric method, a regularized Gauss-Newton scheme is employed to the
shape inverse problem. Numerical examples indicate that the proposed algorithm is feasible and effective for the practical purpose.


---

## Body

## 1. Introduction

The advection-diffusion problem is important to many branches of science and engineering. Many physical and chemical phenomena, such as the diffusion of polluted substances in water and air, the diffusion of heat and salinity in the ocean, and even economics and financial forecasting, can be described as advection-diffusion problems.For the shape reconstruction problems by the domain derivative method, many people are contributed to it. Hettlich solved the inverse obstacle scattering problem for sound soft and sound hard obstacles [1, 2] and discussed a discontinuity in a conductivity from a single boundary measurement [3]. Kress and Rundell considered an inverse conduction scattering problem for shape and impedance in [4]. Chapko et al. dealt with the inverse boundary problem for the time-dependent heat equation only in the case of perfectly conducting and insulating inclusions [5, 6]. Harbrecht and Tausch considered the numerical solution of a shape identification problem for the heat equation [7, 8]. Yan and Ma discussed a shape reconstruction problem for heat conduction with mixed condition [9] and recovered the shape of a solid immersed in the incompressible fluid driven by the Stokes flow [10].This paper is organized into four parts. In Section2, we briefly introduce the shape reconstruction problem of the two-dimensional advection-diffusion equations for the transport of a contaminant in the surface water. In Section 3, we describe the domain perturbation method which is used for the characterization of the deformation of the shapes and derive the explicit representation of the derivative of solution with respect to the boundary, that is, the so-called “domain derivative.” This representation is important, because it is the key to deriving many properties of the domain derivative method for numerical analysis. Section 4 is devoted to the regularized Gauss-Newton scheme applied to the numerical shape inverse problem. The performance of the numerical method is discussed and illustrated by numerical examples.


## 2. Shape Reconstruction Problem

In this paper, we pay our attention on reconstructing the shape of a bounded and smooth domain from observed information. LetS be a domain contained in a bounded domain D
∈
ℝ
2. The boundaries of D and S are assumed to be C
2 smooth and defined by Γ
1 and Γ
2, respectively. We denote Ω
:
=
D
∖
S
- and consider the two-dimensional advection-diffusion equations for the transport of a contaminant in the surface water with an initial condition
(1)
∂
u
∂
t
+
b
·
∇
u
-
div
⁡
(
a
∇
u
)
=
f
x
∈
Ω
,
t
∈
(
0
,
T
]
,
u
(
x
,
t
)
=
0
x
∈
Γ
1
,
t
∈
(
0
,
T
]
,
u
(
x
,
t
)
=
0
x
∈
Γ
2
,
t
∈
(
0
,
T
]
,
u
(
x
,
0
)
=
u
0
x
∈
Ω
,
where t is time, x
=
(
x
,
y
) represents the space coordinate, a is diffusion coefficient, u
(
x
,
t
) is concentration of the contaminant, b denotes velocity of water flow, and f accounts for external sources and sinks, respectively. Notice that a and b are considered to be positive constants quantifying the diffusion and advection processes. For a given domain D, it is well known that this initial boundary value problem has a unique solution [11].The purpose of this paper is to investigate the feasibility of recovering the unknown boundaryΓ
2 from the measured (observed) data on the exterior boundary. We define the operator F on the admissible set X by F
(
Γ
2
)
=
P, where P is the measured (observed) data and may represent a given objective related to specific characteristic features of the diffusion and advection processes. The inverse problem is both ill-posed and nonlinear.First of all, we introduce the following functional spaces which will be used throughout this paper. LetL
2
(
Ω
) be the space of square integrable real-valued functions on Ω with the usual norm. The space H
k
(
Ω
), where k
=
1,2
…
,
n denotes the standard Sobolev space on Ω (see [12]), that is, the space of functions with generalized derivatives of order up to k in L
2
(
Ω
). In addition, H
0
1
(
Ω
)
:
=
{
v
∈
H
1
(
Ω
)
,
v
|
∂
Ω
=
0
}.Multiplying the advection-diffusion equations (1) by a test function v
∈
H
0
1
(
Ω
), we easily derive the variational formulation as follows.Findu
∈
H
0
1
(
Ω
), such that
(2)
∫
Ω
‍
∂
u
∂
t
v
d
x
+
∫
Ω
‍
b
·
∇
u
v
d
x
+
∫
Ω
‍
a
∇
u
·
∇
v
d
x
=
∫
Ω
f
v
d
x
,
for all v
∈
H
0
1
(
Ω
). The above identity has to be intended in the sense of distribution in (
0
,
T
] and can be expressed in the finite element method framework as
(3)
t
(
u
,
v
)
+
a
(
u
,
v
)
+
c
(
u
,
v
)
=
(
f
,
v
)
∀
v
∈
H
0
1
(
Ω
)
,
where the forms are given by
(4)
a
(
u
,
v
)
=
∫
Ω
‍
a
∇
u
·
∇
v
d
x
,
c
(
u
,
v
)
=
∫
Ω
‍
b
·
∇
u
v
d
x
,
t
(
u
,
v
)
=
∫
Ω
‍
∂
u
∂
t
v
d
x
,
(
f
,
v
)
=
∫
Ω
‍
f
v
d
x
.


## 3. Domain Derivative Method

This section is devoted to deriving the domain derivative of the solution of the advection-diffusion equations.A derivative of operatorF at boundary Γ can be defined as follows [13]. For any real vector field a
∈
C
2
(
Γ
;
ℝ
2
), we denote by Γ
a the set
(5)
Γ
a
=
{
x
+
a
(
x
)
,
x
∈
Γ
}
,
where ∥
a
∥
∞
:
=
max
⁡
x
∈
Γ
|
a
| is small enough. Now we define the domain derivative of F at boundary Γ in the direction a by
(6)
F
′
(
Γ
;
a
)
:
=
lim
⁡
ϵ
→
0
1
ϵ
[
F
(
Γ
ϵ
a
)
-
F
(
Γ
)
]
,
where the limit should exist uniformly.Similarly, if the vector fieldh
∈
C
2
(
Γ
2
) is sufficiently small, a perturbation of the boundary Γ
2 can be specified by
(7)
Γ
2
h
=
{
x
+
h
(
x
)
,
x
∈
Γ
2
}
,
which is a C
2 boundary of a perturbed domain Ω
h. We choose an extension of h
∈
C
2
(
Ω
) with ∥
h
∥
C
2
(
Ω
)
≤
c
∥
h
∥
C
2
(
Γ
2
)
,
c
>
0, which vanishes in the exterior of a neighborhood of Γ
2 and define the diffeomorphism φ
(
x
)
=
x
+
h
(
x
) in Ω. If the inverse function of φ is denoted by ψ, J
φ and J
ψ are Jacobian matrices.Let us consideru
h
∈
H
0
1
(
Ω
h
) to be the solution of perturbed problem, for a variation h given by the solution of
(8)
∫
Ω
h
∂
u
h
∂
t
v
h
d
x
h
+
∫
Ω
h
‍
b
h
·
∇
u
h
v
h
d
x
h
+
∫
Ω
h
‍
a
h
∇
u
h
·
∇
v
h
d
x
h
=
∫
Ω
h
f
h
v
h
d
x
h
,
for all v
h
∈
H
0
1
(
Ω
h
) with a
h, b
h, and f
h defined as a, b, and f replacing Ω by Ω
h. Changing the spatial variables by the diffeomorphism φ leads to
(9)
∫
Ω
∂
u
~
∂
t
v
det
⁡
⁡
(
J
φ
)
d
x
+
∫
Ω
b
~
·
∇
u
~
v
J
ψ
det
⁡
⁡
(
J
φ
)
d
x
+
∫
Ω
a
~
∇
u
~
(
J
ψ
(
J
ψ
)
T
det
⁡
(
J
φ
)
)
·
∇
v
d
x
=
∫
Ω
f
~
v
det
⁡
(
J
φ
)
d
x
,
for all v
∈
H
0
1
(
Ω
), where a
~
=
a
h
∘
ψ, b
~
=
b
h
∘
ψ, and f
~
=
f
h
∘
ψ.The Jacobian matrix ofh is abbreviated by J
h. From J
φ
=
I
+
J
h and J
ψ
=
J
φ
-
1
∘
ψ
=
I
-
J
h
+
O
(
∥
h
∥
C
2
(
Ω
)
2
), the following first-order expansions hold
(10)
∥
a
~
J
ψ
(
J
ψ
)
T
det
⁡
(
J
φ
)
-
a
I
+
a
(
J
h
+
J
h
T
)
-
div
⁡
(
a
h
)
I
∥
∞
=
O
(
∥
h
∥
C
2
(
Ω
)
2
)
,
∥
b
~
·
J
ψ
det
⁡
(
J
φ
)
-
b
+
b
·
J
h
-
div
⁡
(
b
·
h
)
I
∥
∞
=
O
(
∥
h
∥
C
2
(
Ω
)
2
)
,
∥
f
~
det
⁡
(
J
φ
)
-
f
-
div
⁡
(
f
h
)
∥
∞
=
O
(
∥
h
∥
C
2
(
Ω
)
2
)
.Furthermore, we can prove the following important theorem which is the main theoretical result of the paper.Theorem 1.
Assume thatS is a domain with boundary Γ
2 in the class C
2, and u
∈
H
0
1
(
Ω
) denotes the solution of (1). Then u is differentiable at Γ
2 in the sense that there exists u
* depending on h, such that
(11)
lim
⁡
h
→
0
1
∥
h
∥
C
2
∥
u
~
-
u
-
u
*
∥
1
=
0
.
Moreover, the domain derivative u
′ satisfies the initial boundary value problem
(12)
∂
u
′
∂
t
+
b
·
∇
u
′
-
div
⁡
(
a
∇
u
′
)
=
0
x
∈
Ω
,
t
∈
(
0
,
T
]
,
u
′
=
0
x
∈
Γ
1
,
t
∈
(
0
,
T
]
,
u
′
=
-
h
n
∂
u
∂
n
x
∈
Γ
2
,
t
∈
(
0
,
T
]
,
u
′
(
x
,
0
)
=
0
x
∈
Ω
,
where h
n
=
h
·
n is the normal component of the vector field h.Proof.
Firstly, we will establish the continuous dependence of the solutionu on variations of the boundary Γ
2. We consider the difference u
~
-
u, and the variational equation yields
(13)
t
(
u
~
-
u
,
v
)
+
a
(
u
~
-
u
,
v
)
+
c
(
u
~
-
u
,
v
)
=
t
(
u
~
,
v
)
-
t
(
A
u
~
,
v
)
+
t
(
A
u
~
,
v
)
-
t
(
u
,
v
)
+
a
(
u
~
,
v
)
-
a
(
B
u
~
,
v
)
+
a
(
B
u
~
,
v
)
-
a
(
u
,
v
)
+
c
(
u
~
,
v
)
-
c
(
C
u
~
,
v
)
+
c
(
C
u
~
,
v
)
-
c
(
u
,
v
)
=
t
(
(
I
-
A
)
u
~
,
v
)
+
a
(
(
I
-
B
)
u
~
,
v
)
+
c
(
(
I
-
C
)
u
~
,
v
)
+
∫
Ω
f
~
v
A
d
x
-
∫
Ω
f
v
d
x
,
where the notations A
:
=
det
⁡
(
J
φ
), B
:
=
J
ψ
(
J
ψ
)
T
det
⁡
(
J
φ
), and C
:
=
J
ψ
det
⁡
(
J
φ
).
From the first-order approximations (10) in Ω and taking v
=
u
~
-
u, the perturbation argument shows continuity
(14)
∥
u
~
-
u
∥
1
⟶
0
,
as
∥
h
∥
C
2
(
Ω
)
⟶
0
.
Secondly, in order to prove the differentiability of the solutionu with respect to the boundary Γ
2, we define u
*
=
u
′
+
h
·
∇
u with the extension of h in Ω. Notice that in shape optimization, u
* is always called the material derivative (see [14]). Moreover, u
* is the unique solution of
(15)
t
(
u
*
,
v
)
+
a
(
u
*
,
v
)
+
c
(
u
*
,
v
)
=
∫
Ω
∂
u
∂
t
div
⁡
h
d
x
+
∫
Ω
∇
u
·
(
a
(
J
h
+
J
h
T
)
-
div
⁡
(
a
h
)
I
)
∇
v
d
x
+
∫
Ω
(
h
·
∇
u
)
div
⁡
h
v
d
x
+
∫
Ω
div
⁡
(
f
h
)
v
d
x
,
for all v
∈
H
0
1
(
Ω
). According to the definitions of forms a
(
·
,
·
), b
(
·
,
·
), and t
(
·
,
·
), the identity follows
(16)
t
(
u
~
-
u
-
u
*
,
v
)
+
a
(
u
~
-
u
-
u
*
,
v
)
+
c
(
u
~
-
u
-
u
*
,
v
)
=
t
(
u
~
-
u
,
v
)
-
t
(
u
*
,
v
)
+
a
(
u
~
-
u
,
v
)
-
a
(
u
*
,
v
)
+
c
(
u
~
-
u
,
v
)
-
c
(
u
*
,
v
)
.
Plugging (13) and (15) into the above equation, we obtain
(17)
t
(
u
~
-
u
-
u
*
,
v
)
+
a
(
u
~
-
u
-
u
*
,
v
)
+
c
(
u
~
-
u
-
u
*
,
v
)
=
∫
Ω
‍
∂
u
~
∂
t
v
(
I
-
det
⁡
⁡
(
J
φ
)
)
d
x
-
∫
Ω
‍
∂
u
∂
t
div
⁡
h
d
x
+
∫
Ω
‍
∇
u
~
(
a
I
-
a
~
J
ψ
(
J
ψ
)
T
det
⁡
⁡
(
J
φ
)
)
·
∇
v
d
x
-
∫
Ω
‍
∇
u
·
(
a
(
J
h
+
J
h
T
)
-
div
⁡
(
a
h
)
I
)
∇
v
d
x
+
∫
Ω
‍
∇
u
·
(
b
-
b
~
J
ψ
det
⁡
⁡
(
J
φ
)
)
v
d
x
-
∫
Ω
‍
div
⁡
(
b
·
h
)
v
d
x
+
∫
Ω
‍
(
f
~
det
⁡
(
J
φ
)
-
f
)
v
d
x
.
Taking v
=
u
~
-
u
-
u
* and applying the first-order expansions again and the continuity of u
~
h, we have
(18)
1
∥
h
∥
C
2
∥
u
~
-
u
-
u
*
∥
1
⟶
0
,
as
∥
h
∥
C
2
⟶
0
.
Finally, we have to show thatu
* can be split into h
·
∇
u and u
′. By the chain rule, the formula
(19)
∇
u
·
[
a
(
J
h
+
J
h
T
)
-
div
⁡
(
a
h
)
I
]
∇
v
=
-
(
h
·
∇
u
)
div
⁡
(
a
∇
v
)
-
(
h
·
∇
v
)
div
⁡
(
a
∇
u
)
+
div
⁡
[
a
(
h
·
∇
u
)
∇
v
+
(
h
·
∇
v
)
(
a
∇
u
)
-
(
a
∇
u
·
∇
v
)
h
]
holds, if a, u, and v are sufficiently smooth. Applying the Gauss formula, the equation yields
(20)
∫
Ω
‍
div
⁡
w
d
x
=
∫
Ω
‍
div
⁡
[
(
h
·
∇
u
)
∇
v
+
(
h
·
∇
v
)
∇
u
-
(
∇
u
·
∇
v
)
h
]
d
x
=
∫
∂
Ω
‍
[
(
h
·
∇
u
)
∇
v
+
(
h
·
∇
v
)
∇
u
-
(
∇
u
·
∇
v
)
h
]
·
n
d
s
=
∫
∂
Ω
‍
(
h
·
∇
u
)
∇
v
·
n
d
s
,
with the abbreviation w
=
(
h
·
∇
u
)
∇
v
+
(
h
·
∇
v
)
∇
u
-
(
∇
u
·
∇
v
)
h.
From Green formula and the above equation, we have(21)
a
(
h
·
∇
u
,
v
)
=
-
∫
Ω
‍
a
(
h
·
∇
u
)
Δ
v
d
x
+
∫
∂
Ω
‍
a
(
h
·
∇
u
)
∇
v
·
n
d
s
=
∫
Ω
‍
a
(
div
⁡
w
-
(
h
·
∇
u
)
Δ
v
-
(
h
·
∇
v
)
Δ
u
)
d
x
+
∫
Ω
‍
a
(
h
·
∇
v
)
Δ
u
d
x
.
Notice that u satisfies the advection-diffusion equations (1) and applies the geometrical decompositions formulae [13], and we can obtain
(22)
a
(
h
·
∇
u
,
v
)
=
∫
Ω
‍
a
(
div
⁡
w
-
(
h
·
∇
u
)
Δ
v
-
(
h
·
∇
v
)
Δ
u
)
d
x
+
∫
Ω
‍
div
⁡
h
v
(
f
-
b
·
∇
u
-
∂
u
∂
t
)
d
x
+
∫
Ω
‍
v
(
h
·
∇
(
f
-
b
·
∇
u
-
∂
u
∂
t
)
)
d
x
.
Similarly, the following equation holds
(23)
c
(
h
·
∇
u
,
v
)
=
∫
Ω
‍
b
·
∇
(
h
·
∇
u
)
v
d
x
=
∫
Ω
‍
b
·
(
div
⁡
h
·
∇
u
+
h
Δ
u
)
v
d
x
.
We subtract (22) and (23) from (15); hence the difference is equal to
(24)
t
(
u
*
-
h
·
∇
u
,
v
)
+
a
(
u
*
-
h
·
∇
u
,
v
)
+
b
(
u
*
-
h
·
∇
u
,
v
)
=
∫
Ω
‍
∂
u
∂
t
div
⁡
h
d
x
+
∫
Ω
‍
∇
u
·
(
a
(
J
h
+
J
h
T
)
-
div
⁡
(
a
h
)
I
)
∇
v
d
x
+
∫
Ω
‍
(
h
·
∇
u
)
div
⁡
h
v
d
x
+
∫
Ω
‍
div
⁡
(
f
h
)
v
d
x
-
∫
Ω
‍
a
(
div
⁡
w
-
(
h
·
∇
u
)
Δ
v
-
(
h
·
∇
v
)
Δ
u
)
d
x
-
∫
Ω
‍
(
h
·
∇
v
)
(
f
-
b
·
∇
u
-
∂
u
∂
t
)
d
x
-
∫
Ω
‍
b
·
(
div
⁡
h
·
∇
u
+
h
Δ
u
)
v
d
x
=
0
.
From u
*
=
h
·
∇
u
+
u
′, the last equation implies t
(
u
′
,
v
)
+
a
(
u
′
,
v
)
+
b
(
u
′
,
v
)
=
0; namely,
(25)
∂
u
′
∂
t
+
b
·
∇
u
′
-
a
Δ
u
′
=
0
,
x
∈
Ω
.
Note that u
* vanishes on the boundary Γ
2, u
|
Γ
2
=
0 implies ∇
τ
u
|
Γ
2
=
0, and we derive the boundary condition on Γ
2,
(26)
u
′
=
u
*
-
h
·
∇
u
=
-
(
h
τ
·
∇
τ
u
+
h
·
∂
u
∂
n
n
)
=
-
h
n
∂
u
∂
n
.
Therefore, u
′ satisfies the initial boundary value problem (12). This ends the proof.


## 4. Numerical Algorithm and Examples

In this section, we will present a regularized Gauss-Newton algorithm and numerical examples in two dimensions to verify that our methods could be very useful and efficient for the shape reconstruction problem of unsteady advection-diffusion equations.From the numerous methods which have been developed for the solution of inverse boundary value problems of this type, we note two groups of approaches, namely, regularized Gauss-Newton iterations and decomposition methods. We choose the regularized Gauss-Newton method in this paper.Newton method is based on the observed information. We define an operatorF on set X of admissible boundaries by
(27)
F
(
Γ
2
)
=
P
,
where P is the measured (observed) data [14], X
:
=
{
φ
∈
C
2
(
Γ
2
)
,
0
<
β
≤
∥
φ
∥
C
2
≤
γ
}, and φ is the parametrized form of boundary Γ
2.However, since the linearized version of (27) inherits the ill-posedness, the Newton iterations need to be regularized. This approach has the advantages that, in principle, it is conceptually simple and that it leads to highly accurate reconstructions. But, as disadvantages, we notice that the numerical implementation requires the forward solution of the problem (1) in each step of the Newton iteration and reasonable a priori information for the initial approximation.


### 4.1. Parametric Technique of Boundary

A numerical implementation requires a parametrization of the boundary. Here we apply the parametric representations(28)
Γ
k
:
=
{
X
k
(
θ
)
=
(
x
k
,
1
(
θ
)
,
x
k
,
2
(
θ
)
)
,
0
⩽
θ
<
2
π
}
k
=
1,2
,
where X
k
:
ℝ
→
ℝ
2 is twice differentiable and 2
π-periodic with |
X
k
(
θ
)
|
>
0 for all θ. Further we assume that the orientation of the parametrization x
1 is clockwise and the parametrization x
2 is counter clockwise. In addition, we assume that Γ
2 is starlike with respect to the origin; that is,
(29)
X
α
(
θ
)
=
r
α
(
θ
)
(
cos
⁡
θ
sin
θ
)
,
0
⩽
θ
<
2
π
,
where
(30)
r
α
(
θ
)
=
α
0
+
∑
j
=
1
M
‍
(
α
j
cos
⁡
j
θ
+
α
j
+
M
sin
j
θ
)
with α
=
(
α
0
,
…
,
α
2
M
)
T
∈
ℝ
2
M
+
1 for some fixed number M
∈
N. Furthermore, we set the variation h
(
θ
)
=
{
(
q
(
θ
)
cos
⁡
θ
,
q
(
θ
)
sin
θ
)
T
:
θ
∈
[
0,2
π
)
}. From the representation (29), we have
(31)
d
d
s
=
1
r
α
2
(
θ
)
+
[
r
α
′
(
θ
)
]
2
d
d
θ
,
h
·
n
=
q
r
r
α
2
+
[
r
α
′
]
2
.


### 4.2. Discrete Domain Derivative Equations

We defineU
M
:
=
{
α
∈
ℝ
2
M
+
1
:
ρ
1
≤
r
α
(
θ
)
≤
ρ
2
,
θ
∈
[
0,2
π
]
}, 0
<
ρ
1
<
ρ
2. A simple application of Theorem 1 shows the following.Theorem 2.
Forα
∈
U
M, the operator F is differentiable with ∂
F
i
(
α
)
/
∂
α
j
=
∂
n
u
j
′
(
x
i
) for i
=
1
,
…
,
Q and j
=
0
,
…
,
2
M. Here u
′
∈
L
2
(
0
,
T
;
H
0
1
(
Ω
)
) is the solution of the initial boundary value problem
(32)
∂
u
j
′
∂
t
+
b
·
∇
u
j
′
-
div
⁡
(
a
∇
u
j
′
)
=
0
x
∈
Ω
,
t
∈
(
0
,
T
]
,
u
j
′
=
0
x
∈
Γ
1
,
t
∈
(
0
,
T
]
,
u
j
′
=
-
k
∂
u
j
∂
n
x
∈
Γ
2
,
t
∈
(
0
,
T
]
,
u
j
′
(
x
,
0
)
=
0
,
x
∈
Ω
,
where
(33)
k
=
-
r
α
(
θ
)
r
α
′
(
θ
)
2
+
r
α
(
θ
)
2
{
cos
⁡
j
θ
j
=
0
,
…
,
M
sin
(
j
-
M
)
θ
j
=
M
+
1
,
…
,
2
M
for θ
∈
[
0,2
π
).


### 4.3. Regularized Gauss-Newton Algorithm

The iterative algorithm can be summarized as follows.Step 1.
Choose an initial boundary forΓ
2 and describe it by the parametric representations α
0.Step 2.
Solve the advection-diffusion equations (1) by the finite element method.Step 3.
For a givenα
n, evaluate the Jacobian matrix of the mapping F by solving the discrete domain derivative equations
(34)
J
(
α
n
+
1
)
=
[
∂
F
1
(
α
n
)
∂
α
0
n
∂
F
1
(
α
n
)
∂
α
1
n
⋯
∂
F
1
(
α
n
)
∂
α
2
M
n
⋮
⋮
⋱
⋮
∂
F
Q
(
α
n
)
∂
α
0
n
∂
F
Q
(
α
n
)
∂
α
1
n
⋯
∂
F
Q
(
α
n
)
∂
α
2
M
n
]
.Step 4.
Apply the regularized Gauss-Newton method to obtain the new approximation of boundaryΓ
2,
(35)
α
n
+
1
=
α
n
-
(
J
(
α
n
)
T
J
(
α
n
)
)
-
1
J
(
α
n
)
r
(
α
n
)
,
where r
(
α
n
)
=
(
F
1
(
α
n
)
-
P
1
,
…
,
F
Q
(
α
n
)
-
P
Q
)
T. If
(36)
∑
i
=
1
Q
‍
|
F
i
(
α
n
)
-
P
i
|
+
μ
∥
α
∥
2
<
ɛ
,
where μ is a regularization parameter, then terminate, otherwise go back to Step 2.


### 4.4. Numerical Examples

We carry out the numerical examples to demonstrate the feasibility and validity of the proposed algorithm in Section4.3.In the following, we consider the shape reconstruction of the advection-diffusion process for the transport of a contaminant in two dimensions. We chooseD to be a rectangle [
-
4,5
]
×
[
-
1.5,1.5
] with the fixed boundary Γ
1, and the boundary Γ
2 of solid S is to be recovered in our simulations. The velocity of water flow is imposed by b
=
(
0.25
-
y
2
,
0
), the diffusion coefficient is choose as a
=
1
0
-
2, and the time interval is [
0,1
].We will reconstruct the shapes of solidS with different boundary curves.Case 1.
An elliptic curve is defined byx
(
t
)
=
0.8
*
cos
⁡
t
,
y
=
0.6
*
sin
t
,
t
∈
[
0,2
π
].Case 2.
A cone-shaped curve is parametrized byx
(
t
)
=
0.7
*
cos
⁡
t
+
0.2
*
(
cos
⁡
2
t
-
1
), y
(
t
)
=
0.5
*
sin
t, t
∈
[
0,2
π
].The dimension of the spaceU
M is 2
M
+
1
=
25, and the number of observation points is Q
=
48. We apply the finite element method to present the numerical implementation. Time discretization is effected using the backward Euler method and we assume that the time interval [
0,1
] is divided into equal intervals of duration Δ
t
=
0.05. Spatial discretization is effected using the continuous piecewise quadratic polynomials on a triangular mesh [15].Figures1 and 2 display the finite element mesh for two different target curves. Figures 3, 4, 5, and 6 demonstrate the comparison between the target shape and the iterated shape at different time. The solid line represents the exact boundary, and the dashed line gives the approximate boundary. The numerical results show that the iterative algorithm gives good reconstruction.Figure 1
Case1: finite element mesh for the target curve.Figure 2
Case2: finite element mesh for the target curve.Figure 3
Case1: t
=
0.20, reconstruction of an elliptic curve.Figure 4
Case1: t
=
0.40, reconstruction of an elliptic curve.Figure 5
Case2: t
=
0.15, reconstruction of a cone-shaped curve.Figure 6
Case2: t
=
0.30, reconstruction of a cone-shaped curve.


## 4.1. Parametric Technique of Boundary

A numerical implementation requires a parametrization of the boundary. Here we apply the parametric representations(28)
Γ
k
:
=
{
X
k
(
θ
)
=
(
x
k
,
1
(
θ
)
,
x
k
,
2
(
θ
)
)
,
0
⩽
θ
<
2
π
}
k
=
1,2
,
where X
k
:
ℝ
→
ℝ
2 is twice differentiable and 2
π-periodic with |
X
k
(
θ
)
|
>
0 for all θ. Further we assume that the orientation of the parametrization x
1 is clockwise and the parametrization x
2 is counter clockwise. In addition, we assume that Γ
2 is starlike with respect to the origin; that is,
(29)
X
α
(
θ
)
=
r
α
(
θ
)
(
cos
⁡
θ
sin
θ
)
,
0
⩽
θ
<
2
π
,
where
(30)
r
α
(
θ
)
=
α
0
+
∑
j
=
1
M
‍
(
α
j
cos
⁡
j
θ
+
α
j
+
M
sin
j
θ
)
with α
=
(
α
0
,
…
,
α
2
M
)
T
∈
ℝ
2
M
+
1 for some fixed number M
∈
N. Furthermore, we set the variation h
(
θ
)
=
{
(
q
(
θ
)
cos
⁡
θ
,
q
(
θ
)
sin
θ
)
T
:
θ
∈
[
0,2
π
)
}. From the representation (29), we have
(31)
d
d
s
=
1
r
α
2
(
θ
)
+
[
r
α
′
(
θ
)
]
2
d
d
θ
,
h
·
n
=
q
r
r
α
2
+
[
r
α
′
]
2
.


## 4.2. Discrete Domain Derivative Equations

We defineU
M
:
=
{
α
∈
ℝ
2
M
+
1
:
ρ
1
≤
r
α
(
θ
)
≤
ρ
2
,
θ
∈
[
0,2
π
]
}, 0
<
ρ
1
<
ρ
2. A simple application of Theorem 1 shows the following.Theorem 2.
Forα
∈
U
M, the operator F is differentiable with ∂
F
i
(
α
)
/
∂
α
j
=
∂
n
u
j
′
(
x
i
) for i
=
1
,
…
,
Q and j
=
0
,
…
,
2
M. Here u
′
∈
L
2
(
0
,
T
;
H
0
1
(
Ω
)
) is the solution of the initial boundary value problem
(32)
∂
u
j
′
∂
t
+
b
·
∇
u
j
′
-
div
⁡
(
a
∇
u
j
′
)
=
0
x
∈
Ω
,
t
∈
(
0
,
T
]
,
u
j
′
=
0
x
∈
Γ
1
,
t
∈
(
0
,
T
]
,
u
j
′
=
-
k
∂
u
j
∂
n
x
∈
Γ
2
,
t
∈
(
0
,
T
]
,
u
j
′
(
x
,
0
)
=
0
,
x
∈
Ω
,
where
(33)
k
=
-
r
α
(
θ
)
r
α
′
(
θ
)
2
+
r
α
(
θ
)
2
{
cos
⁡
j
θ
j
=
0
,
…
,
M
sin
(
j
-
M
)
θ
j
=
M
+
1
,
…
,
2
M
for θ
∈
[
0,2
π
).


## 4.3. Regularized Gauss-Newton Algorithm

The iterative algorithm can be summarized as follows.Step 1.
Choose an initial boundary forΓ
2 and describe it by the parametric representations α
0.Step 2.
Solve the advection-diffusion equations (1) by the finite element method.Step 3.
For a givenα
n, evaluate the Jacobian matrix of the mapping F by solving the discrete domain derivative equations
(34)
J
(
α
n
+
1
)
=
[
∂
F
1
(
α
n
)
∂
α
0
n
∂
F
1
(
α
n
)
∂
α
1
n
⋯
∂
F
1
(
α
n
)
∂
α
2
M
n
⋮
⋮
⋱
⋮
∂
F
Q
(
α
n
)
∂
α
0
n
∂
F
Q
(
α
n
)
∂
α
1
n
⋯
∂
F
Q
(
α
n
)
∂
α
2
M
n
]
.Step 4.
Apply the regularized Gauss-Newton method to obtain the new approximation of boundaryΓ
2,
(35)
α
n
+
1
=
α
n
-
(
J
(
α
n
)
T
J
(
α
n
)
)
-
1
J
(
α
n
)
r
(
α
n
)
,
where r
(
α
n
)
=
(
F
1
(
α
n
)
-
P
1
,
…
,
F
Q
(
α
n
)
-
P
Q
)
T. If
(36)
∑
i
=
1
Q
‍
|
F
i
(
α
n
)
-
P
i
|
+
μ
∥
α
∥
2
<
ɛ
,
where μ is a regularization parameter, then terminate, otherwise go back to Step 2.


## 4.4. Numerical Examples

We carry out the numerical examples to demonstrate the feasibility and validity of the proposed algorithm in Section4.3.In the following, we consider the shape reconstruction of the advection-diffusion process for the transport of a contaminant in two dimensions. We chooseD to be a rectangle [
-
4,5
]
×
[
-
1.5,1.5
] with the fixed boundary Γ
1, and the boundary Γ
2 of solid S is to be recovered in our simulations. The velocity of water flow is imposed by b
=
(
0.25
-
y
2
,
0
), the diffusion coefficient is choose as a
=
1
0
-
2, and the time interval is [
0,1
].We will reconstruct the shapes of solidS with different boundary curves.Case 1.
An elliptic curve is defined byx
(
t
)
=
0.8
*
cos
⁡
t
,
y
=
0.6
*
sin
t
,
t
∈
[
0,2
π
].Case 2.
A cone-shaped curve is parametrized byx
(
t
)
=
0.7
*
cos
⁡
t
+
0.2
*
(
cos
⁡
2
t
-
1
), y
(
t
)
=
0.5
*
sin
t, t
∈
[
0,2
π
].The dimension of the spaceU
M is 2
M
+
1
=
25, and the number of observation points is Q
=
48. We apply the finite element method to present the numerical implementation. Time discretization is effected using the backward Euler method and we assume that the time interval [
0,1
] is divided into equal intervals of duration Δ
t
=
0.05. Spatial discretization is effected using the continuous piecewise quadratic polynomials on a triangular mesh [15].Figures1 and 2 display the finite element mesh for two different target curves. Figures 3, 4, 5, and 6 demonstrate the comparison between the target shape and the iterated shape at different time. The solid line represents the exact boundary, and the dashed line gives the approximate boundary. The numerical results show that the iterative algorithm gives good reconstruction.Figure 1
Case1: finite element mesh for the target curve.Figure 2
Case2: finite element mesh for the target curve.Figure 3
Case1: t
=
0.20, reconstruction of an elliptic curve.Figure 4
Case1: t
=
0.40, reconstruction of an elliptic curve.Figure 5
Case2: t
=
0.15, reconstruction of a cone-shaped curve.Figure 6
Case2: t
=
0.30, reconstruction of a cone-shaped curve.


## 5. Conclusions

In this paper, we discuss the shape reconstruction problem governed by unsteady advection-diffusion equations. The differentiability of solution of the initial boundary value problem with respect to the boundary in the sense of the domain derivative is established, which is the theoretical foundation for the Newton method. A regularized Gauss-Newton scheme is effectively applied to the shape determination problem. Numerical experiments indicate the feasibility of the proposed method.



---

*Source: 673108-2014-03-04.xml*