1,027
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

Numerical solutions for optimal control problem governed by elliptic system on Lipschitz domains

ORCID Icon & ORCID Icon
Pages 41-48 | Received 18 Jul 2018, Accepted 25 Jul 2018, Published online: 19 Sep 2018

ABSTRACT

In this paper, an optimal boundary control problem for a distributed elliptic system on Lipschitz domains with boundary homogeneous Dirichlet conditions and independently with Neumann conditions is analysed. The necessary and sufficient optimality conditions for such problems with the quadratic cost functionals are obtained. A Jacobi spectral Galerkin method is introduced to develop a direct solution technique for the numerical solution of elliptic problems subject to Dirichlet and Neumann conditions in one and two dimensions. The numerical examples are included to demonstrate the validity and applicability of the techniques and comparison is made with the existing results. The method is easy to implement and yields very accurate results.

1. Introduction

The boundary value problems on Lipschitz domains have attracted attention in both pure and applied mathematics (see for example [Citation1–3]). On the other hand, there are a lot of engineering problems such as point sensor placements at vertex points of the boundary in the mechanical engineering, corrosive engineering and spacecraft, point controllers at vertex points of the boundary in the stabilization of structural dynamics, etc., which require very careful local analysis around vertex points of the boundary (see [Citation4] and the references therein). The advantage of the Sobolev spaces on Lipschitz domains is connected with the fact that the study of the elliptic partial differential equations becomes very simple and elegant within these spaces. Thus, Sobolev spaces on Lipschitz domains play a very important role in those studies. Most properties of Sobolev spaces on Lipschitz domains are rigorously proved (see e.g. [Citation1,Citation2]).

Optimal control problem for a distributed elliptic system has been a research area of its own (see for example [Citation5–8]). The optimization problem associated with the optimal control of second-order distributed parameter systems defined on smooth domains of Rn has been studied by Lions [Citation5] and recently in [Citation9]. For other cases, we refer for example to [Citation10–12].

Recently, spectral methods have received considerable attention and become increasingly popular for solving different kinds of differential equations. This is definitively due to their superior accuracy for approximating the solutions of problems whose analytical solutions are smooth functions. In practice, this means that highly accurate solutions can be achieved with a small number of discretization nodes. Compared with algebraic convergence rates of the more traditional, finite element, volume, and difference methods spectral methods converge exponentially very fast [Citation13–17].

The spectral methods are divided into Galerkin method, tau method, and collocation method [Citation18–20]. For the convenience of different conditions, three classes of functions are always chosen as the basis for the spectral method: a power basis, a polynomial basis and a trigonometric basis. The important characteristic of the Galerkin method is that the expansion solution must individually satisfy the boundary conditions, whereas in collocation and tau methods, they are not necessary. Physical problems almost always be constrained by known boundary conditions which can be fully incorporated in a Galerkin method [Citation21–23]. Finding a fast and precise numerical solutions for elliptic equations are often a demand in the process of solving problems of fluid dynamics [Citation13,Citation24]. The Galerkin method provides the most suitable numerical approximation for such problems. In his context, Doha and Bhrawy [Citation25–27] introduced a new bases of some orthogonal polynomials for solving the two-dimensional Helmholtz and biharmonic problems by the diagonalization process.

In the present article, we consider a distributed elliptic system of second-order partial differential equation on an open set Ω with a Lipschitz boundary Γ in Rn. The existence and uniqueness theorems for the Dirichlet and Neumann problems are proved. The optimal control is characterized by the adjoint problem, and then particular properties of optimal control are also obtained. Furthermore, we aim to develop some efficient spectral algorithms based on the Jacobi Galerkin method (JGM) to approximate the linear second-order elliptic problems such that they can be implemented efficiently. Finally, the accuracy of the proposed algorithms is demonstrated by test problems.

The paper is organized as follows. In Section 2, we recall some basic notation and definitions of the Sobolev space on Lipschitz domains. Section 3 is devoted to formulate the Dirichlet and Neumann problems for elliptic systems on Lipschitz domains. Consequently, the distributed control problems for the Dirichlet problem are studied. We also give the necessary and sufficient conditions for the control to be an optimal for the two problems. Finally, we study the boundary control problem for the Neumann problem. In Section 4, we introduce some algorithms for solving second-order elliptic problems in one and two dimensions by using Jacobi Galerkin spectral methods. Also, the proposed methods are applied to several examples.

