Finite Element Approximation of Optimal Control Problem with Weighted Extended B-Splines

Abstract

In this research article, an optimal control problem (OCP) with boundary observations is approximated using finite element method (FEM) with weighted extended B-splines (WEB-splines) as basis functions. This type of OCP has a distinct aspect that the boundary observations are outward normal derivatives of state variables, which decrease the regularity of solution. A meshless FEM is proposed using WEB-splines, defined on the usual grid over the domain, ${\mathbb{R}}^2$. The weighted extended B-spline method (WEB method) absorbs the regularity problem as the degree of the B-splines is increased. Convergence analysis is also performed by some numerical examples.

1. Introduction

The optimal control problems (OCPs) originate from the civil engineering of earth supplies [1]. OCPs governed by the partial differential equations (PDEs) feature in the practical applications of electrical, mechanical, control and aerospace engineering from many decades. Some large space structures, sensitive equipment and their operating structures also require optimal control technology. Although, civil engineering assembles the applications of OCPs in an exclusive style, which offers new challenges [2].

Since OCPs have widespread applications, so it is necessary to solve them by numerically stable methods whenever it is problematic to solve analytically. The numeric simulations of above stated applications have been performed using well known numeric techniques [3]. No doubt, practically, in order to avoid the unappropriate disturbances, closed loop optimal controls have a leading position over the open loop controls. Under some slight conditions on the coefficients and admissible control points, Sun et al. [4] gave the solution of closed loop OCP via Riccati equation.

It can easily be estimated from the increasing publishing trend of research articles over the last few decades that FEM has proved itself a well programmed and commonly used method in an extensive range of engineering applications in general, for example in structural analysis, heat transfer and fluid mechanics etc. Different mathematicians have presented FEM for PDEs as well as for OCPs [5,6,7,8,9,10,11,12].

Recently mathematicians used non uniform rational B-splines (NURBS) as the basis functions, instead of the customary Lagrange polynomials. Buckling analysis of thin symmetrically laminated composite plates using NURBS is done by [13]. Valizadeh et al. [14] studied the behaviour of functionally graded plates with NURBS as finite element basis functions. Liu et al. [15] analyzed the homogeneous and functionally graded microplates using an isogeometric analysis and non-classical Kirchhoff plate theory. The adaptive isogeometric analysis for two dimensional elasticity problems using locally refined B-splines is done by [16].

For optimal controls, Hinze et al. [17] studied the optimality conditions of OCPs in 2009. Becker et al. [18] analyzed constrained OCPs governed by the convection diffusion equations. FEM practiced the optimality conditions for approximation of problems governed by Stokes equations [19,20]. A variational discretization was done by [21]. Superconvergence properties of OCPs were firstly presented by [22]. As convergence is concerned, superconvergence for OCPs with semi-linear elliptic equations is done by [23]. The effort of [24] is also remarkable as it considered the elliptic OCPs with pointwise observations. Hou estimated errors of mixed FEM for elliptic OCPs [25]. Hou also discussed the error estimates of expanded mixed FEM for OCPs obtained by hyperbolic integro differential equation [26]. Chen et al. [27] applied mixed multiscale FEM for the convex OCPs with oscillating coefficients. Error estimates for mixed FEM for OCPs of low regularity are discussed in [28].

This manuscript presents FEM with WEB-splines to solve elliptic OCPs with boundary observations. The major characteristic of such optimal control problems is that the observations are the outward normal derivatives of the state variable on the boundary which decreases the regularity of solutions. There are certain limitations with standard FEM to deal with such type of inhomogeneous boundary conditions. In standard FEM, one is forced to approximate normal derivatives at boundary in the OCP by means of other numerical techniques, for example [29]. However mixed FEM solves such type of inhomogeneous boundary on a higher cost as compared to the standard FEM [29].

