An efficient computer application of the sinc-Galerkin approximation for nonlinear boundary value problems

where NL is the nonlinear part of Eq. (1.1) which can take any form of nonlinearity, and we investigate the approximate solution on some closed interval $[a,b]$ in R.

We start by casting a given linear or nonlinear BVP into a sinc-Galerkin form accurate to the order $O(N^{1/2}{e}^{-{(\pi d\alpha N)}^{1/2}})$ [1]. This discretization yields a set of linear or nonlinear algebraic equations that include all unknown coefficients. These equations are expressed in a nonlinear or linear matrix form depending on (1.1). If the equation is linear, the LU decomposition method can be used to find unknown coefficients. However, if it is not linear, the coefficients can be found by the Newton interpolation method for nonlinear equation systems by using Maple. The methodology is illustrated on nonlinear ordinary differential equations with Dirichlet-type boundaries. Once the solution is obtained, we compare its accuracy with the Newton method as a graphical and numerical simulation by using Maple.

We start with some literature on the sinc-Galerkin methods. The sinc methods were introduced in [2] and expanded in [1] by Frank Stenger. 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 are discussed in detail. Some kind of singular elliptic problems are solved in [9], and the symmetric sinc-Galerkin method is introduced in [10]. The sinc domain decomposition is presented in [11–14]. Also, iterative methods for symmetric sinc-Galerkin systems are given in [15–17]. Sinc methods are studied thoroughly in [18]. Applications of sinc methods can also be found in [19–21]. The article [22] summarizes the results that are obtained by sinc numerical methods of computation. In [14] a numerical solution of the Volterra integro-differential equation by means of the sinc collocation method is considered. The paper [1] illustrates the application of a sinc-Galerkin method to the approximate solution of linear and nonlinear second-order ordinary differential equations and to the approximate solution of some linear elliptic and parabolic partial differential equations in the plane. The fully sinc-Galerkin method is developed for a family of complex-valued partial differential equations with time-dependent boundary conditions [19]. In [23] some novel procedures of using sinc methods to compute the solutions of three types of medical problems are illustrated. In [24], the sinc-based algorithm is used to solve a nonlinear set of partial differential equations. A new sinc-Galerkin method is developed for approximating the solution of convection diffusion equations with mixed boundary conditions on half-infinite intervals in [25]. The work which is presented in [26] deals with the sinc-Galerkin method for solving nonlinear fourth-order differential equations with homogeneous and nonhomogeneous boundary conditions. In [27], the sinc methods are used to solve second-order ordinary differential equations with homogeneous Dirichlet-type boundary conditions. In the paper given in [28], the sinc-Galerkin method is applied to solving Troesch’s problem. The properties of the sinc procedure are utilized to reduce the computation of Troesch’s equation to nonlinear equations with unknown coefficients.

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

This is shown in Figure 3.

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

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

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

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.

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

Making the selections

(2.18)

(2.19)

We used Theorems 2.1 and 2.2 to approximate the integrals that arise in the formulation of the discrete systems corresponding to the 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)

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

(3.3)

(3.4)

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

(3.8)

(3.9)

(3.10)

(3.11)

where $w_k=w(x_k)$ etc. The choices $h={(\pi d/\alpha N)}^{1/2}$ and $w(x)=1/{\varphi }^{\prime }(x)$ yield $O(N^{1/2}{e}^{-{(\pi d\alpha N)}^{1/2}})$ [1] accuracy for each of the approximations in (3.8)-(3.11).

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

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 in (3.5) takes the form:

(3.16)

In this section, three examples are given to illustrate the performance of the sinc-Galerkin method by solving nonlinear Dirichlet-type boundary value problems. Each of these problems have been chosen to simulate how the solutions change in different zero boundary intervals. In the following examples, the discrete sinc system defined by (3.18) is used to compute the coefficients $c_j$; $j=-N,\dots ,N$. The computations are done by the algorithm which we developed for sinc-Galerkin method by using Maple. The algorithm automatically compares the sinc-method to the Newton method. The following examples show that the sinc-Galerkin method is a very efficient and powerful tool for nonlinear Dirichlet-type boundary value problems.

We choose the weight function according to [1], $\varphi (x)=ln(\frac{x+1}{1-x})$, $w(x)=\frac{1}{{\varphi }^{\prime }(x)}$ and by taking $d=\pi /2$, $h=\frac{2}{\sqrt{N}}$, $x_k=\frac{-1+e^{kh}}{1+e^{kh}}$ for $N=2,4,8,48$, the solutions presented in Figure 5 and Table 2.

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

where we chose $\varphi (x)=ln(\frac{x-4}{5-x})$, $w(x)=\frac{1}{{\varphi }^{\prime }(x)}$ and by taking $d=\pi /2$, $h=\frac{2}{\sqrt{N}}$ , $x_k=\frac{4+5e^{kh}}{1+e^{kh}}$ for $N=16,24,32,48$ we get the results presented in Figure 7 and Table 4.

