Efficient BTCS + CTCS Finite Difference Scheme for General Linear Second Order PDE

This work deals with a second order linear general equation with partial de-rivatives for a two-variable function. It covers a wide range of applications. This equation is solved with a finite difference hybrid method: BTCS + CTCS. This scheme is simple, precise, and economical in terms of time and space occupancy in memory.


Introduction
We are interested in the following second order linear Partial Differential Equation (PDE): where Φ designates an scalar function depending on the variables x and t. Usually x states for the space variable and t for the time. The Equation (1) can be brought in the following form: The resolution of such an equation presents a great interest, because it governs several phenomenas in physics, chemistry, mathematics, economy, etc. [1]. It is a general form that deals with:  [7]. We propose to solve this equation with a simple, accurate and efficient method, by reducing the costs in time, memory space, and method's heaviness. We aim at a good compromise between simplicity and result accuracy.
So, we will first, formulate the problem. Then, we choose a hybrid approximation scheme, using two finite differences approaches: Backward Time Centered Space (BTCS) and Centered Time Centered Space (CTCS) [8] [9] [10]. This heterogeneous scheme has the advantages of both. The first method BTCS is implicit and the second one is explicit. With their superposition, the resulting method becomes implicit. Therefore, we will use different methods for processing the matrices that result from the discretization. These methods are the algorithm of Usmani [11], which inverts any regular tridiagonal matrix directly; and the algorithm of Thomas which inverts a diagonal dominant tridiagonal matrix using the Right Hand Side (RHS) of the equation.
Subsequently, we will treat numerical experimentation to validate our proposed method. Finally, we discuss the results and give outlook for further work.

Problem Formulation and Meshing
We consider a scalar function ( ) which depends on the real variables x and t. This function satisfies the partial differential Equation (3) with the given conditions.
Here, The coefficients A, B, C, D, E and F are constant or known functions depending on the variables x and t. L is a real constant. The function lem. An approximated value of Φ is to be found at point ( )

Schema BTCS + CTCS
We consider the Finite Difference method in Time Domain (FDTD); more precisely the two schemes: BTCS and CTCS [8] [9] [10]. Then, we superpose the two approaches in order to obtain a better approximation of the solution of the treated differential equation. In this way we combine the advantages of the two schemes. As one can remark, these two schemes have the same spatial discretization (Centered Space CS). Thus, we have for the derivative in x direction the following approximations: For the BTCS scheme, we get the first and second order backward time derivatives, for 0 n t > : Combining the Equations (3)-(5), one gets: With the CTCS scheme, we have the following first and second order derivatives, for 0 n t > : , 1, 2, 3, , .
Associating the Equations (3), (4), and (7); one gets: This previous equation is equivalent to: Journal of Electromagnetic Analysis and Applications So, we will discuss the inversion methods of the matrix ( ) n A , which permits to get the solution n Φ .

General Solution
An important discussion is to be done with respect to Equation (9) Of course, this property is sufficient but not necessary for the regularity.
We prefer an inversion with the Usmani's algorithm [11], which is a general and stable method. It allows a direct inversion that does not use the right hand side ( n H ) in the inversion process; contrarily to the algorithm of Thomas. Usmani has presented a direct and exact method to invert a tridiagonal regular matrix [11].
We can apply it for ( ) n A , defining: We get the solution:

Solution for Time-Depending Coefficients
In the case that the coefficients of Equation (1) do not dependent on the space:

( )
( ) ( ) can be simplified [12] [13] [14]: Defining a real number ∆ and a complex number θ in following manner: , which is the determinant of the submatrix of order i of (A); and which is of dimension ( i i × The inverted matrix (B) exists when d is different of one of the following values [14]:

Numerical Verification
For the numerical verification, we choose the equation of telegraph equation, which has been treated by several authors [4] [5] [6] [7]. We compare our results with those obtained by [4].
The following problem treated by [4] was considered and our method was applied: , 0 sin , , 0 sin , 0, The results are very satisfactory because our method is not heavy and leads to a precise solution. Compared to the one used in [4], it could be said to be less precise. But it should be emphasized that the method, used in [4], is a Cubic B-splines collocation method, which is expensive in calculation. On the other hand, we used the finite difference method.

Conclusions
In this work, a method of solving a general linear partial differential equation has been presented. The finite difference hybrid approach (BTCS + FTCS) that has been used is simple, accurate and efficient; and is economical in terms of calculation and occupancy of the memory space.
This study can allow numerous applications of this method to several phenomena of the sciences and techniques governed by this equation. In addition, other methods could be explored to improve performance.