The WEB method resolves the regularity problem, relatively at a lower cost and boundary conditions are well approximated without being discontinuous. WEB method is a meshless technique defined on a usual grid over domain. Convergence rate of the WEB method depends on the degree of B-splines. A special extrapolation technique is employed to prevent the loss of stability in the presence of small cut-cell by the boundary. As a result, a new set of extended B-splines is obtained and is further stabilized by using the stabilizing factor. This stabilizing factor depends on the weight functions. Finally, the WEB-splines are obtained. For the error analysis of WEB method, a straight approach of finite element discretization could be tedious. The approximation order via quasi interpolant would be an easy approach to get the goal. Due to the standard projector property of canonical quasi interpolant, the task becomes easy because the approximation $u_h$ depends on $Q_{q}u$ within the support of $B_i$, see (18). Approximation order of WEB method with elliptic boundary conditions gives the convergence of $O\left(h^d\right)$, where d is the degree of B-spline [30]. But here we have an exceptional type of objective functional consisting of outward normal derivative of the state variable on boundary. Another main feature is that the adjoint state equation appears as an elliptic equation with inhomogeneous Dirichlet boundary condition whose value is the partial derivative of the state. Thus for an OCP of this type, WEB method can not approximate upto $O\left(h^d\right)$. To the best of authors knowledge, such type of approximation to OCP with such special boundary observation has not been addressed earlier.

Let a square symmetric coefficient matrix $A=a_{ij}\in C^{(2,1)}$, defined on $\overline{\Omega }$ be positive definite by nature. Then the OCP is to find the function y for which

$$\underset{u\in U_{ad}}{min}I(y,u)=1/2\left\{\underset{\partial \Omega }{\int }{({\partial }_{n}y-{\sigma }_d)}^{2}ds+\beta \underset{{\Omega }_{ad}}{\int }{u}^{2}dx\right\}$$

(1)

is subjected to

