The sinc-Galerkin method and its applications on singular Dirichlet-type boundary value problems

The application of the sinc-Galerkin method to an approximate solution of second-order singular Dirichlet-type boundary value problems were discussed in this study. The method is based on approximating functions and their derivatives by using the Whittaker cardinal function. The differential equation is reduced to a system of algebraic equations via new accurate explicit approximations of the inner products without any numerical integration which is needed to solve matrix system. This study shows that the sinc-Galerkin method is a very effective and powerful tool in solving such problems numerically. At the end of the paper, the method was tested on several examples with second-order Dirichlet-type boundary value problems.

Sinc methods were introduced by Frank Stenger in [1] and expanded upon by him in [2]. Sinc functions were first analyzed in [3] and [4]. An extensive research of sinc methods for two-point boundary value problems can be found in [5, 6]. In [7, 8], parabolic and hyperbolic problems were discussed in detail. Some kind of singular elliptic problems were solved in [9], and the symmetric sinc-Galerkin method was introduced in [10]. Sinc domain decomposition was presented in [11–13] and [14]. Iterative methods for symmetric sinc-Galerkin systems were discussed in [15, 16] and [17]. Sinc methods were discussed thoroughly in [18]. Applications of sinc methods can also be found in [19, 20] and [21]. The article [22] summarizes the results obtained to date on sinc numerical methods of computation. In [14], a numerical solution of a Volterra integro-differential equation by means of the sinc collocation method was considered. The paper [2] illustrates the application of a sinc-Galerkin method to an approximate solution of linear and nonlinear second-order ordinary differential equations, and to an approximate solution of some linear elliptic and parabolic partial differential equations in the plane. The fully sinc-Galerkin method was developed for a family of complex-valued partial differential equations with time-dependent boundary conditions [19]. Some novel procedures of using sinc methods to compute solutions to three types of medical problems were illustrated in [23], and sinc-based algorithm was used to solve a nonlinear set of partial differential equations in [24]. A new sinc-Galerkin method was developed for approximating the solution of convection diffusion equations with mixed boundary conditions on half-infinite intervals in [25]. The work which was presented in [26] deals with the sinc-Galerkin method for solving nonlinear fourth-order differential equations with homogeneous and nonhomogeneous boundary conditions. In [27], sinc methods were used to solve second-order ordinary differential equations with homogeneous Dirichlet-type boundary conditions.

Let C denote the set of all complex numbers, and for all z\in C, define the sine cardinal or sinc function by

For h>0, the translated sinc function with evenly spaced nodes is given by

For various values of k, the sinc basis function S(k,\pi /4)(x) on the whole real line is illustrated in Figure 1. For various values of h, the central function S(0,h)(x) is illustrated in Figure 2.

The basis functions \mathit{S}\mathbf{(}\mathit{k}\mathbf{,}\mathit{h}\mathbf{)}\mathbf{(}\mathit{x}\mathbf{)} for \mathit{k}\mathbf{=}\mathbf{-}\mathbf{1}\mathbf{,}\mathbf{0}\mathbf{,}\mathbf{1} with \mathit{h}\mathbf{=}\mathit{\pi }\mathbf{/}\mathbf{4} .

Full size image

Central sinc basis function \mathit{S}\mathbf{(}\mathbf{0}\mathbf{,}\mathit{h}\mathbf{)}\mathbf{(}\mathit{x}\mathbf{)} for \mathit{h}\mathbf{=}\mathit{\pi }\mathbf{/}\mathbf{2}\mathbf{,}\mathit{\pi }\mathbf{/}\mathbf{4}\mathbf{,}\mathit{\pi }\mathbf{/}\mathbf{8} .

Full size image

If a function f(x) is defined over the real line, then for h>0, the series

is called the Whittaker cardinal expansion of f whenever this series converges. The infinite strip D_s of the complex w plane, where d>0, is given by

In general, approximations can be constructed for infinite, semi-infinite and finite intervals. Define the function

which is a conformal mapping from D_E, the eye-shaped domain in the z-plane, onto the infinite strip D_S, where

This is shown in Figure 3.

The relationship between the eye-shaped domain {\mathit{D}}_{\mathit{E}} and the infinite strip {\mathit{D}}_{\mathit{S}} .

Full size image

For the sinc-Galerkin method, the basis functions are derived from the composite translated sinc functions