A new efficient computer application of sinc-Galerkin method has been presented for nonlinear BVPs. The main advantage of our technique compared to other methods (e.g., Newton’s method) is that the solution is independent of the singularity conditions and valid for Dirichlet-type boundary conditions. The order of accuracy used in this paper is $O(N^{1/2}{e}^{-{(\pi d\alpha N)}^{1/2}})$. We have used different N node points for all figures presented in this paper. Even though the numerical solution looks complex for even $N>30$ node points, Maple handles it very well. In the Appendix, a useful Maple program is given to explain the technique and to show how the same solution can be used for different boundary conditions. By using the same program, substituting N and other parameters (like equations, boundaries), different solutions and graphics can be produced. The total time taken on a 3.5 GHz Pentium I7 processor with 8 Core and 8 GB RAM for producing figures and numerical results is less than 20 seconds.

In this study, the sinc-Galerkin method has been employed to find the solutions of second-order nonlinear Dirichlet-type boundary value problems on some closed real interval and the method has been compared to the Newton method. Our main purpose is to find the solution of boundary value problems which arise from the singular problems for which the Newton method does not converge at singular points. The powerful side of our method is that it can easily compute solutions even if the equation has singularities. The Newton method can fail when computing some complicated forms of governing equations; on the other hand, our method can easily handle this situation. The examples show that the accuracy improves by increasing the number of sinc grid points N. The method presented here is simple and gives a numerical solution, which is valid for various boundary conditions. We have developed a very efficient algorithm to solve second-order nonlinear Dirichlet-type boundary value problems with sinc-Galerkin method in Maple Computer Algebra System. Several nonlinear BVPs have been solved by using our technique in less than 20 seconds. All computations and graphical representations have been prepared automatically by our algorithm.

We demonstrate below how to solve and simulate for a nonlinear BVP. For example, the following Maple code computes and simulates Example 4.3.

Set all parameters as default values

> restart:

For drawing approximation graphics, we must type the following line

> with(plots):

A user has to specify with (linalg) for linear algebra operations in Maple

> with(linalg):

A user can define the grid point size N for sinc-Galerkin approximation

> N:=48:

The boundary conditions are given as Eq. (4.3).

> a:=4:

> b:=5:

P, Q and R are the variable coefficients of Eq. (1.1). In Maple for Eq. (4.3) they are defined as follows:

F is right side of Eq. (4.3)

We can write a nonlinear part of Eq. (1.1) as follows. User can define any form of nonlinearity in this section.

The main form of Eq. (1.1)

If the user needs, the main equation can be written in the latex format

In order to compare our method with the Newton interpolation (for nonlinear ODE) method, we first solve Eq. (4.3) numerically as follows:

Prepare the plot of the Newton solution

> PlotNewtonSolution:=odeplot(NewtonSolution,a....b):

To define $I_m^{(0)}=[{\delta }_{jk}^{(0)}]$, $I_m^{(1)}=[{\delta }_{jk}^{(1)}]$ and $I_m^{(2)}=[{\delta }_{jk}^{(2)}]$ matrices given in Eqs. (3.13)-(3.15), we use piecewise functions in Maple in the following way:

> delta[0]:=unapply(piecewise(j=k,1,j<>k,0),j,k):

> delta[1]:=unapply(piecewise(j=k,0,j<>k,((-1)^(k-j))/(k-j)),j,k):

> delta[2]:=unapply(piecewise(j=k,(-Pi^2)/3,j<>k,-2*(-1)^(k-j)/(k-j)^2),j,k):

The parameters for sinc-approximation given [1]

> d:=Pi/2:

> h:=2/sqrt(N):

The evenly spaced nodes given (2.9) and Table 1 are defined as follows:

The conformal map in Table 1 for sinc-Galerkin method and its derivatives is computed as follows:

> Dphi:=unapply(simplify(diff(phi(x),x)),x):

> D2phi:=unapply(simplify(diff(phi(x),x$2)),x):

The weight function and its derivatives are computed for using an inner product to discretization Eq. (4.3)

> w:=unapply(1/Dphi(x),x):

> Dw:=unapply(simplify(diff(w(x),x$1)),x):

> D2w:=unapply(simplify(diff(w(x),x$2)),x):

By using sinc-discretization in (3.16), the matrix system with $(2N+1)\times (2N+1)$ dimensions defined in (3.17) is obtained by the following iteration:

If we want to obtain solutions of linear BVPs, we can use the following lines. They can reduce time complexity. Here, the linear solution is given as a comment (“#”).

> #for Linear system

> #vars:=seq(c[i],i=-N..N):

> #A,b:=LinearAlgebra[GenerateMatrix](evalf(MatrixSystem),[vars]):

> #c:=linsolve(A,b);

In this paper, we want to solve nonlinear problems. Then we use fsolve function given by Maple to find unknown $c_j$ coefficients (3.17)-(3.18) from nonlinear matrix systems. This function can solve any nonlinear systems by using the Newton method (for nonlinear equation systems).

> c:=fsolve(evalf(MatrixSystem)):

Finally, we have unknown $c_j$ coefficients for the approximate sinc-Galerkin solution (3.18)

We define plot of Eq. (4.3) obtained by the sinc-Galerkin solution

> Sinc-GalerkinPlot:=plot({ApproximateSol(x)},x=a..b,color=green,thickness=1):

Simulation: Figure 5, Figure 6, and Figure 7 are obtained as

Enter the number of digits here

> Digits := 15:

Tables 2, 3, and 4 are obtained by the following code: