Abstract
A conforming Virtual Element Method along with a variational discretization concept for solving the optimization problem governed by an elliptic interface problem is presented. Elements with small edges and hanging nodes occur naturally while numerically solving interface problems. Conforming Finite Element Methods cannot handle these difficulties naturally. VEM has the attractive feature that it can tackle hanging nodes and is even robust with respect to small edges. We use these features of VEM to design a method that can tackle these difficulties naturally. The state, adjoint and control estimates have been derived in suitable norms. Numerical results verify our theoretical findings and show the robustness and flexibility of the proposed method.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
- Virtual element method
- Optimal control problem
- Elliptic interface problem
- Variational discretization
- Numerical analysis
1 Introduction
There are numerous applications of interface problems in applied sciences and engineering. For example, in material sciences, problems involve discontinuous material coefficients across the interface, such as conductivity in heat transfer, permeability in porous media flow. Optimizing these physical processes lead to optimal control problems governed by partial differential equations (PDEs) with interfaces. To numerically solve these problems, one of the standard practices is to use a finite element method (FEM) (cf. [4, 7]), which has element boundaries coincident with the interface (see [2] and references therein). These methods are categorized as fitted methods. In this group of methods, the meshing of the domain depends on the location of the interface. One faces several difficulties in generating a mesh that resolves the interface. For example, aligning the element edges coincidentally at the interface is not trivial when meshing domains on either side of the interface. The relaxation of the edge alignment condition on the mesh can naturally lead to meshes that have arbitrarily small edges. The attractive properties of VEM make it robust under small edges and allow it to handle hanging nodes; we present a conforming virtual element method (VEM) along with the variational discretization concept presented in [3] for the discretization of the continuous optimization problem governed by an elliptic problem with a polygonal interface which can tackle these difficulties naturally. Our approach allows for greater flexibility in meshing since we can use different meshes on either side of the interface (see Fig. 1). Moreover, we also show that using the same feature of VEM, we can generate background fitted meshes independent of the location of the interface (see Fig. 1). Thus, it is easier to generate meshes as compared to conforming FEM. Our numerical experiments show that the original linear VEM stabilization presented in [5] will generate small but visible oscillations in the solution (see Fig. 2). This motivates us to use the boundary stabilization presented in [6], which smoothens these oscillations at the interface (see Fig. 3). The model problem is to find the distributed control z and the associated state \(y = y(z)\) satisfying
subject to
We define the jump of a function \(\zeta \) across \(\varGamma \) by \(\left[ \zeta \right] (x) := \zeta _1({\textbf {x}}) - \zeta _2({\textbf {x}}), \; \forall \; {\textbf {x}} \in \varGamma \), where \(\zeta _1\) and \(\zeta _2\) are restrictions of \(\zeta \) on \(\varOmega _1\) and \(\varOmega _2\), respectively, n denotes the unit outward normal vector to the interface. The coefficient \(\beta \) is assumed to be piecewise constant and positive and is defined as \(\beta _1\) in \(\varOmega _1\) and \(\beta _2\) in \(\varOmega _2\). Let \(z_a, z_b \in \mathbb {R}\) with \(z_a < z_b\), \(y_d \in L^2(\varOmega )\) is the desired state and \(\lambda > 0\) is the regularization or the penalty parameter. The admissible set of controls is defined as follows:
Define the space \(X := H^1(\varOmega ) \cap H^2(\varOmega _1) \cap H^2(\varOmega _2)\) equipped with the norm
Sobolev embedding theorem dictates that for any \(\zeta \in X\), we have \(\zeta \in W^{1,p}(\varOmega )\) for all \(p > 2\). The regularity of the state equation (2) is given by the following Lemma (see Theorem 2.1, [2])
Lemma 1
Assuming \(f, z \in L^2(\varOmega )\) and \(g \in H^{1/2}(\varGamma )\). We have that the problem (2) has a unique solution \(y \in X\) which satisfies
Using the standard techniques employed in PDE optimal control, we can find that the optimal control satisfies the following variational inequality also known as the first-order necessary optimality condition
where p is the adjoint variable or the co-state variable and solves the subsequent adjoint equation
A unique \(p \in X\) exists, which solves the adjoint equation follows from (Theorem 2.1, [2]). We can rewrite the first-order necessary optimality condition as a pointwise projection formula
If we introduce a control-to-state map S defined as \(Sz = y\), then the problem (1)–(2) reduces to
then the optimal control satisfies the following coercivity condition
Define \(a(\cdot ,\cdot ) : H^1(\varOmega ) \times H^1(\varOmega ) \longrightarrow \mathbb {R} \) such that \(a(\zeta ,\eta ) := \int _{\varOmega } \beta \; \nabla \zeta \cdot \nabla \eta \). Now the optimality system corresponding to (1)–(2) is to find \((y,p,z) \in V (:= H_0^1(\varOmega )) \times V \times Z_{ad}\) such that
We adopt the standard Sobolev space notations. Additionally, we have the notation \(a \lesssim b\), which represents that a is less than or equal to some positive constant (independent of the mesh parameter) times b. An outline of the manuscript is as follows. In Sect. 2, a VEM discretization of the continuous problem is proposed. In Sect. 3, we give the convergence analysis for the proposed scheme under suitable norms. Afterward, in Sect. 4, we conduct two numerical experiments to analyse the behaviour of the solution and verify the theoretical results proved in Sect. 3.
2 Discrete Formulation
Let \(\mathcal {T}_h\) be the triangulation of \(\varOmega \) into simple polygons K with discretization parameter \(h := \max _{K \in \tau _h} h_K \in \left( 0,1\right] \), where \(h_K\) is the diameter of K. \(\varGamma \) is the polygonal interface which is resolved by \(\mathcal {T}_h\). \(\mathcal {T}^*_h := \left\{ K \in \tau _h : K \cap \varGamma \ne \emptyset \right\} \) is the set of interface polygons. Then \(\mathcal {T}_h\) satisfies:
-
(A1)
\(\bar{\varOmega } = \cup _{K \in \mathcal {T}_h} K\).
-
(A2)
If \(K_1, K_2 \in \mathcal {T}_h\) are two distinct polygons, then either their intersection is empty or they share a common vertex or edge.
-
(A3)
Each polygon either lies in \(\varOmega _1\) or \(\varOmega _2\) and has at most two vertices lying on the interface.
Moreover, we introduce the following relaxed assumptions which allow small edges on any polygon \(K \in \tau _h\),
-
(A4)
Any \(K \in \mathcal {T}_h\) is star-shaped w.r.t. disc \(\mathbb {B}_K \subset K\) with radius \(\rho _K h_K\) where, and there exists \(\rho \in (0,1)\), such that \(\rho _K \ge \rho \) for all \(K \in \mathcal {T}_h\).
-
(A5)
There exists \(N \in \mathbb {Z}^+\) independent of the mesh parameter such that \(|E_K| \le N\), where \(E_K\) denotes the set of all edges of K.
2.1 Discretization of State and Adjoint Equations
Following [1], the linear local virtual element space \(V(K) \subset H^1(K)\) is defined as follows:
where
We denote by \(x_K\) the centroid of K, the space of all polynomials of degree \(\le 1\) is denoted by \(\mathbb {P}_{1}(K)\). The degrees of freedom of V(K) consist of the values of v at the vertices of K. Ritz projection operator \(\varPi ^{\nabla }_{1,K} : H^1(K) \longrightarrow \mathbb {P}_1(K)\) satisfies
where the inner product \((\!(\zeta ,w)\!) := (\nabla \zeta , \nabla w) + (\int _{\partial K} \zeta \; ds) (\int _{\partial K} w \; ds)\). Moreover, (7) is equivalent to
\(\varPi ^0_{1,K}\) is the projection from \(L^2(K)\) onto \(\mathbb {P}_1(K)\). \(\mathcal {P}_h^1\) represents the space of discontinuous piecewise polynomials of degree \(\le 1\). Then the global projection operators \(\varPi ^{\nabla }_{1,h} : H^1(\varOmega ) \longrightarrow \mathcal {P}^1_h, \;\; \varPi ^{0}_{1,h} : L^2(\varOmega ) \longrightarrow \mathcal {P}^1_h,\) are understood in the sense of their local counterparts as
We glue to the local virtual element spaces to write the following global virtual element space
The mesh dependent norm is defined as \(|v|_{h,1} := \left( \sum _{K \in \tau _h} |v|^2_{H^1(K)}\right) ^{\frac{1}{2}}\). We define the discrete bilinear form as follows:
Note that \(supp(\beta - \beta |_K) \cap K = \{0\}\) for all \(K \in \tau _h\). The two choices of local stabilization bilinear forms are defined as follows:
Here, \(\mathcal {B}_{\partial K}\) denotes the set of nodes of K. and \(\partial \zeta / \partial s\) is the tangential derivative of \(\zeta \) along \(\partial K\). From ((3.55) in [1]), we have for all \(u \in V(K)\) the following inequality
with a hidden constant depending on \(\rho _K\) and the degree of the polynomial. Also from ((3.56) in [1]) for all \(u \in V(K)\), we have
with the constant depending on \(|E_K|\) along with \(\rho _K\) and the degree of the polynomial. Here, \(\tau _K := \max _{e \in E_K} h_e / \min _{e \in E_K} h_e\). On combining (10) and (11), we get the following stability estimate for \(a_h(\cdot ,\cdot )\),
where
The source term is discretized using \(\varPi ^0_{1,h}\) operator as follows
2.2 Variational Discretization
In this approach, we discretize the control variable implicitly. Thus the discrete admissible set of controls coincides with \(Z_{ad}\). Following the optimize-then-discretize approach, we can write the discrete optimality system as follows: Find \((y_h,p_h,z_h) \in V_h \times V_h \times Z_{ad}\) such that
The discrete variational inequality (16) is rewritten as a discrete projection formula
The stability estimate (12) implies that the discrete state Eq. (14) and discrete adjoint Eq. (15) are well-posed.
3 Convergence Analysis
This section is dedicated to deriving the error estimates for the state, adjoint and control variable under variational discretization of control. We begin by considering the following auxiliary equations: For any arbitrary control \(\tilde{z} \in L^2(\varOmega )\), let \(y_h(\tilde{z}) \in V_h\) solve
and for any arbitrary \(\tilde{y} \in H^1_0(\varOmega )\), let \(p_h(\tilde{y}) \in V_h\) solve
Let us define the following notations \(y_h := y_h(z_h)\), \(p_h := p_h(y_h)\). For the subsequent analysis we will need the following Lemma.
Lemma 2
For any arbitrary \(\tilde{z}_i \in L^2(\varOmega )\), and \(\tilde{y}_i \in H^1_0(\varOmega )\), let \(y_h(\tilde{z}_i)\) and \(p_h(\tilde{y}_i)\), \(i = 1,2\) solve (18) and (19), respectively. Then
where \(\alpha _h\) is as defined in (13).
Proof
Test (18) with \(y_h(\tilde{z}_1)\) and \(y_h(\tilde{z}_2)\) to get,
Now using the stability estimate (12) along with \(v_h = y_h(\tilde{z}_1) - y_h(\tilde{z}_2)\), the stability of \(\varPi ^0_{1,K}\) operator and the consequence of Poincaré-Friedrichs inequality we have,
Similarly, test (19) with \(p_h(\tilde{y}_1)\) and \(p_h(\tilde{y}_2)\) along with \(q_h = p_h(\tilde{y}_1)-p_h(\tilde{y}_2)\) and follow the same steps to get the second desired inequality. \(\square \)
Estimates corresponding to the auxiliary problems (18) and (19) can be proved using the techniques of [1] and [2] in the following Lemma.
Lemma 3
Let \(y(\tilde{z})\) and \(y_h(\tilde{z})\) be the solutions of (4) and (18), respectively. Let \(p(\tilde{y})\) and \(p_h(\tilde{y})\) be the solutions of (5) and (19), respectively. Let \(f, y_d \in L^2(\varOmega )\) and \(g \in H^{1/2}(\varGamma )\) and \(\alpha _h\) is as defined in (13). Then
Additionally, if \(f, y_d \in H^1(\varOmega )\) then
Moreover, for \(\tilde{z} = z_h\),
Following the arguments of Lemma 2.1 in [2] and the standard approximation property of \(\varPi ^0_{1,K}\) given in [1], we have
Now we derive the error estimates for the state, adjoint and control variables under variational discretization of control.
Theorem 1
Let (y, p, z) solve the continuous optimality system (4)–(6). Let \((y_h,p_h,z_h)\) solve the discrete optimality system (14)–(16). Then under the assumptions of Lemma 2 and Lemma 3, then following estimate holds
where \(\alpha _h\) is as defined in (13).
Proof
The discrete (16) and continuous (6) variational inequalities give the following
The coercivity condition (3) for \(z - z_h \in Z\) and (21) leads to
In view of the stability of \(\varPi ^0_{1,K}\) operator, Lemmas 2 and 3, \(T_A\) is bounded as follows:
The term \(T_B\) is bounded using (20) as follows
Combining the bounds of \(T_A\) and \(T_B\) leads to the desired estimate. \(\square \)
Theorem 2
Assuming Theorem 1 holds. Then under variational discretization of control the following estimates hold
Proof
We split the error in state equation using \(y_h(z)\) as \(y-y_h = (y-y_h(z)) + (y_h(z)-y_h)\). Now we use Lemmas 2, 3 and Theorem 1 as follows:
Following analogous steps and using the splitting \(p-p_h = (p-p_h(y))+(p_h(y)-p_h)\), we can get the estimates for the adjoint variable. \(\square \)
4 Numerical Experiments
In this section, we present two numerical examples to study the behaviour of our scheme. In Example I, we study the behaviour of the solution at the interface in the presence of small edges under both the proposed stabilization terms \(S^K_1(\cdot ,\cdot )\) and \(S^K_2(\cdot ,\cdot )\). The mesh \(\mathcal {T}^1_h\) (see Fig. 1) under (A1)–(A5) that we consider arises naturally, if we mesh the domain \(\varOmega \) either side of the interface \(\varGamma \) with different elements. The error in control, state, and adjoint variables are illustrated, and the theoretical results of Sect. 3 are corroborated. In Example II, we employ a segment interface which is independent of the background fitted mesh \(\mathcal {T}^2_h\) (see Fig. 1) such that it satisfies (A1)–(A3). In Fig. 1, the red star markers on the slant interface are the intersection points of the interface with \(\mathcal {T}^2_h\) and result in hanging nodes that are repurposed to generate a fitted mesh; hence the name background fitted mesh. Error in control, state, and adjoint variables under variational discretization of control is illustrated which verifies the results obtained in Sect. 3.
Example 1
(Vertical interface) Let \(\varOmega \) be a unit square domain. Consider the problem (1)–(2). The interface \(\varGamma := \{{\textbf {x}} \in \varOmega : x_1 - 0.5 = 0\}\) and the following data
The optimal control problem is solved using the variational variant of the projected gradient algorithm presented in [3]. In our numerical experiment, we observe that under the classical VEM stabilization choice of \(S^1_K(\cdot ,\cdot )\), the solution of the state and the adjoint variable exhibits oscillations at the interface under the presence of small edges; however, the control variable is free of these oscillations under variational discretization of control (See Fig. 2). The red dotted lines in Fig. 2 represent the true solution at the interface, and the blue lines represent the approximated solution on \(\mathcal {T}^2_h\).
We do the same experiment with the boundary stabilization \(S^2_K(\cdot ,\cdot )\) and observe that the oscillations at the interface have smoothened (see Fig. 3).
Remark 1
It is also observed in our numerical experiments that the oscillations are sensitive to the parameter \(\beta \). For example, if we consider the same numerical example with \(\beta _1 = 1\) and \(\beta _2 = 0.5\), the oscillations with \(S^1_K(\cdot ,\cdot )\) in the state and the adjoint will be still visible but much smaller.
Now we compare the error under a sequence of meshes \(\mathcal {T}^1_1\) to \(\mathcal {T}^1_5\) (see Fig. 4). We compare the exact solution of the state and co-state variables with the \(L^2\)-projection of the discrete state and co-state variables since the virtual element solution is not known explicitly inside the element. The discrete control is computed using the discrete projection formula (17). We denote the \(L^2\)-error as follows
Similarly, we denote the error in the energy norm for the state and the co-state variable by \(E_1(y)\) and \(E_1(p)\), respectively with the help of \(\varPi ^{\nabla }_{1,K}\) operator. We denote by \(R_0(w)\) and \(R_1(w)\) the order of convergence corresponding to the variable w in the \(L^2\) and \(H^1\) norms, respectively. The numerical errors and the corresponding rate of convergence under \(\mathcal {T}^1_1\)-\(\mathcal {T}^1_5\) are given in Table 1 and corroborate theoretical results of Theorems 1 and 2. The solution profile on \(\mathcal {T}^1_3\) is given in Fig. 5.
Example 2
(Segment interface) Consider the problem (1)–(2) on a unit square domain with the interface \(\varGamma := \{ {\textbf {x}} \in \varOmega : x_2 = k x_1 + b \}\), where \(k = \frac{-\sqrt{3}}{3}\) and \(b = \frac{(6+\sqrt{6}-2 \sqrt{3})}{6}\) and the following data
The numerical errors and the corresponding order of convergence under a sequence of refined meshes of the type \(\mathcal {T}^2_h\) independent of the interface \(\varGamma \) are given in Table 2 and confirm the theoretical results of Theorems 1 and 2.
References
Brenner, S.C., Sung, L.Y.: Virtual element methods on meshes with small edges or faces. Math. Models Methods Appl. Sci. 28, 1291–1336 (2018)
Chen, Z., Zou, J.: Finite element methods and their convergence for elliptic and parabolic interface problems. Numer. Math. 79(2), 175–202 (1998)
Hinze, M.: A Variational Discretization Concept in Control Constrained Optimization: The Linear-Quadratic Case. Comput. Optim. Appl. 30, 45–61 (2005)
Yadav, O.P., Jiwari, R.: A finite element approach for analysis and coputational modelling of coupled reaction diffusion. Numer. Methods Partial Differ. Equ. 35, 830–850 (2019)
Beirão, V.L., Brezzi, F., Cangiani, A., Manzini, G., Marini, L.D., Russo, A.: Basic principles of virtual element methods. Math. Models Methods Appl. Sci. 23, 199–214 (2013)
Wriggers, P., Rust, W.T., Reddy, B.D.: A Virtual element method for contact. Comput. Mech. 58, 1039–1050 (2016)
Yadav, O.,P., Jiwari, R.: Finite element analysis and approximation of Burgers’-Fisher equation. Numer. Methods Partial Differ. Equ. 33, 1652–1677 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Tushar, J., Kumar, A., Kumar, S. (2023). Virtual Element Methods for Optimal Control Problems Governed by Elliptic Interface Problems. In: Sharma, R.K., Pareschi, L., Atangana, A., Sahoo, B., Kukreja, V.K. (eds) Frontiers in Industrial and Applied Mathematics. FIAM 2021. Springer Proceedings in Mathematics & Statistics, vol 410. Springer, Singapore. https://doi.org/10.1007/978-981-19-7272-0_36
Download citation
DOI: https://doi.org/10.1007/978-981-19-7272-0_36
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-7271-3
Online ISBN: 978-981-19-7272-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)