for z\in D_E. These are shown in Figure 4 for real values x. The function z={\varphi }^{-1}(w)=\frac{e^w}{1+e^w} is an inverse mapping of w=\varphi (z). We may define the range of {\varphi }^{-1} on the real line as

the evenly spaced nodes {\{kh\}}_{k=-\mathrm{\infty }}^{\mathrm{\infty }} on the real line. The image which corresponds to these nodes is denoted by

A list of conformal mappings may be found in Table 1 [6].

Three adjacent members \mathit{S}\mathbf{(}\mathit{k}\mathbf{,}\mathit{h}\mathbf{)}\mathbf{\circ }\mathit{\varphi }\mathbf{(}\mathit{x}\mathbf{)} when \mathit{k}\mathbf{=}\mathbf{-}\mathbf{1}\mathbf{,}\mathbf{0}\mathbf{,}\mathbf{1} and \mathit{h}\mathbf{=}\frac{\mathit{\pi }}{\mathbf{8}} of the mapped sinc basis on the interval \mathbf{(}\mathbf{0}\mathbf{,}\mathbf{1}\mathbf{)} .

Full size image

Definition 2.1 Let D_E be a simply connected domain in the complex plane C, and let \partial D_E denote the boundary of D_E. Let a, b be points on \partial D_E and ϕ be a conformal map D_E onto D_S such that \varphi (a)=-\mathrm{\infty } and \varphi (b)=-\mathrm{\infty }. If the inverse map of ϕ is denoted by φ, define

and z_k=\phi (kh), k=\mp 1,\mp 2,\dots .

Definition 2.2 Let B(D_E) be the class of functions F that are analytic in D_E and satisfy

where

and those on the boundary of D_E satisfy

The proof of following theorems can be found in [2].

Theorem 2.1 Let Γ be (0,1), F\in B(D_E), then for h>0 sufficiently small,

where

For the sinc-Galerkin method, the infinite quadrature rule must be truncated to a finite sum. The following theorem indicates the conditions under which an exponential convergence results.

Theorem 2.2 If there exist positive constants α, β and C such that

then the error bound for the quadrature rule (2.14) is

The infinite sum in (2.14) is truncated with the use of (2.16) to arrive at the inequality (2.17). Making the selections

(2.18)

(2.19)

where 〚\cdot 〛 is an integer part of the statement and N is the integer value which specifies the grid size, then

We used Theorems 2.1 and 2.2 to approximate the integrals that arise in the formulation of the discrete systems corresponding to a second-order boundary value problem.

Theorem 2.3 Let ϕ be a conformal one-to-one map of the simply connected domain D_E onto D_S. Then

(2.21)

(2.22)

(2.23)

Consider the following problem:

with Dirichlet-type boundary condition

where P, Q and F are analytic on D. We consider sinc approximation by the formula

(3.3)

(3.4)

The unknown coefficients c_k in Eq. (3.3) are determined by orthogonalizing the residual with respect to the sinc basis functions. The Galerkin method enables us to determine the c_k coefficients by solving the linear system of equations

Let f_1 and f_2 be analytic functions on D and the inner product in (3.5) be defined as follows:

where w is the weight function. For the second-order problems, it is convenient to take [2].

For Eq. (3.1), we use the notations (2.21)-(2.23) together with the inner product that, given (3.5) [2], showed to get the following approximation formulas:

(3.8)

(3.9)

(3.10)

(3.11)

where w_k=w(x_k). If we choose h={(\pi d/\alpha N)}^{1/2} and w(x)=1/{\varphi }^{\prime }(x) as given in [2] the accuracy for each equation between (3.8)-(3.11) will be O(N^{1/2}{e}^{-{(\pi d\alpha N)}^{1/2}}).

Using (3.5), (3.8)-(3.11), we obtain a linear system of equations for 2N+1 numbers c_k.

The 2N+1 linear system given in (3.5) can be expressed by means of matrices. Let m=2N+1, and let S_m and c_m be a column vector defined by

Let A_m(y) denote a diagonal matrix whose diagonal elements are y(x_{-N}),y(x_{-N+1}),\dots ,y(x_N) and non-diagonal elements are zero, and also let I_m^{(0)}, I_m^{(1)} and I_m^{(2)} denote the matrices

(3.13)

(3.14)

(3.15)

With these notations, the discrete system of equations in (3.5) takes the form:

(3.16)