2. Sobolev spaces on Lipschitz domains

We first give brief discussions on the Sobolev spaces on the whole domains of Rn. As usual Rn denotes the n-dimensional real Euclidian space of points x=(x1,,xn). By a multi-index α, we understand a vector α=(α1,,αn) of non-negative integer components αi. We set |α|=i=1nαi.

Let Ω be a non-empty subset of Rn. If f(x) is a sufficiently smooth function on Ω, the partial derivative of f(x) is defined by Dαf(x)=|α|f(x)x1α1.xnαn,xα=x1α1xnαn. In the following, we shall recall some basic function spaces:

For any r0, we set Cr(Ω)={u:Dαuexists and continuous onΩfor |α|r}, and put C(Ω)=r0Cr(Ω) the space of infinitely differentiable functions on Ω. C0(Ω) denotes the space of all infinitely differentiable functions with a compact support in Ω, where supp(f)={xΩ:f(x)0}¯.

Obviously, C0(Ω) is a real vector space and can be turned into a topological vector space by a proper topology. The space C0(Ω) equipped with the following topology is denoted by D(Ω): a sequence of functions {fk}C0(Ω) is said to be convergent to a function fC0(Ω) in the space D(Ω) if

  1. there is a compact set KΩ such that for all k, supp(fkf)K and

  2. for each multi-index α, we have limkDα(fkf)=0.

The space, denoted by D(Ω), of all continuous linear functionals on D(Ω) is called the (Schwarz) distribution space. Lloc1(Ω) denotes the space of all locally integrable functions (defined almost everywhere on Ω). Lloc1(Ω) can be embedded into D(Ω) using the integration as the duality action. Corresponding to every function fLloc1(Ω) there is a distribution TfD(Ω) defined by Tf(φ)=Ωfφdx,φD(Ω). Evidently Tf, thus defined, is a linear functional on D(Ω).

If fC|α|(Ω), then integrating by parts |α|-times implies that ΩDαf(x)φ(x)=(1)|α|Ωf(x)Dαφ(x)for all φD(Ω),

there are no boundary terms, this is because φ has a compact support in Ω and thus φ and its derivatives vanish near ∂Ω. This identity motivates the following definition of the derivative DαT of a distribution TD(Ω): (DαT)φ=(1)|α|T(Dαφ)for all φD(Ω). We are now able to define the concept of a function being the weak derivative of another function. Let α be a multi-index and let u,vLloc1(Ω) such that Ωv(x)φ(x)=(1)|α|Ωu(x)Dαφ(x)for every φD(Ω).

Then the function v is called the weak or distributional α th derivative of u and is denoted by Dαu(x). i.e. v(x)=Dαu(x).

With the notion of distributions, it is easy now to give a definition for the Sobolev spaces in a form needed in our purpose.

Definition 2.1

Let m0 be an integer. Denote by Hm(Ω), the Sobolev space, the space of all distributions u defined on Ω such that DαuL2(Ω)for all |α|m. with a finite norm um,Ω given by um,Ω=|α|mDαu02, where |||| is the usual L2-norm.

Lemma 2.1

The Sobolev space Hm(Ω) a Hilbert space together with the inner product (u,v)m=|α|m(Dαu,Dαv), where (,) is the scalar product in L2(Ω).

Negative order Sobolev spaces: The closure of C0(Ω) with respect to the topology induced by the norm m,Ω is denoted by H0m(Ω). Roughly speaking for uH01(Ω) such that φ|∂Ω=0 in an appropriate sense. Except m=0 or Ω=Rn, H0m(Ω) is a proper subspace of Hm(Ω). For mN, Hm(Ω) is defined as the dual space of H0m(Ω). In particular, H1(Ω):=(H01(Ω)), and for uH1(Ω) u1,Ω=sup0vH01(Ω)|u,vH1(Ω)×H01(Ω)|v1,Ω, where the duality pairing on H1(Ω)×H01(Ω) is defined by the formula φ,ψH1(Ω)×H01(Ω)=Ωψ(x)Dφ(x)dx for ψH1(Ω) and φH01(Ω).

Proposition 2.2

Embedding of dual Sobolev spaces

For any bounded domain Ω in Rn, one has the following chain of embeddings: H01(Ω)L2(Ω)=(H1(Ω))H1(Ω).

Proof.

The first embedding is trivial (by definition). The equality follows from the Riesz representation theorem and L2(Ω) being a Hilbert space. For the last embedding observe that {v:v1,Ω1}{v:v1}. Thus, fL2(Ω) implies sup{v:v1}(f,v)<, which implies sup{v:v1,Ω1}(f,v)<. The proposition is proved.

Definition 2.2

A bounded domain ΩRn is called Lipschitz if near every boundary point p∂Ω there exist a rectangular coordinate system (x,t) (xRn,tR) and an open neighbourhood U of p such that ΩU={(x,t)U|t>χ(x)} for some Lipschitz function χ. i.e. χ:Rn1R and satisfying the Lipschitz condition (1) |χ(x)χ(x)|M|xx|for all x,xRn1.(1)

The smallest M in which (2.1) holds is called the bound of the Lipschitz constant. By choosing a finite open covering {Ui} of ∂Ω, the Lipschitz constant for a Lipschitz domain is the smallest M such that the Lipschitz constant is bounded by M in every Ui. We recall also that a Lipschitz function is almost everywhere differentiable (see e.g. [Citation11]).

Example 2.3

All the smooth domains are Lipschitz. In particular, a domain with smooth C1-boundary is Lipschitz. A very significant non-smooth domain which is Lipschitz is that every polygonal domain in R2 or polyhedron in R3. A more interesting example is that every convex domain in Rn is Lipschitz. A simple example of non-Lipschitz domain is two polygons touching at one vertex only.

3. Elliptic boundary value problems on Lipschitz domains

3.1. Dirichlet problem for the elliptic system

Let Ω be an open set in Rn with a Lipschitz boundary Γ. Consider the following distributed parameter elliptic system with the homogeneous Dirichlet boundary condition: (2) yΔy(x)=f,xΩ,(2) (3) yH01(Ω),(3) where Δ=i=1n(2/xi2) is a second-order self-adjoint elliptic partial differential operator maps H01(Ω) onto H1(Ω). We associate with Δ the bilinear: π(y,φ)=(yΔy,φ),y, φH01(Ω), and then (4) π(y,φ)=(yΔy,φ)=i,j=1nΩy(x)xjφ(x)xidx+Ωy(x)φ(x)dx.(4)

Lemma 3.1

The bilinear form π(y,) is coercive on H01(Ω)×H01(Ω). i.e. there exists a positive constant C such that (5) π(y,y)C||y||1,Ω2for all yH01(Ω).(5)

Proof.

It is well known that the ellipticity of Δ is sufficient for the coerciveness of π(y,φ) on H01(Ω). By virtue of (Equation4) and (Equation5), we have π(y,y)=Ωi,j=1ny(x)xjy(x)xidx+Ωy(x)y(x)dxCΩi=1ny(x)xi2dx+CΩ(y(x))2dxC||y||1,Ω2, where C is a positive constant.

One can easily show the symmetric property of π(y,), π(y,φ)=π(φ,y), for all y,φH01(Ω).

Under the above assumptions, we have the following existence and uniqueness theorem.

Theorem 3.2

Let the associated bilinear form π(y,) satisfies the coerciveness condition (3.4) on H01(Ω). Then, there exists a unique solution to the Dirichlet problem (Equation2), (Equation3).

Proof.

By the assumptions, the bilinear form π(y,) and the linear functional F(φ)=(f,φ) satisfy the hypotheses of the Lax–Milgram theorem for H01(Ω). There exists thus a unique element uH01(Ω) such that π(y,φ)=(yΔy,φ)=F(φ)for all φH01(Ω). This proves the theorem, since y is the weak solution to the Dirichlet problem (Equation2), (Equation3).

3.2. The control problem and the optimization theorem

For a control uL2(Ω), the state y(u) of the system (Equation2), (Equation3) is given by (6) y(u)Δy(u)=f+uinΩ(6) (7) y(u)=0onΓ,(7) The observation equation is given by z(u)=MνAy(u),y(x)νA=i,j=1naij(x)cos(n,xi)y(x)xjon Γ. Here, M is a given function in L(Γ), n is the exterior normal to Ω at Γ and cos(n,xi) is an ith direction cosine of n.

The cost functional J(v) is given by (8) J(v)=Γ(MνAy(v)zd)2dΓ+(Sv,v)=||MνAy(v)zd||L2(Γ)2+(Sv,v),(8) where zd is a given element in L2(Γ) and S:L2(Ω)L2(Ω) is a linear bounded self-adjoint operator (the solution operator for the problem (Equation6), (Equation7)) satisfying (Su,u)L2(Γ)c||u||2,c>0. If Uad (set of admissible controls) is a closed convex subset of L2(Ω), then making use of Lions's techniques we shall derive the necessary and sufficient conditions of minimizing the cost functional (Equation8). The solving of the formulated optimal control problem is equivalent to seeking a uUad such that (9) J(u)=infvUadJ(v).(9)

Theorem 3.3

Under the above assumptions, the problem (Equation9) admits a unique solution given by (Equation6), (Equation7) if, and only if, Ω(p(u)+Su)(vu)dx0for each vUad, where p(u) is the adjoint state defined as the solution of the adjoint equation: (10) p(u)Δp(u)=0in Ω,(10) (11) p(u)=M(My(u)νAzd)on Γ.(11)

Proof.

It follows from Theorem 3.1 of Lions [Citation5] that the control uUad is optimal if and only if J(u)(vu)0for all vUad. This condition, when explicitly calculated, gives (My(u)νzd,My(v)νMy(u)ν)L2(Γ)+(Su,vu)0 i.e. (12) Γ(My(u)νzd,My(v)νMy(u)ν)dΓ+(Su,vu)0.(12) Multiplying (Equation10) by (y(v)y(u)) and applying Green's formula, we obtain (13) 0=Ω(p(u)Δp(u))(y(v)y(u))dx=Γp(u)(y(v)νy(u)ν)dΓΓp(u)ν(y(v)y(u))dΓ+Ωp(u)((y(v)y(u))Δ(y(v)y(u)))dx.(13) In view of (Equation6) and (Equation7), we have y(v)y(u)Δ(y(v)y(u)))=vu and y(u)=0 for each uΓ. Then, the second boundary integral on the right-hand side of (Equation13) vanishes and then it becomes: (14) 0=Γp(u)y(v)νAy(u)νAdΓ+Ωp(u)(vu)dx.(14) Substituting (Equation11) into (Equation14), we get Γ(My(u)νAzd)(My(v)νAMy(u)νA)dΓ=Ωp(u)(vu)dx and hence (Equation12) is equivalent to Ωp(u)(vu)dx+(Su,vu)0 i.e. Ω(p(u)+Su)(vu)dx0, which completes the proof.

3.3. Neumann problem for the elliptic system

Let us consider the distributed parameter elliptic system with Neumann boundary condition: (15) yΔy=fin Ω,(15) (16) yνA=hon Γ.(16) The classical result of Meyers and Serrin (cf., e.g. Theorem 3.17 in [Citation1]) enables one to have the following chain of embeddings: H01(Ω)H1(Ω)L2(Ω). Thus, the coerciveness condition (Equation5) holds on H1(Ω). Repeating the same arguments as in Section 3.3 and using the trace theorem for the Sobolev spaces, we can prove the following existence and uniqueness theorem for the Neumann problem.

Theorem 3.4

Under the above assumptions, there exists a unique solution yH1(Ω) to the Neumann problem (Equation15), (Equation16).

3.4. Optimization theorem for the boundary control problem

We consider the space U=L2(Γ) (the space of controls), for every control uU, the state y(u) of the system is given as the solution of equation π(y(u),ϕ)=(u,ϕ)+(h+u,ϕ)L2(Γ), which may be interpreted as (17) y(u)Δy(u)=fin Ω,(17) (18) y(u)νA=h+uon Γ,(18) and the observation is given by z(u)=y(u). Finally, the cost function is given by =||y(v)zd||L2(Ω)2+(Sv,v)L2(Γ), where zd is a given element in L2(Ω) and S:L2(Γ)L2(Γ) is a linear, bounded, self-adjoint operator satisfying (Su,u)L2(Γ)c||u||2,c>0. Now, we have the following optimal control problem: (19) infvUadJ(v),(19) where Uad (set of admissible controls) is closed convex subset of U. Repeating arguments in the proof of Theorem 3.3, we have the following theorem.

