In this paper, a new Fourier-differential transform method (FDTM) based on differential transformation method (DTM) is proposed. The method can effectively and quickly solve linear and nonlinear partial differential equations with initial boundary value (IBVP). According to boundary condition, the initial condition is expanded into a Fourier series. After that, the IBVP is transformed to an iterative relation in K-domain. The series solution or exact solution can be obtained. The rationality and practicability of the algorithm FDTM are verified by comparisons of the results obtained by FDTM and the existing analytical solutions.
The differential transform method (DTM) is a powerful approximate analytic method for solving linear and nonlinear differential equations. Thus it provides widely applicable technique to construct an analytical solution of differential equations in a polynomial form. Since the basic idea of the DTM was introduced by Pukhov [
Although being powerful, there still exist some difficulties in solving system of differential equations with initial and boundary condition(s) by the DTM. In fact, one may note that much of the research on the method is to solve the linear and nonlinear ODE with or without initial or boundary condition(s) [
The aim of this paper is to extend the differential transformation method to solve partial differential equation system with initial and three typical zero boundary conditions. According to the characteristics of boundary conditions, the initial function is respectively expanded into corresponding Fourier series. The method based on the iteration procedure of DTM and Fourier expansion technology is called Fourier-differential transform method (FDTM). The method can be used to evaluate the approximating solution by the finite Taylor series and by an iteration procedure described by the transformed equations obtained from the original equation using the operations of differential transformation.
The definitions and operations of one-dimensional differential transform method (DTM) are introduced in [
The differential transform of the kth differentiable function u ( x ) at x = 0 is defined by
U ( k ) = 1 k ! ∂ k u ( x ) ∂ x k | x = 0 (1)
where u ( x ) is the original function and U ( k ) is the transformed function. The corresponding inverse transform is defined by
u ( x ) = ∑ k = 0 ∞ U ( k ) x k (2)
Substituting Equation (2) into Equation (1), it can be obtained as
u ( x ) = ∑ k = 0 ∞ 1 k ! ∂ k u ( x ) ∂ x k | x = 0 x k (3)
Using the differential transform, a differential equation in the domain of interest can be transformed to be an algebraic equation in the K-domain and u ( x ) can be obtained by finite-term Taylor series plus a remainder,
u ( x ) = ∑ k = 0 n 1 k ! ∂ k u ( x ) ∂ x k | x = 0 x k + R n + 1 ( x ) (4)
Some of the fundamental mathematical operations performed by one-dimensional differential transform can be obtained in
Consider a function of two variables u ( x , t ) : R × R → R , based on the properties of one-dimensional DTM, if u ( x , t ) is analytic and continuously differentiable with respect to variables in the domain of interest, the two-dimensional transform at ( 0 , 0 ) are given as follows [
U ( i , j ) = 1 i ! j ! ∂ i + j u ( x , t ) ∂ x i ∂ t j | ( 0 , 0 ) (5)
The spectrum function U ( i , j ) is the transformed function, which is also called the T-function. The function u ( x , t ) is the original function. The differential inverse transform of U ( i , j ) is defined as follows.
u ( x , t ) = ∑ i = 0 ∞ ∑ j = 0 ∞ U ( i , j ) x i t j (6)
Substituting Equation (6) into Equation (5), it can be obtained as
u ( x , t ) = ∑ i = 0 ∞ ∑ j = 0 ∞ 1 i ! j ! ∂ i + j u ( x , t ) ∂ x i ∂ t j | ( 0 , 0 ) x i t j (7)
Unlike the traditional high-order Taylor series method which requires complicated symbolic computations, with this method, the given equation and related conditions are transformed into a recurrence relation, through which one can easily obtain the coefficients of a Taylor series solution.
The main advantage of the DTM is that it provides an explicit and numerical solution with minimal calculations. Another important advantage is that this method can be applied directly to nonlinear problems without linearization, discretization or perturbation. Some of the fundamental mathematical operations performed by two-dimensional differential transform can be obtained in
| Original function | Transformed function |
|---|---|
| u ( x ) = u 1 ( x ) ± u 2 ( x ) | U ( k ) = U 1 ( k ) ± U 2 ( k ) |
| u ( x ) = c v ( x ) | U ( k ) = c V ( k ) |
| u ( x ) = u 1 ( x ) u 2 ( x ) | U ( k ) = ∑ m = 0 k U 1 ( m ) U 2 ( k − m ) |
| u ( x ) = ∂ k v ( x ) ∂ x k | U ( k ) = ( k + m ) ! k ! V ( k + m ) |
| Original function | Transformed function |
|---|---|
| u ( x , t ) = u 1 ( x , t ) ± u 2 ( x , t ) | U ( i , j ) = U 1 ( i , j ) ± U 2 ( i , j ) |
| u ( x , t ) = c v ( x , t ) | U ( i , j ) = c V ( i , j ) |
| u ( x , t ) = u 1 ( x , t ) u 2 ( x , t ) | U ( i , j ) = ∑ i = 0 m ∑ j = 0 n U 1 ( i , n − j ) U 2 ( m − i , j ) |
| u ( x , t ) = ∂ v ( x , t ) ∂ t | U ( i , j ) = ( j + 1 ) V ( i , j + 1 ) |
| u ( x , t ) = ∂ k v ( x , t ) ∂ x k | U ( i , j ) = ( i + k ) ! k ! V ( i + k , j ) |
| u ( x , t ) = ∂ k v ( x , t ) ∂ t k | U ( i , j ) = ( j + k ) ! k ! V ( i , j + k ) |
Many engineering phenomenon are mathematically modeled by categorizing them in the initial boundary value problems (IBVPs). In this study, an efficient algorithm based upon the differential transform method (DTM) is considered to solve the system of partial differential equations with initial and zero boundary conditions. In order to illustrate the algorithm, a more general form of equations at x ∈ [ a , b ] , a , b ∈ R and t ∈ [ 0 , ∞ ] is expressed as
L t ( u ( x , t ) ) + L x ( u , v ) + N 1 ( u , v ) = 0 (8)
L t ( v ( x , t ) ) + L x ( u , v ) + N 2 ( u , v ) = 0 (9)
with initial conditions
u ( x , 0 ) = f ( x ) , a < x < b (10)
v ( x , 0 ) = g ( x ) , a < x < b (11)
and zero Dirichlet boundary conditions
u ( a , t ) = u ( b , t ) = 0 , t > 0 (12)
v ( a , t ) = v ( b , t ) = 0 , t > 0 (13)
or zero Neumann boundary conditions
∂ u ∂ x | x = a = ∂ u ∂ x | x = b = 0 , t > 0 (14)
∂ v ∂ x | x = a = ∂ v ∂ x | x = b = 0 , t > 0 (15)
or zero mixed boundary conditions
u ( a , t ) = ∂ u ∂ x | x = b = 0 , t > 0 (16)
v ( a , t ) = ∂ v ∂ x | x = b = 0 , t > 0 (17)
where, L is liner differential operators, N is nonliner differential operators, the vector of main unknown functions, x is spatial variable and t is time.
On the basis of the DTM, we shall introduce an effective algorithm to obtain the approximate solution of Equation (8) under the initial conditions Equation (9) and the boundary conditions Equations (12)-(17). The main steps of the algorithm are:
Step 1, Appling the differential transformation in Equation (8), and an iterative formula is obtained.
F ( U ( i , j ) , V ( i , j ) ) = 0 (18)
G ( U ( i , j ) , V ( i , j ) ) = 0 (19)
where, i , j = 0 , 1 , 2 , ⋯ , N − n .
Step 2, Duce U ( i , j ) and V ( i , j ) ( i , j = n , n + 1 , ⋯ , N ). According to the characteristics of boundary conditions, the initial function is respectively expanded into corresponding Fourier series [
Step 3, Imposing the truncated series solution obtained in Step 2 on the initial and boundary conditions, a linear or nonlinear algebraic equations system can be obtained by
g 1 ( U ( i , j ) , V ( i , j ) ) = 0 ⋮ g n ( U ( i , j ) , V ( i , j ) ) = 0 (20)
where, i , j = 0 , 1 , 2 , ⋯ , n − 1 .
Step 4, Solve system in Step3 to determine U ( i , j ) and V ( i , j ) , and substitute the result into the truncated series solution obtained in Step 3 to obtain the final result.
| Boundary conditions | The corresponding Fourier series of initial function | Coefficient value |
|---|---|---|
| zero Dirichlet boundary conditions | f ( x ) = ∑ n = 0 ∞ A n sin ( n π ( x − a ) b − a ) g ( x ) = ∑ n = 0 ∞ A ˜ n sin ( n π ( x − a ) b − a ) | A n = 2 b − a ∫ 0 b − a f ( x ) sin ( n π ( x − a ) b − a ) d x A ˜ n = 2 b − a ∫ 0 b − a g ( x ) sin ( n π ( x − a ) b − a ) d x |
| zero Neumann boundary conditions | f ( x ) = B 0 + ∑ n = 1 ∞ B n cos ( n π ( x − a ) b − a ) g ( x ) = B ˜ 0 + ∑ n = 1 ∞ B ˜ n cos ( n π ( x − a ) b − a ) | B n = 2 b − a ∫ 0 b − a f ( x ) cos ( n π ( x − a ) b − a ) d x B ˜ n = 2 b − a ∫ 0 b − a g ( x ) cos ( n π ( x − a ) b − a ) d x |
| zero mixed boundary conditions | f ( x ) = ∑ n = 0 ∞ C n sin ( ( n + 1 / 2 ) π ( x − a ) b − a ) g ( x ) = ∑ n = 0 ∞ C ˜ n sin ( ( n + 1 / 2 ) π ( x − a ) 2 ( b − a ) ) | C n = 2 b − a ∫ 0 b − a f ( x ) sin ( ( n + 1 / 2 ) π ( x − a ) b − a ) d x C ˜ n = 2 b − a ∫ 0 b − a g ( x ) sin ( ( n + 1 / 2 ) π ( x − a ) b − a ) d x |
In order to verify the effectiveness of the above method, three typical initial boundary value problems are solved. It should be noted that the following examples only serve as illustrations and the more complex problems can be tackled by the proposed technique, e.g. higher-ordered ODEs, PDEs (system) or other functional equations involving nonlinear terms with zero boundary conditions.
Example 1. The linear heat equation was first considered at x ∈ [ 0 , 1 ] and t ∈ [ 0 , ∞ ] [
u t = α u x x (21)
with the initial data
u ( x , 0 ) = 1 , x ∈ ( 0 , 1 ) (22)
and subject to the boundary conditions
u ( 0 , t ) = 0 , t > 0 (23)
u ( 1 , t ) = 0 , t > 0 (24)
where, α > 0 is constant.
Based on the FDTM, we have ones
U ( i , j + 1 ) = α ( i + 1 ) ( i + 2 ) j + 1 U ( i + 2 , j ) (25)
For the initial condition, it can be obtained as
∑ i = 0 ∞ U ( i , 0 ) x i = 4 π ∑ n = 0 ∞ 1 2 n + 1 ∑ k = 0 ∞ ( − 1 ) k ( 2 k + 1 ) ! ( ( 2 n + 1 ) π x ) 2 k + 1 (26)
which implies
U ( i , 0 ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ( − 1 ) i − 1 2 i ! ( ( 2 n + 1 ) π 2 ) i , i = 1 , 3 , 5 , ⋯ (27)
From the boundary conditions, we have
∑ j = 0 ∞ U ( 0 , j ) t j = 0 (28)
∑ j = 0 ∞ ∑ i = 0 ∞ U ( i , j ) t j = 0 (29)
which implies
U ( 0 , j ) = 0 (30)
∑ i = 0 ∞ U ( i , j ) = 0 (31)
Substituting Equation (27), Equation (28) and Equation (30) into Equation (25), one has
U ( i , j ) = ∑ n = 0 ∞ α j j ! 4 ( 2 n + 1 ) π ( − 1 ) i − 1 + 2 j 2 i ! ( ( 2 n + 1 ) π ) i + 2 j , i = 1 , 3 , 5 , ⋯ (32)
U ( i , j ) = 0 , i = 0 , 2 , 4 , ⋯ (33)
From the definition of inverse differential transform, we get
u ( x , t ) = 4 π ∑ n = 0 ∞ ∑ i = 0 ∞ 1 2 n + 1 ( − 1 ) i ( 2 i + 1 ) ! ( ( 2 n + 1 ) π ) 2 i + 1 x 2 i + 1 ∑ j = 0 ∞ ( − 1 ) j α j j ! ( ( 2 n + 1 ) π ) 2 j t j = 4 π ∑ n = 0 ∞ 1 2 n + 1 sin ( ( 2 n + 1 ) π x ) exp ( − ( ( 2 n + 1 ) π ) 2 α t ) (34)
Note that Equation (2) is often used to describe the law of heat conduction. Because its heat conduction coefficient is constant, it belongs to the category of linear partial differential equations. For linear partial differential equations, the separation variable method is often used to solve, but this paper gives different solutions method. The solution obtained by the FDTM converge to the solution by separation of variables method [
Example 2. Partial differential equations with constant coefficients are considered in this example.
C 1 ∂ u ∂ t + ∂ V ∂ t = ∂ 2 V ∂ x 2 (35)
∂ u ∂ t + C 2 ∂ v ∂ t = C 3 ∂ 2 v ∂ x 2 (36)
subject to initial conditions
u ( x , 0 ) = 1 in 0 < x ≤ 1 (37)
v ( x , 0 ) = 1 in 0 < x ≤ 1 (38)
and boundary conditions
u ( 0 , t ) = 0 , v ( 0 , t ) = 0 in t > 0 (39)
∂ u ( 1 , t ) ∂ x = 0 , ∂ v ( 1 , t ) ∂ x = 0 in t > 0 (40)
where, C 1 , C 2 , C 3 are costant coefficient and C 1 C 2 ≠ 1 , C 3 ≠ 0 .
Remark: The system described above has been widely used in geotechnical engineering [
Based on the FDTM, we have ones
U ( i , j + 1 ) = C 2 ( i + 1 ) ( i + 2 ) V ( i + 2 , j ) − C 3 ( i + 1 ) ( i + 2 ) U ( i + 2 , j ) ( j + 1 ) ( C 1 C 2 − 1 ) (41)
V ( i , j + 1 ) = C 1 C 3 ( i + 1 ) ( i + 2 ) U ( i + 2 , j ) − ( i + 1 ) ( i + 2 ) V ( i + 2 , j ) ( j + 1 ) ( C 1 C 2 − 1 ) (42)
By the initial condition Equation (37) & Equation (38), it can be obtained as
∑ i = 0 ∞ U ( i , 0 ) x i = 4 π ∑ n = 0 ∞ 1 2 n + 1 ∑ k = 0 ∞ ( − 1 ) k ( 2 k + 1 ) ! ( ( 2 n + 1 ) π x 2 ) 2 k + 1 (43)
∑ i = 0 ∞ V ( i , 0 ) x i = 4 π ∑ n = 0 ∞ 1 2 n + 1 ∑ k = 0 ∞ ( − 1 ) k ( 2 k + 1 ) ! ( ( 2 n + 1 ) π x 2 ) 2 k + 1 (44)
which implies
U ( i , 0 ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ( − 1 ) i − 1 2 i ! ( ( 2 n + 1 ) π 2 ) i , i = 1 , 3 , 5 , ⋯ (45)
V ( i , 0 ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ( − 1 ) i − 1 2 i ! ( ( 2 n + 1 ) π 2 ) i , i = 1 , 3 , 5 , ⋯ (46)
From the boundary conditions Equation (39) & Equation (40), one has
{ ∑ j = 0 ∞ U 1 ( 0 , j ) t j = 0 , ∑ j = 0 ∞ U 2 ( 0 , j ) t j = 0 ∑ j = 0 ∞ ∑ i = 0 ∞ ( i + 1 ) U 1 ( i , j ) t j = 0 ∑ j = 0 ∞ ∑ i = 0 ∞ ( i + 1 ) U 2 ( i , j ) t j = 0 (47)
which implies
U ( 0 , j ) = 0 , V ( 0 , j ) = 0 (48)
{ ∑ i = 0 ∞ ( i + 1 ) U ( i + 1 , j ) = 0 ∑ i = 0 ∞ ( i + 1 ) V ( i + 1 , j ) = 0 (49)
Substituting Equation (45) & Equation (46) and Equation (48) into Equation (41) & Equation (42), and by recursive method, it can be get
U ( i , j ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ( − 1 ) i − 1 + 2 j 2 i ! a 1 ( j ) j ! ( C 1 C 2 − 1 ) j ( ( 2 n + 1 ) π 2 ) i + 2 j , i = 1 , 3 , 5 , ⋯ (50)
V ( i , j ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ( − 1 ) i − 1 + 2 j 2 i ! a 2 ( j ) j ! ( C 1 C 2 − 1 ) j ( ( 2 n + 1 ) π 2 ) i + 2 j , i = 1 , 3 , 5 , ⋯ (51)
where, a 1 ( j ) , a 2 ( j ) satisfy the recursive formula
a ( j + 1 ) = A a ( j ) (52)
where, a ( j ) = ( a 1 ( j ) , a 2 ( j ) ) T , A = ( − 1 C 1 C 3 C 2 − C 3 ) , a 1 ( 0 ) = a 2 ( 0 ) = 1 , j = 0 , 1 , 2 , ⋯ .
From the Equation (52), we have
a 1 ( j ) = ( λ 1 + 1 ) ( C 1 C 3 − λ 2 − 1 ) λ 1 j − ( λ 2 + 1 ) ( C 1 C 3 − λ 1 − 1 ) λ 2 j C 1 C 3 ( λ 1 − λ 2 ) (53)
a 2 ( j ) = ( C 1 C 3 − λ 2 − 1 ) λ 1 j − ( C 1 C 3 − λ 1 − 1 ) λ 2 j λ 1 − λ 2 (54)
where λ 1 and λ 2 are the eigenvalues of the matrix A = ( − 1 C 1 C 3 C 2 − C 3 ) .
By using Equation (41) & Equation (42) and Equation (48) & Equation (49), it can be obtained as
U 1 ( i , j ) = 0 , i = 0 , 2 , 4 , ⋯ (55)
U 2 ( i , j ) = 0 , i = 0 , 2 , 4 , ⋯ (56)
According the differential inverse transform of the DTM, we get
u ( x , t ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ∑ i = 1 , 3 , 5 , ⋯ ( − 1 ) i − 1 2 i ! ( ( 2 n + 1 ) π 2 x ) i ∑ j = 0 ∞ a 1 ( j ) j ! [ − ( ( 2 n + 1 ) π ) 2 4 ( C 1 C 2 − 1 ) t ] j (57)
v ( x , t ) = 4 π ∑ n = 0 ∞ 1 2 n + 1 ∑ i = 1 , 3 , 5 , ⋯ ( − 1 ) i − 1 2 i ! ( ( 2 n + 1 ) π x 2 ) i ∑ j = 0 ∞ a 2 ( j ) j ! [ − ( ( 2 n + 1 ) π ) 2 4 ( C 1 C 2 − 1 ) t ] j (58)
It shoud be noted that the series expression of a sine function is sin ( x ) = ∑ i = 1 , 3 , 5 , ⋯ ( − 1 ) i − 1 2 i ! x i , therefore the Equation (57) & Equation (58) can be rewritten as
u ( x , t ) = 4 π ∑ n = 0 ∞ B 1 e A 1 t + B 2 e A 2 t 2 n + 1 sin ( ( 2 n + 1 ) π 2 x ) (59)
v ( x , t ) = 4 π ∑ n = 0 ∞ D 1 e A 1 t + D 2 e A 2 t 2 n + 1 sin ( ( 2 n + 1 ) π 2 x ) (60)
where A 1 = − ( ( 2 n + 1 ) π ) 2 4 ( C 1 C 2 − 1 ) λ 1 , A 2 = − ( ( 2 n + 1 ) π ) 2 4 ( C 1 C 2 − 1 ) λ 2 , B 1 = ( λ 1 + 1 ) ( C 1 C 3 − λ 2 − 1 ) C 1 C 3 ( λ 1 − λ 2 ) , B 2 = − ( λ 2 + 1 ) ( C 1 C 3 − λ 1 − 1 ) C 1 C 3 ( λ 1 − λ 2 ) , D 1 = C 1 C 3 − λ 2 − 1 λ 1 − λ 2 , D 2 = − ( C 1 C 3 − λ 1 − 1 ) λ 1 − λ 2 .
Example 3. Consider the nonlinear system: coupled Burgers’ equations at the interval x ∈ [ 0 , π ] and t ∈ [ 0 , ∞ ] .
u t − u x x − 2 u u x + ( u v ) x = 0 (61)
v t − v x x − 2 v v x + ( u v ) x = 0 (62)
with the initial condition
u ( 0 , x ) = sin ( x ) (63)
v ( 0 , x ) = sin ( x ) (64)
and the zero Dirichlet boundary conditions
u ( t , 0 ) = 0 , u ( t , π ) = 0 (65)
v ( t , 0 ) = 0 , v ( t , π ) = 0 (66)
From the FDTM, it can be obtained as
( j + 1 ) U ( i , j + 1 ) − ( i + 1 ) ( i + 2 ) U ( i + 2 , j ) − 2 ∑ r = 0 i ∑ s = 0 j U ( r , j − s ) ( i − r + 1 ) U ( i − r + 1 , s ) + ∑ r = 0 i ∑ s = 0 j ( r + 1 ) U ( r + 1 , j − s ) V ( i − r , s ) + ∑ r = 0 i ∑ s = 0 j ( r + 1 ) V ( r + 1 , j − s ) U ( i − r , s ) = 0 (67)
( j + 1 ) V ( i , j + 1 ) − ( i + 1 ) ( i + 2 ) V ( i + 2 , j ) − 2 ∑ r = 0 i ∑ s = 0 j V ( r , j − s ) ( i − r + 1 ) V ( i − r + 1 , s ) + ∑ r = 0 i ∑ s = 0 j ( r + 1 ) U ( r + 1 , j − s ) V ( i − r , s ) + ∑ r = 0 i ∑ s = 0 j ( r + 1 ) V ( r + 1 , j − s ) U ( i − r , s ) = 0 (68)
For the initial conditions, we get
U ( i , 0 ) = { ( − 1 ) i − 1 2 1 i ! , i ∈ o d d 0 , i ∈ e v e n (69)
V ( i , 0 ) = { ( − 1 ) i − 1 2 1 i ! , i ∈ o d d 0 , i ∈ e v e n (70)
For the boundary conditions, we get
U ( 0 , j ) = 0 , ∑ i = 0 ∞ U ( i , j ) = 0 (71)
V ( 0 , j ) = 0 , ∑ i = 0 ∞ V ( i , j ) = 0 (72)
Then, one has
U ( i , j ) = { ( − 1 ) i − 1 2 i ! ( − 1 ) j j ! , i ∈ o d d 0 , i ∈ e v e n (73)
V ( i , j ) = { ( − 1 ) i − 1 2 i ! ( − 1 ) j j ! , i ∈ o d d 0 , i ∈ e v e n (74)
so the solution for the Equations (61)-(66) are
u ( x , t ) = ∑ j = 0 ∞ ∑ i = 0 ∞ ( − 1 ) i ( 2 i + 1 ) ! x i ( − 1 ) j j ! t j (75)
v ( x , t ) = ∑ j = 0 ∞ ∑ i = 0 ∞ ( − 1 ) i ( 2 i + 1 ) ! x i ( − 1 ) j j ! t j (76)
i.e.
u ( x , t ) = sin ( x ) exp ( − x ) (77)
v ( x , t ) = sin ( x ) exp ( − x ) (78)
In this paper, we propose an FDTM algorithm based on the differential transformation method and Fourier expansion technology, which can solve the IBVP system with three kinds of typical zero boundary. Especially the discontinuous boundary can be effectively solved. Finally, the heat conduction equation with discontinuous boundary conditions is solved by the algorithm. The partial differential equations described dissipation law of pore pressure which widely applied in engineering are solved according to the FDTM. In addition, nonlinear coupled Burgers’ equations with the zero Dirichlet boundary conditions can also be analytically solved by the method. The results are consistent with the existing analytical solutions. It shows that the algorithm is effective and reasonable. The algorithm can be extended to complex initial boundary value problems.
This research was supported by the General project of Zhejiang Natural Science Foundation No. LY19E080008 and Zhejiang Provincial Construction Department Project No. 2019K085.
The authors declare no conflicts of interest regarding the publication of this paper.
Huang, C.L., Li, J.W. and Lin, F.L. (2020) A New Algorithm Based on Differential Transform Method for Solving Partial Differential Equation System with Initial and Boundary Conditions. Advances in Pure Mathematics, 10, 337-349. https://doi.org/10.4236/apm.2020.105020