Theorem 3.1 Let c be an m-vector whose jth component is c_j. Then the system (3.16) yields the following matrix system, the dimensions of which are (2N+1)\times (2N+1):

Now we have a linear system of (2N+1) equations of the (2N+1) unknown coefficients. If we solve (3.17) by using LU or QR decomposition methods, we can obtain c_j coefficients for the approximate sinc-Galerkin solution

Three examples were given in order to illustrate the performance of the sinc-Galerkin method to solve a singular Dirichlet-type boundary value problem in this section. The discrete sinc system defined by (3.18) was used to compute the coefficients c_j; j=-N,\dots ,N for each example. All of the computations were done by an algorithm which we have developed for the sinc-Galerkin method. The algorithm automatically compares the sinc-method with the exact solutions. It is shown in Tables 2-4 and Figures 5-7 that the sinc-Galerkin method is a very efficient and powerful tool to solve singular Dirichlet-type boundary value problems.

Approximation to the exact solution: the red colored curve displays the exact solution and the green one is the approximate solution of Eq. ( 4.1 ).

Full size image

Approximation to the exact solution: the red colored curve displays the exact solution and the green one is the approximate solution of Eq. ( 4.2 ).

Full size image

Approximation to the exact solution: the red colored curve displays the exact solution and the green one is the approximate solution of Eq. ( 4.3 ).

Full size image

Example 4.1 Consider the following singular Dirichlet-type boundary value problem on the interval [0,1]:

The exact solution of (4.1) is

We choose the weight function according to [2], \varphi (x)=ln(\frac{1}{1-x}), w(x)=\frac{1}{{\varphi }^{\prime }(x)}, and by taking d=\pi /2, h=\frac{2}{\sqrt{N}}, x_k=\frac{e^{kh}}{1+e^{kh}} for N=8,16,32,100, the solutions inFigure 5 and Table 2 are achieved.

Example 4.2 Let us have the following form of a singular Dirichlet-type boundary value problem on the interval [0,1]:

The problem has an exact solution like

where \varphi (x)=ln(\frac{1}{1-x}), w(x)=\frac{1}{{\varphi }^{\prime }(x)}.By taking d=\pi /2, h=\frac{2}{\sqrt{N}}, x_k=\frac{e^{kh}}{1+e^{kh}} for N=8,16,32,100,we get the solutions in Figure 6 and Table 3.

Example 4.3 The following problem is given on the interval [-1,4]:

where the exact solution of (4.3) is y(x)=\frac{x^2{\mathrm{e}}^4-x^2{\mathrm{e}}^{-1}+15{\mathrm{e}}^x-6x{\mathrm{e}}^4+6x{\mathrm{e}}^{-1}-7{\mathrm{e}}^4-8{\mathrm{e}}^{-1}}{{\mathrm{2}(\mathrm{e}}^4-{\mathrm{e}}^{-1})}.

In this case, \varphi (x)=ln(\frac{x+1}{4-x}), w(x)=\frac{1}{{\varphi }^{\prime }(x)}, and by taking d=\pi /2, h=\frac{2}{\sqrt{N}}, x_k=\frac{-1+4e^{kh}}{1+e^{kh}} for N=8,16,32,100, we get results in Figure 7 and Table 4 .

The sinc-Galerkin method was employed to find the solutions of second-order Dirichlet-type boundary value problems on some closed real interval. The main purpose was to find the solution of boundary value problems which arise from the singular problems. The examples show that the accuracy improves with increasing number of sinc grid points N. We have also developed a very efficient and rapid algorithm to solve second-order Dirichlet-type BVPs with the sinc-Galerkin method on the Maple computer algebra system. All of the above computations and graphical representations were prepared by using Maple.

We give the Maple code in the Appendix section.

Affiliations

1. Department of Mathematical Engineering, Faculty of Chemical and Metallurgical Engineering, Yildiz Technical University, Davutpasa, İstanbul, 34210, Turkey

   • Aydin Secer

2. Department of Mathematics, Faculty of Art and Sciences, Yildiz Technical University, Davutpasa, İstanbul, 34210, Turkey

   • Muhammet Kurulay

Corresponding author

Correspondence to Aydin Secer.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

AS proposed main idea of the solution schema by using Sinc Method for linear BVPs. He developed computer algorithm and worked on theoretical aspect of problem. MK searched the materials about study and compared with other techniques, contributed with his experience on Nonlinear Approximation methods.

Reprints and Permissions