Theorem 3.5

Under the above hypotheses, the optimal control u of (Equation19) is characterized by (Equation17), (Equation18) together with (20) p(u)Δp(u)=y(u)zdin Ω,(20) (21) p(u)νA=0on Γ,(21) (22) (p(u)+Su,vu)L2(Γ)0for all vUad(22) where p(u) is the adjoint state.

Example 3.6

In the case of no constraints on the control (Uad=U), we obtain (23) u=S1(P(u)|Γ).(23) Then, the optimal control is determined by simultaneously solving (Equation17),(Equation18), (Equation20), (Equation21) (where we eliminate u with the aid of (Equation23)) and then utilizing (Equation23).

Example 3.7

Consider Uad={u|u0 on Γ} and S=ν×Id, the inequality (Equation22) implies u0,p(u)+νu0,u(p(u)+νu)=0on Γ.

4. Numerical results and comparisons

We are interested in using the JGM to solve the second-order elliptic equation (24) β1uΔu=fin Ω=Id,u|∂Ω=0,(24) where I=(1,1), d=1,2, β1 is a nonnegative constant, and f is a given source function.

The Jacobi polynomials associated with the real parameters (α>1,β>1) (see, [Citation28–30]) are a sequence of polynomials Pn(α,β)(x)(n=0,1,2,), each respectively of degree n, satisfying the orthogonality relation (25) 11(1x)α(1+x)βPm(α,β)(x)Pn(α,β)(x)dx=0,mn,hn,m=n,(25) where hn=2α+β+1 Γ(n+α+1) Γ(n+β+1)(2n+α+β+1) n!Γ(n+α+β+1). These polynomials are eigenfunctions of the following singular Sturm–Liouville equation: (1x2)φ′′(x)+[βα(α+β+2)x]φ(x)+n(n+α+β+1)φ(x)=0. Let us first introduce some basic notation that will be used in the sequel. We set SN=span{P0(α,β)(x),P1(α,β)(x),,PN(α,β)(x)},VN={νSN:ν(±1)=0}, then the standard Jacobi–Galerkin approximation to (Equation24) is to find uNVNd such that (26) β1(uN,ν)w(ΔuN,ν)w=(f,ν)wνVNd,(26) where ω(x)=i=1d(1xi)α(1+xi)β and (u,ν)w=Ωuνωdx is the scalar product in the weighted space Lω2(Ω). The norm in Lω2(Ω) will be denoted by .ω.

Let us denote Hωs(Ω) as the weighted Sobolev spaces with the norm s,Ω,ω. It is well known (see [Citation13]) that for β10,s1, and uHωs(Ω), the following optimal error estimate holds: (27) uuNω+NuuN1,Ω,ωC(s)Nsus,Ω,ω.(27)

In practice, the proper choice of a basis for VNd is the key to achieve the optimal convergence rate (Equation26) and to obtain a simple linear system as possible. In this section, we introduce some numerical results based on some recent works [Citation25,Citation26,Citation31]. We consider the following examples.

Example 4.1

Consider the one-dimensional Neumann problem 32 u(x)u(x)=f(x)in I, with exact solution u(x)=ex.

Similar problems were also investigated by Auteri et al. [Citation18] using a Legendre–Galerkin method (LGM [Citation18]). Table  lists the L2- and H1-errors, using the JGM with various choices of N. The numerical results for this problem show that the JGM converges exponentially. We contrast our results with the corresponding results for LGM [Citation18] which we have presented in the fifth and seventh columns of this table.

Table 1. One-dimensional problem with Neumann conditions.

Example 4.2

γ1u(x,y)Δu(x,y)=f(x,y)in Ω=I×I,u|∂Ω=e with exact solution u(x,y)=x2+e2x+y.

This problem is solved in [Citation32] using an LGM in which the integrals on the right-hand side in the resulting linear system are approximated using (N+1)-point Legendre Gauss quadrature. The maximum pointwise errors of the proposed JGM using a tensor product process are presented in Table . We should note that for all values of N, the present method is always more accurate than the result of LGM [Citation32], which shows the spectral accuracy of our method.

Table 2. L-error of  uuN  for  N=8,12,16.

It should be noted that the Dirichlet boundary conditions in this example are nonhomogeneous. In [Citation32], the nonhomogeneous Dirichlet boundary conditions at the corners are dealt with using collocation. Then, the nonhomogeneous Dirichlet boundary conditions on each side, excluding the endpoints, are treated using the L2 projection onto the space of polynomials vanishing at the endpoints. In [Citation31], the nonhomogeneous Dirichlet boundary conditions are handled by determining two functions u1 and u2, defined on ∂Ω, such that u=u1+u2 on ∂Ω.

Example 4.3

Consider the problem u(x,y)Δu(x,y)=f(x,y),in Ω=I×I, with exact solution u=x2+ex+2y, and the four sets of nonhomogeneous boundary conditions:

  • Case 1: u(1,y)=er(y),u(1,y)=e(y),uy(x,1)=et(x),uy(x,1)=eb(x),

  • Case 2: ux(1,y)=er(y),ux(1,y)=e(y),u(x,1)=et(x),u(x,1)=eb(x),

  • Case 3: ux(1,y)=er(y),ux(1,y)=e(y),uy(x,1)=et(x),uy(x,1)=eb(x),

  • Case 4: u(1,y)+ux(1,y)=er(y),2u(1,y)ux(1,y)=e(y),2uy(x,1)uy(x,1)=et(x),uy(x,1)+uy(x,1)=eb(x),

In Table , we present the maximum pointwise errors of  uuN using the JGM with various choices of α,β, N for the four cases of boundary conditions.

Table 3. L-error of  uuN  for  N=8,12,16.

Auteri et al. [Citation18] proposed a direct spectral Galerkin-Legendre solver for the Neumann problem (Case 3) based on a double diagonalization process in which the Gauss-Legendre quadrature formula with N+1 points is used to evaluate the integrals defining the perturbed Neumann condition on the four sides and the term involving the integral of f. The corresponding integrals in the proposed method are evaluated exactly using the Jacobi polynomials.

Acknowledgments

The authors give this work to the spirit of Prof. Dr. A. H. Bhrawy for his helping during the work of this paper.

Disclosure statement

No potential conflict of interest was reported by the authors.

Funding

This work was supported by Taibah University [10.13039/501100002403].