$$\left\{\begin{array}{c}-div(A\nabla y)=f+ϝuin\Omega ,\hfill \\ y=0on\partial \Omega .\hfill \end{array}\right.$$

(2)

Equation (2) is called the state equation, where domain $\Omega \subset {\mathbb{R}}^2$ is convex and has a smooth boundary $\partial \Omega$. The fixed positive number $\beta$ is a parameter of penalty. The function ${\sigma }_d\in L^2(\partial \Omega )$ and ${\partial }_{n}y$ is defined as $A\nabla y·\mathbf{n}$ where $\mathbf{n}$ is taken as outward drawn normal to boundary, $f\in L^2(\Omega )$ and ${\Omega }_{ad}$ is the admissible sub-domain of $\Omega$. $ϝ$ is a continuous linear operator that maps the elements from $L^2\left({\Omega }_{ad}\right)$ to $L^2(\Omega )$, which may be considered as a characteristic function ${\chi }_{{\Omega }_{ad}}$ defined on ${\Omega }_{ad}$. The set of admissible points $U_{ad}$, is composed of admissible control points, $u\in L^2\left({\Omega }_{ad}\right)$ such that ${\mu }_1\le u\le {\mu }_2,$ almost everywhere in ${\Omega }_{ad}$ and ${\mu }_1$, ${\mu }_2$ are real numbers.

Rest of the paper is organized in the following way. Section 2 contains some preliminary definitions. Also the OCP, optimality conditions and approximations are explained in this section. Section 3 represents the main hurdles in solving OCP by standard FEM and a detailed construction of WEB-splines over a bounded domain is presented in this section. Moreover, this section contains the pseudo-codes for application of WEB method over an OCP. Results regarding the approximation are given in Section 4. To support theoretical results, the numerical examples using proposed algorithm are given in Section 5. At last, some finishing conclusions are written in Section 6.

2. Optimality Conditions for OCP with Boundary Observations

2.1. Preliminaries

Let $\Omega \subset {\mathbb{R}}^n$, and we consider the continuous function $z:\Omega \to \mathbb{R}$, making the functional space $C(\Omega )$. Let the multiindex $\alpha \in {\mathbb{N}}^n$ such that $\left|\alpha \right|={\alpha }_1+\dots +{\alpha }_n$, and we define the space

$$C^m(\Omega )=\{z\in C(\Omega ):D^{\alpha }\left(z\right)\in C(\Omega )\mathrm{for}\left|\alpha \right|\le m\}.$$

For open and bounded domain

$$\begin{array}{c}\hfill C^m\left(\overline{\Omega }\right)=\{z\in C^m(\Omega ):D^{\alpha }\left(z\right)\mathrm{has}\mathrm{a}\mathrm{continuous}\\ \hfill \mathrm{extension}\mathrm{to}\overline{\Omega }\mathrm{for}\mathrm{all}\left|\alpha \right|\le m\}\end{array}$$

where $D^{\alpha }\left(z\right)={\partial }_{z_1}^{{\alpha }_1}\dots {\partial }_{z_n}^{{\alpha }_n}$.

Classically, it is assumed that the functions in boundary value problems must have continuous derivatives. For PDEs, it is required to use Sobolev spaces $W^{m,p}(\Omega )$ instead of the functional spaces $C^m\left(\overline{\Omega }\right)$. The typical representation of Sobolev spaces is

$$\begin{array}{c}\hfill W^{m,p}(\Omega )=\{z\in L^p(\Omega ):z\mathrm{has}\mathrm{weak}\mathrm{derivatives}\\ \hfill D^{\alpha }\left(z\right)\in L^p(\Omega )\forall \left|\alpha \right|\le m\}.\end{array}$$

The identity

$$\underset{\Omega }{\int }{D}^{\alpha }zvdx={(-1)}^{\left|\alpha \right|}\underset{\Omega }{\int }z{D}^{\alpha }vdx,\forall v\in C_c^{\infty }(\Omega )$$

clears the concept of weak derivatives where $C_c^{\infty }(\Omega )$ is a set of continuous functions on a compact space $\overline{\Omega }$.

In Sobolev space, norm and semi norm are defined as ${\parallel z\parallel }_{m,p}^p=\sum _{\left|\alpha \right|\le m}{\parallel D^{\alpha }z\parallel }_{L^p(\Omega )}^p$ and ${\left|z\right|}_{m,p}^p=\sum _{\left|\alpha \right|=m}{\parallel D^{\alpha }z\parallel }_{L^p(\Omega )}^p$. It is conventional to have $W_0^{m,p}(\Omega )=\{z\in W^{m,p}(\Omega ):z{|}_{\partial \Omega }=0\}$, i.e., this space includes all of the functions in $W^{m,p}(\Omega )$ that vanish on the boundary of $\Omega$. Significantly, if we fix $p=2,$ Sobolev space $W^{m,2}(\Omega )$ can be represented as $H^m(\Omega )$ and at the boundary $W_0^{m,2}(\Omega )$ can be represented as $H_0^m(\Omega )$. We denote the $L^2$ inner product defined on domain, boundary and admissible domain by $(·,·),$ $\langle ·,·\rangle$ and ${(·,·)}_{ad}$ respectively.

The solution y of the boundary value problem lies in $H^2(\Omega )\cap H_0^1(\Omega )$ named as Y with normal derivative ${\partial }_{n}y\in L^2(\partial \Omega )$. The objective functional (1) is well defined.

The weak form of the control problem (1) is: find the solution $y\in Y$ and $u\in U_{ad}$ satisfying the minimization problem

$$\underset{u\in U_{ad}}{min}I(y,u)=1/2\left\{\parallel {\partial }_{n}y-{\sigma }_d{\parallel }_{0,\partial \Omega }^2+\beta {\parallel u\parallel }_{0,{\Omega }_{ad}}^2\right\}$$

(3)

subject to

$$a(y,q)\equiv (A\nabla y,\nabla q)=(f+ϝu,q)q\in H_0^1(\Omega ).$$

(4)

Here, $a(·,·)$ is the bilinear functional $Y\times H_0^1⟼\mathbb{R}$ and is symmetric as well as positive definite by nature.

2.2. Approximation of Model

The residual form of the problem (3) and (4) is represented as:

Minimize $I(y,u)$ subjects to the residual

$$r(y,u)\equiv -div(A\nabla y)-f-ϝu=0$$

(5)

with Dirichlet boundary conditions $y=0$ on $\partial \Omega$.Consider the functions $(y,u,\sigma )\in Y\times U_{ad}\times L^2(\Omega ),$ which are continuously differentiable while $Y,$ $U_{ad}$ and $L^2(\Omega )$ are Banach spaces.

State equation $r(y,u)=0$ carries a unique solution for all $u\in Q\supset U_{ad}$, where Q is finite dimensional subspace of $L^2(\Omega )$:

$$\underset{y\in Y,u\in U_{ad}}{min}I(y,u)\mathrm{s}.\mathrm{t}.r(y,u)=0,u\in U_{ad}.$$

(6)

The following theorem shows the necessary and sufficient conditions for OCP.

Theorem 1.

The weak form Equations (3) and (4) of OCP exhibits the necessary and sufficient optimal conditions in $Y\times U_{ad}\times L^2(\Omega )$ stated as:

$$-(\sigma ,-div(A\nabla v))=\langle {\partial }_{n}y-{\sigma }_d,{\partial }_{n}v\rangle \forall v\in Y$$

(7)

$${(\beta u-{ϝ}^{*}\sigma ,\widehat{u}-w)}_{ad}\ge 0\forall \widehat{u}\in U_{ad}$$

(8)

with ${ϝ}^{*}$ is the adjoint of ϝ. Equivalently Equation (8) can be

$$u=P_{U_{ad}}\{-1/\gamma \left({ϝ}^{*}\sigma \right)\}$$

(9)

where $P_{U_{ad}}$ is the orthogonal projection on to $U_{ad}$.

Proof. 

Consider $(y,u)$ to be the optimal solution of OCP. To prove the theorem, we use technique of Lagrangian-based adjoint approach in [17]. The Lagrangian operator $\Lambda :Y\times U_{ad}\times L^2(\Omega )\to \mathbb{R}$ is defined as $\Lambda (y,u,\sigma )=2I(y,u)+(\sigma ,r(y,u\left)\right),$ where $r(y,u)$ is the residual defined in Equation (5). The optimality conditions can be obtained by the partial derivatives of $\Lambda$ w.r.t. $\sigma$, y and u

$$\begin{array}{c}\hfill ({\Lambda }_{\sigma }(y,u,\sigma ),q)=(q,-div(A\nabla y)-ϝu-f)\forall q\in L^2(\Omega )\end{array}$$

(10)

$$\begin{array}{c}\hfill ({\Lambda }_y(y,u,\sigma ),v)=\langle {\partial }_{n}y-{\sigma }_d,{\partial }_{n}v\rangle +(\sigma ,-div(A\nabla v))\forall v\in Y\end{array}$$

(11)

$$\begin{array}{cc}\hfill ({\Lambda }_u(y,u,\sigma ),w)=& \beta {(u,w)}_{ad}+(\sigma ,-ϝw)\forall u\in L^2(\Omega )\hfill \\ \hfill =& \beta {(u,w)}_{ad}+{(-{ϝ}^{*}\sigma ,w)}_{ad}\hfill \\ \hfill =& {(\beta u-{ϝ}^{*}\sigma ,w)}_{ad}\hfill \end{array}$$

(12)

Equating (10) and (11) to zero, leads to Equations (6) and (7). Assuming Equation (12) is non-negative gives Equation (8). □

The equivalent problems of the variational form of Equations (6)–(8) in the sense of distribution are the set of partial differential equations together with inequality constraint:

$$-div(A\nabla y)=f+ϝuin\Omega ,y=0on\partial \Omega$$

(13)

$$div(A\nabla \sigma )=0in\Omega ,\sigma =-({\partial }_{n}y-{\sigma }_d)on\partial \Omega$$

(14)

$$\underset{{\Omega }_{ad}}{\int }(\beta u-{ϝ}^{*}\sigma )(\widehat{u}-w)dx\ge 0in\Omega ,\widehat{u}\in U_{ad}$$

(15)

Solving the set of Equations (13)–(15), we will have the solution of the control problem. It is easy to see that problem resembles to Dirichlet boundary control problem [29]. The state equation of the Dirichlet boundary control problem can be easily handled by using standard FEM as well as by the WEB method. The difficulty arises with the fact that boundary condition of the adjoint state equation is comprised of normal derivatives of the state equation. The WEB method addresses this problem effectively by using cubic WEB-splines.

The partial derivative of the state variable ${\partial }_{n}y$ belongs to Bessel potential space lying on the boundary $H^{1/2}(\partial \Omega )$. Moreover, the norm of ${\partial }_{n}y$ on $H^{1/2}(\partial \Omega )$ is bounded [29], i.e.,

$${∥{\partial }_{n}y∥}_{H^{1/2}(\partial \Omega )}⪯{∥y∥}_{H^2(\Omega )}⪯{∥f+ϝu∥}_{L^2(\Omega )}.$$

The above relation shows the behavior of regularity of elliptic OCP with Dirichlet boundary conditions. The next lemma proves the regularity result of OCP and gives brief properties of functions involved in OCP.

Lemma 1.

Let the smooth bounded domain Ω, assuming $f\in L^2(\Omega )$ and ${\sigma }_d\in H^{1/2}(\partial \Omega )$ and let $u\in L^2\left({\Omega }_{ad}\right)$ then the solution of the state equation y and adjoint state equation σ has the properties:

$$y\in H^2\cap H_0^1,\sigma \in H^1(\Omega ),u\in H^1\left({\Omega }_{ad}\right).$$

Proof. 

The properties of the Bessel potential space can easily prove the first property. For the second property, ${\sigma }_d\in H^{1/2}(\partial \Omega )={\theta }_o\left(H^1(\Omega )\right),$ where ${\theta }_o$ is the trace operator which coincides with any usual restriction operator for continuous function. So, we may write ${\sigma }_d\in {ϝ}^{*}\left(H^1(\Omega )\right)$. By using Equation (12), we get $\sigma \in$ $H^1(\Omega )$. Third property can be directly obtained from Equation (8). □

3. WEB Based Finite Element Method

In standard FEM, a solution y is approximated by $y_h\in Y_h$ by using variational formulation, where $Y_h$ is a finite dimensional linear space. The function $y_h$, which is obtained from the system of algebraic linear equations, is continuous and piecewise linear on ${\Omega }_h$, where ${\Omega }_h$ is some polygonal subdomain of $\Omega$ and vanishes on $\partial {\Omega }_h$. The triangular discretization is a very common method for the discretization of a domain. The triangulation is performed in such a way that for triangles ${\lambda }_i$ and ${\lambda }_j$, $i\ne j,$ $\overline{{\lambda }_i}\cap \overline{{\lambda }_j}$ $=\mathsf{\Phi }$ or none of the vertex of ${\lambda }_i$ lying in the $\overline{{\lambda }_j}$ and ${\lambda }_i\cup {\lambda }_j,$ ∀$i,j$ establishes ${\Omega }_h$. Let h be the largest length of sides of triangles, built in the construction of ${\Omega }_h$. Triangulation becomes finer as $h\to 0$ and the boundary $\partial {\Omega }_h$ becomes closer to $\partial \Omega$. To approximate OCP, state variable y is to be further approximated by $y_h$, as its normal derivative in boundary condition of adjoint state equation does not allow the implementation of Dirichlet boundary condition directly. Yan et al. [29] stated the need of further approximation of ${\partial }_{n}y$ to a continuous form on the triangulation as ${\partial }_n^h{y}_h$ which may need extra calculation for the approximation of OCP. The error appearing in this interpolation will be contributed in the global error estimation of problem.

Instead of the standard FEM, we use the WEB-splines of degree $n\ge 2$. WEB-splines are stable and their approximation order for solving elliptic PDE is $O\left(h^d\right)$, where d is the degree of B-spline. Furthermore, normal derivative of WEB-splines basis function is continuous and therefore the direct implementation of the normal derivative of state variable $y_h$ is feasible. In this way, an additional step can be avoided in the approximation of OCP.

Weighted Extended B-Splines

The representation and topological form of a simulation domain $\Omega$ may play a key role in choosing the best suited tool for related problems. Intensive research over the last three decades has proved B-splines are systematic techniques in approximation, computer aided design and graphics. B-splines as finite element basis can offer better solutions for both geometry description and numerical simulation [16]. B-splines are the piecewise continuous functions, usually represented by sequence of knots. Let $(x_{\tau },x_{\tau +d+1})$ be a knot sequence, uniformly partitioning $h=x_{\tau +1}-x_{\tau }$, $d\ge 0$ is the degree of B-spline, the $\tau$-th B-spline of zero degree for the interval $\left[x_{\tau },x_{\tau +1}\right)$ is defined as

$$b_{\tau }^0\left(x\right)=\left\{\begin{array}{cc}1\hfill & \mathrm{if}x\in \left[x_{\tau },x_{\tau +1}\right)\hfill \\ 0\hfill & \mathrm{otherwise}\hfill \end{array}\right.$$

and the scaled translations of B-splines are $b_{\tau +1}^{d-1}\left(x\right)=b_{\tau }^{d-1}(x-1)$.

The recursion formula of the $\tau$-th B-spline of degree d is

$$b_{\tau }^d\left(x\right)=\frac{x-x_{\tau }}{x_{\tau +d}-x_{\tau }}{b}_{\tau }^{d-1}\left(x\right)+\frac{x_{\tau +d+1}-x}{x_{\tau +d+1}-x_{\tau +1}}{b}_{\tau +1}^{d-1}\left(x\right).$$

Linear, quadratic, cubic and higher order B-splines can be defined on this pattern. Stable and significantly more accurate approximated solutions are observed by using B-splines, especially in one dimension, as compared to classical finite element techniques. While for higher dimensions, $(s\ge 2)$ due to uniform support of B-splines, some limitations may arise when use them as finite element basis. Mainly, there are two reasons. Firstly, the use of Dirichlet boundary conditions is inconvenient as an approximation should be zero on the boundary and outside of a domain. The coefficients of the B-splines, whose supports have non empty intersection with boundary, must be zero to attain this task. This destroys the approximation order. Secondly, if some B-splines have very small intersection with a domain, the basis will not be uniform and become unstable near the boundary. This enlarges the condition number of system that results low convergence rate. These obscurities can be overcome by describing a new type of modified tensor product B-splines called weighted extended B-splines. WEB method was innovated and originated by Höllig et al. [30,31,32,33,34,35]. It has some major advantages. WEB method can be implemented on regular grids and there is no need of mesh generation as it is needed for the standard FEM. Basis functions are defined directly on grid. The domain retains its shape and is not disturbed by domain discretization or meshing. Boundary limitations are fully satisfied by this method. This method diminishes the size of the Galerkin system which ensures the accuracy of the approximated solution, fast convergence of solution algorithm, low condition number and less computation cost. For the sake of simplicity, we define here $u⪰v$ to be analogous to writing that $u\ge cv$, where u and v are the functions and c is any constant independent of h.

More concerned are those B-splines whose support intersects a domain. These B-splines form the spline space $\mathbb{B}$. Such B-splines are referred to as relevant B-splines. The set of indices of such B-splines is denoted as K. Additionally K is partitioned into inner and outer sets. The set of inner indices I is defined in such a way that the support of B-splines have at least one grid cell lying inside a domain. All other indices form the outer set O, i.e., $K=I\cup O$. These outer and inner B-splines are then further coupled. We extrapolate outer B-splines to the inner ones $b_i,i\in I=K\setminus O.$

A selection of inner B-splines can be obtained by an array of inner indices closest to o, i.e.,

$$I\left(o\right)=l\left(o\right)+{\{0,1,2,\dots ,n\}}^s\subset I.$$

(16)

This array corresponds to every outer index. The construction of extension coefficients, which couples the inner B-spline to the corresponding outer B-spline or vice versa, depends upon the value of Lagrangian polynomial [31].

The extension matrix $\left[e_{i,o}\right]$ can be formulated as:

$$e_{i,o}=\left\{\begin{array}{cc}\prod _{\lambda =1}^s{\displaystyle \underset{i_{\lambda }\ne l_{\lambda }+\nu }{\prod _{\nu =0}^d}}\frac{o_{\lambda }-l_{\lambda }-\nu }{i_{\lambda }-l_{\lambda }-\nu }& \mathrm{for}o\in O,i\in I\left(o\right)\\ {\delta }_{i,o}& \mathrm{otherwise},\end{array}\right.$$

(17)

where $l_{\lambda }$ is given in (16).

This extension coefficient comprises the weighted extended B-splines defined as follows:

$$B_i=\omega \left(x\right)\{b_i+\sum _{i\in I\left(o\right)}{e}_{i,o}{b}_o\}$$

We can choose $\omega \left(x\right)=dist{(x,\partial \Omega )}^{\gamma },x\in \Omega$ as a positive weight function of order $\gamma$. The weight function $\omega$ should be continuous throughout the boundary and uniform on domain $\Omega$, i.e., the weight function is sufficiently regular on a boundary. Ravashev et al. [36] studied R-functions in detail in order to construct weight functions.

However, for the case “$max\left|B_i\left(x\right)\right|\succcurlyeq 1$”, $B_i\left(x\right)$ cannot be used as a finite element basis. To normalize the basis, we have to multiply $B_i$ by balancing factor $1/\omega \left(x_i\right)$, i.e., $\frac{1}{\omega \left(x_i\right)}{B}_i\equiv \stackrel{\sim }{B_i}\left(x\right)$. Linear spanning of these WEB-splines $\stackrel{\sim }{B_i}\left(x\right)$, comprise the WEB space ${\mathbb{B}}^{web}$. The WEB space ${\mathbb{B}}^{web}$ has less dimension than the dimension of the B-spline space $\mathbb{B}$ and holds all basic requirements of finite element basis functions.

Figure 1 shows the grid description over a domain. The light grey cells are the boundary cells while the dark grey cells are referred to as the inner cells. The set of quadratic outer B-splines are shown as the red dots placed on the lower left corner of the support of the corresponding B-splines while the green dots are the inner B-splines. The quadratic B-splines are considered for the description.

Figure 2 shows the coupling of inner and outer B-splines. The inner B-splines $i\in I$ (green dot) have the coupling to outer B-splines $o\in O\left(i\right)$ (red dots) which have non-zero entries of the extension matrix $e_{i,o}.$ These are the only outer B-splines that couple with the inner B-splines.

The pseudo-codes for application of WEB method for an OCP are given in Algorithm 1.

Algorithm 1 Pseudo-codes for application of WEB method for an OCP

I : (i) Set the inputs (discretization/Galerkin). (ii) Formulate extension matrix using Equation (17). (iii) Using this extension matrix, formulate extended Galerkin matrix as: $G_{WEB}=EG{E}^T,F_{WEB}=Ef.$ (iv) Solving the system by numerical technique, solution is obtained. II : (i) U: Set initial estimate $u_h=0$. (ii) State equation: (a) Formulate the weak form of Equation (13). (b) Obtain Galerkin matrix. (c) Go back to step 1 and get the solution y. (iii) Adjoint stat equation: (a) Formulate the weak form of Equation (14). (b) Obtain Galerkin matrix. (c) Go back to step 1 and get the solution $\sigma$. III : Assemble the solution from Equation (15), state equation and adjoint stat equation.

4. Approximation of WEB Method

General results which are to be used in approximation of WEB-splines are stated. Höllig [30] gives the detailed descriptions and proofs of these results. The weight functions are considered to be k-regular and have order $\gamma$. The regularity of the continuous function plays a vital role in approximation results.

Some Useful Results

Quasi Interpolation [30]: In case of WEB-splines, the standard projector is defined by quasi interpolation as

$$Q_{q}z=\sum _{i\in I}{〈{\mathsf{\Xi }}_i,z〉}_0\stackrel{\sim }{B_i},$$

(18)

where ${\mathsf{\Xi }}_i$ is the dual function for WEB-splines, also containing a finite number of cells in their support and is bounded uniformly. Inside a grid unit $M,$ the norm of the standard projector is bounded,

$${∥Q_{q}z∥}_{\xi ,M\cap \Omega }\le c_1{h}^{-\xi }{∥z∥}_{0,M^{\prime }}\xi \le min(k,n)$$

(19)

where $M^{\prime }$ is the union of supports of all the relevant WEB-splines that intersect $M\cap \Omega$. The parameter $c_1$ is the constant that depends on domain, weight function and degree of the B-splines.

Bramble–Hilbert Estimate [30]: In scaled $\Omega ,$ for orthogonal projection $Q_q$ upon the polynomial g with degree of at most “$n$” satisfies

$${\left|g-Q_{q}g\right|}_{\xi ,h\Omega }\le c_4{h}^{\theta -\xi }{\left|g\right|}_{\theta ,h\Omega },$$

(20)

for $0\le \xi \le \theta \le n+1$ and $c_4$ is based on the domain and degree of B-splines.

5. Numerical Examples

The rational bezier curves are used to design the boundaries which are better to design and control the shape of the domain. Weight functions are the usual R-functions. Cubic B-splines are used to approximate the OCP. The solution behaves differently and has a variety of proportions.

Example 1.

Let ${\sigma }_d=(\sigma +\partial n_y)\underset{\partial \Omega }{|}$ and $U_{ad}=\{u\in L^2\left({\Omega }_{ad}\right):0⩽u⩽0.5a.e.in{\Omega }_{ad}\}.$ where $u=0$. The domain of a unit circle is taken with ${\Omega }_{ad}=\Omega$. The function $f=1-u$, the matrix $A=I$ and the parameter $\beta =1$ is used. The solution and error plot of state equation are given in Figure 3.

Figure 3a shows that the solution of the state equation is uniform, smooth and fully satisfies the Dirichlet boundary conditions, while the Figure 3b shows the error graph. The error is rigorous along the boundary. This behavior of error is due to the source function.

Figure 4a shows the solution of the adjoint state equation. The solution does not show a good behavior along the boundary due to the normal vector ${\partial }_{n}y$. However the solution satisfies the boundary conditions of adjoint state equation. Figure 4b shows the error plot of adjoint state equation. The error plot shows distortion along the boundary while it is uniform inside the domain.

Table 1. (Example 1) Error norms for u, state equation and adjoint state equation.

Degree of Freedom	$\parallel \mathit{u}-{\mathit{u}}_{\mathit{h}}{\parallel }_{{\mathit{L}}^2\left({\mathsf{\Omega }}_{\mathit{ad}}\right)}$	$\parallel \mathit{y}-{\mathit{y}}_{\mathit{h}}{\parallel }_{{\mathit{H}}^1\left(\mathsf{\Omega }\right)}$	$\parallel \mathit{\sigma }-{\mathit{\sigma }}_{\mathit{h}}{\parallel }_{{\mathit{L}}^2\left(\mathsf{\Omega }\right)}$
124	$0.01232$	$0.18251$	$0.04071$
400	$0.00802$	$0.04104$	$0.02435$
1428	$0.00674$	$0.03512$	$0.00917$
5358	$0.00098$	$0.00766$	$0.00409$
$20,752$	$0.00019$	$0.00351$	$0.00025$

shows the error norms for the u, state equation and adjoint state equation. The error norms for state equation are converging and show good results.

Example 2.

This example is defined on a more general domain as shown in Figure 5. Let ${\sigma }_d=(\sigma +\partial n_y)\underset{\partial \Omega }{|}$ and $U_{ad}=\{u\in L^2\left({\Omega }_{ad}\right):0⩽u⩽0.5a.e.in{\Omega }_{ad}\}$, where $u=0$. Again, ${\Omega }_{ad}=\Omega$, A and parameter β are taken as the identity and 1 respectively.

The solution of the state equation is smooth and satisfies the Dirichlet boundary conditions as shown in Figure 5a, while the error plot in Figure 5b shows that the solution has singularity along the corners.

The solution of adjoint state equation is not good enough along the boundary, shown in Figure 6a. Again the normal vector ${\partial }_{n}y$ is responsible for this unhealthy behavior. However, the boundary conditions are satisfied. Relative errors are shown in Figure 6b. The error plot shows irregular behavior along the boundary while it is uniform inside the domain.

Table 2. (Example 2) Errors of u, state equation and adjoint state equation.

Degree of Freedom	$\parallel \mathit{u}-{\mathit{u}}_{\mathit{h}}{\parallel }_{{\mathit{L}}^2\left({\mathsf{\Omega }}_{\mathit{ad}}\right)}$	$\parallel \mathit{y}-{\mathit{y}}_{\mathit{h}}{\parallel }_{{\mathit{H}}^1\left(\mathsf{\Omega }\right)}$	$\parallel \mathit{\sigma }-{\mathit{\sigma }}_{\mathit{h}}{\parallel }_{{\mathit{L}}^2\left(\mathsf{\Omega }\right)}$
55	$0.01234$	$0.08734$	$0.87041$
148	$0.00619$	$0.04316$	$0.38352$
433	$0.00305$	$0.02081$	$0.20174$
1456	$0.00156$	$0.00944$	$0.09022$
5336	$0.00082$	$0.00502$	$0.03512$

shows the error norms for u, state equation and adjoint state equation.

In WEB method, convergence depends upon the degree of the polynomial. Therefore, in Table 1 and Table 2, state equation gives better approximation as compared to classical FEM, while due to the regularity issues, the adjoint state equation gives a similar approximation as classical FEM.

6. Conclusions

WEB-spline-based finite element method is used to approximate the OCP with outward normal derivative boundary observations. The cubic B-splines are used for the extension of B-splines because of their continuous derivatives and thus the good approximations are achieved. The WEB method is defined on a usual grid and proved itself a reduced computation method when there is a question mark on the complications of mesh generation. The error results for simulating OCP on two different domains show that the WEB method is converging. The error graph shows that the solution is not smooth along the boundary. However, by using hierarchical structure, this boundary problem can be resolved.