References

  • Adams AR. Sobolev spaces. New York (NY): Academic Press; 1975.
  • Grisvard P. Elliptic problems in nonsmooth domains. London: Pitman; 1985.
  • Verchota G. Layer potentials and regularity for the Dirichlet problems for Laplace's equation in Lipschitz domains. J Funct Anal. 1984;59:572–611. MR 86e:35038. doi: 10.1016/0022-1236(84)90066-1
  • Ding Z, Zhou J. Constrained LQR problems governed by the potential equation on Lipschitz domain with point observations. J Math Pures Appl. 1995;74:317–344.
  • Lions JL. Optimal control of systems governed by partial differential equations, 170. Band: Springer-Verlag; 1971.
  • Lions JL, Magenes E. Non-homogeneous boundary value problem and applications, I. New York: Springer-Verlag; 1972.
  • Rosch A, Troltzsch F. Sufficient second-order optimality conditions for an elliptic optimal control problem with pointwise control-state constraints. SIAM J Optim. 2006;17(3):776–794. doi: 10.1137/050625850
  • Tolstonogov DA. About the minimum of the variational elliptic problems without the assumption of the convexity. Math Note. 1999;65(1):130–142.
  • Bahaa GM. Optimal control for cooperative parabolic systems governed by Schrödinger operator with control constraints. IMA J Math Control Inform. 2007;24:1–12. doi: 10.1093/imamci/dnl001
  • Bahaa GM. Optimal control problems of parabolic equations with an infinite number of variables and with equality constraints. IMA J Math Control Inform. 2008;25:37–48. doi: 10.1093/imamci/dnm002
  • Bahaa GM, Kotarski W. Optimality conditions for n×n infinite order parabolic coupled systems with control constraints and general performance index. IMA J Math Control Inform. 2008;25:49–57. doi: 10.1093/imamci/dnm003
  • Kotarski W, El-Saify HA, Bahaa GM. Optimal control of parabolic equation with an infinite number of variables for non-standard functional and time delay. IMA J Math Control Inform. 2002;19:461–476. doi: 10.1093/imamci/19.4.461
  • Canuto C, Hussaini MY, Quarteroni A, et al. Spectral methods in fluid mechanics. New York (NY): Springer-Verlag; 1988.
  • Bhrawy AH, Zaky MA. A method based on the Jacobi tau approximation for solving multi-term time-space fractional partial differential equations. J Comput Phys. 2015;281:876–895. doi: 10.1016/j.jcp.2014.10.060
  • Bhrawy AH, Zaky MA. Highly accurate numerical schemes for multi-dimensional space variable-order fractional Schrödinger equations. Comput Math Appl. 2017;73:1100–1117. doi: 10.1016/j.camwa.2016.11.019
  • Zaky MA, Machado JAT. On the formulation and numerical simulation of distributed-order fractional optimal control problems. Commun Nonlinear Sci Numer Simulat. 2017;52:177–189. doi: 10.1016/j.cnsns.2017.04.026
  • Bhrawy AH, Zaky MA. An improved collocation method for multi-dimensional space-time variable-order fractional Schr&quote;odinger equations. Appl Numer Math. 2017;111:197–218. doi: 10.1016/j.apnum.2016.09.009
  • Auteri F, Parolini N, Quartapelle L. Essential imposition of Neumann Galerkin-Legendre elliptic solvers. J Comput Phys. 2003;185:427–444. doi: 10.1016/S0021-9991(02)00064-5
  • Bhrawy AH, Zaky MA. Numerical simulation of multi-dimensional distributed-order generalized Schrödinger equations. Nonlinear Dyn. 2017;89:1415–1432. doi: 10.1007/s11071-017-3525-y
  • Bhrawy AH, Zaky MA, Van Gorder RA. A space-time Legendre spectral tau method for the two-sided space-time Caputo fractional diffusion-wave equation. Numer Algor. 2016;71:151–180. doi: 10.1007/s11075-015-9990-9
  • Livermore PW. Galerkin orthogonal polynomials. J Comp Phys. 2010;229:2046–2060. doi: 10.1016/j.jcp.2009.11.022
  • Livermore PW, Ierley GR. Quasi-Lp norm orthogonal Galerkin expansions in sums of Jacobi polynomials. Numer Algor. 2010;54:533–569. doi: 10.1007/s11075-009-9353-5
  • Doha EH, Bhrawy AH, Hafez RM. A Jacobi-Jacobi dual-Petrov-Galerkin method for third- and fifth-order differential equations. Math Comput Model. 2011;53:1820–1832. doi: 10.1016/j.mcm.2011.01.002
  • Gheorghiu CI. Spectral methods for differential problems. Cluj-Napoca, Romaina: “T. Popoviciu”, Institute of Numerical Analysis; 2007.
  • Doha EH, Bhrawy AH. Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials. Appl Numer Math. 2008;58:1224–1244. doi: 10.1016/j.apnum.2007.07.001
  • Doha EH, Bhrawy AH, Abd-Elhameed WM. Jacobi spectral Galerkin method for elliptic Neumann problems. Numer Algorithms. 2009;50:67–91. doi: 10.1007/s11075-008-9216-5
  • Doha EH, Bhrawy AH. An efficient direct solver for multidimensional elliptic Robin boundary value problems using a Legendre spectral-Galerkin method. Comput Math Appl. 2012. 64:558–517 doi:10.1016/j.camwa.2011.12.050.
  • Luke Y. The special functions and their approximations, 2 New York (NY): Academic Press; 1969.
  • Luke Y. Mathematical functions and their approximations. New York (NY): Academic Press; 1975.
  • Szegö G. Orthogonal polynomials. Amer Math Soc Colloq Pub. 1985;23:1–440.
  • Doha EH, Bhrawy AH. Efficient spectral-Galerkin algorithms for direct solution for second-order differential equations using Jacobi polynomials. Numer Algorithms. 2006;42:137–164. doi: 10.1007/s11075-006-9034-6
  • Auteri F, Quartapelle L. Galerkin spectral method for the vorticity and stream function equations. J Comput Phys. 1999;149:306–332. doi: 10.1006/jcph.1998.6155