A Local Meshless Method for Two Classes of Parabolic Inverse Problems

A local meshless method is applied to find the numerical solutions of two classes of inverse problems in parabolic equations. The problem is reconstructing the source term using a solution specified at some internal points; one class is that the source term is time dependent, and the other class is that the source term is time and space dependent. Some numerical experiments are presented and discussed.


Introduction
The inverse problem of parabolic equations appears naturally in a wide variety of physical and engineering settings; many researchers solved this problem using different methods [1]- [10].An important class of inverse problem is reconstructing the source term in parabolic equation, and it has been discussed in many papers [11]- [19].
In meshless method, mesh generation on the spatial domain of the problem is not needed; this property is the main advantage of these techniques over the mesh dependent methods.The moving least squares method and the radial basis functions method are all the primary methods of constructing shape function in meshless method.The moving least squares method is introduced by Lancaster and Salkauskas [20] for the surface construction; in this method, one can obtain a best approximation in a weighted least squares sense, and this method emphasizes the compacted support of weight function especially, so it has the local characteristics.The radial basis functions method [21] is very efficient interpo-lating technique related to the scattered data approximation, it has high precision, and it is very suitable for the scattered data model; however, there are some drawbacks such as the character of global supported, the full matrix obtained from discretization scheme is always ill-conditioned as the number of collocation points increases, and it is very sensitive for the selection of the free parameter c.
To overcome the problems of ill-conditioned and the shape parameter sensitivity in radial basis functions method, the local radial basis function was introduced by Lee et al. [22]; in contrast to radial basis functions method, only scattered data in the neighboring points are used in local radial basis functions, instead of using all the points, thus the order of the matrix which is obtained from discretization being reduced, so the matrix of shape function is sparse.This will improve the computational accuracy and be suitable for solving large-scale problems [23].
The meshless method of moving least squares coupled with radial basis functions used for constructing shape function was introduced by Mohamed et al. [24], but this method is global, and the problems in radial basis functions still exist.The method based on the linear combination of moving least squares and local radial basis functions in the same compact support was introduced by Wang [25], which is a local method, and is very suitable for practical problems.
In this paper, we consider two classes of inverse problems of reconstructing the source term in parabolic equation from additional measurements, and we use the local meshless method presented in [25].
This paper is organized as follows.In Section 2, we give an outline of the local meshless method.In Section 3, we solve the inverse problems using the local meshless method.In order to illustrate the feasibility of the method, numerical experiments will be given in Section 4.

Preliminaries
Let Ω be an open bounded domain in R d , given data values x u j N =  , where j x is the distinct scattered point in Ω , j u is the data value of function u at the node j x , N is the number of scattered nodes, and we let u  denote the approximate function of u in this work.
Combining with the collocation method, in [25], the approximate function ( ) where ( ) i x ς stands for the shape function, and it can be written as the linear combination of the shape functions of moving least squares and local radial basis functions, ( ) ( ) ( ) ( )

The Inverse Problem and Its Numerical Solution
Inverse problem I.The problem can be described as follows, with the initial condition and the boundary conditions The Formulas ( 2)-( 4) are the direct problem, and the inverse problem is that the functions ( ) , u x t and ( ) f t are unknown, with the additional observation of ( ) , u x t at some internal point ( ) according to (5), consider the following transformation in [26], using ( 6), we get substituting ( 7) into (2), we have the initial and boundary conditions are So the inverse problem is transformed to a direct problem, then we use the local meshless method described in Section 2 solving the problem ( 8)- (10).
From (1), the approximate function ( ) where ( ) for the derivative of t, we apply one step forward difference formula to t, and let so the Equation ( 8) can be rewritten as , , from ( 12) and the conditions ( 9)-( 10), we can obtain the numerical solution ( ) ( ), 1, 2, , , 1, 2, , Inverse problem II.The problem can be described as follows, , , , , 0 ,0 , u x t u x t f x t x l t T t x with the initial condition and the boundary conditions The Formulas ( 13)-( 15) are the direct problem, and the inverse problem is that the functions ( ) , u x t and ( ) , f x t are unknown, with the additional ob- servation of ( ) , u x t at some internal point ( ) Assume that the function ( ) , f x t can be described as where ( ) x ψ is the known function, and satisfies the following restrictions: 1) x ψ = on the boundary of the computational domain.

Numerical Experiments and Discussions
To test the efficiency of the method in this paper, in this section, we give two examples to illustrate the correctness of the theoretical result and the feasibility of the method.
Example 1.Consider the problem (2)-( 5), with the conditions Figure 1, respectively, where 0.0001, 0.05 From Figure 1, we can see that the approximation effect is good.
Secondly, in order to test the stability of the numerical solution, we give small perturbations on ( )  ( ) ( ) where γ is the noise parameter.
We plot the error functions ( ) ( ) in Figure 2, where 0.0001, 0.05 From Figure 2, we see that when there is the noisy data, the approximation effect of numerical solution is worse relatively, but there is no obvious oscillation in the error graph.
Lastly, we define the following error of functions ( ) f t and ( ) , where ( ) ( ) x t , M and N are the number of nodes about x and t, respectively.we give the results under the different cases in Table 1.
From Table 1, we get that the error decreases with the decrease of Δt, when the number of nodes are fixed.When Δt is fixed, the error decreases with the increase of the number of nodes.When Δt and Δx are fixed, the error varies with the change of the noisy data, and the error decreases with the decrease of noisy data.
Example 2. Consider the problem ( 13)-( 16), with the conditions and we let Table 1.The error under different cases.From Figure 3, we see that the approximation effect is good.Secondly, in order to test the stability of the numerical solution, we give small perturbations on ( ) E t , and the artificial error is defined by (27).The results of ( ) ( )  4, we see that when there is noise, the approximation effect is worse than there is no noise, but the error function is smooth and there is no obvious oscillation in error graph.
At last, we define Eu by (28), and the definition of Ef is same as Eu, we give the results under the different cases in Table 2.
From Table 2, we get that when 0 γ = , the error decreases with the decrease of Δt and Δx, when Δt and Δx are fixed, the error decreases with the decrease of noise parameter.

Conclusion
In this paper, we use the local meshless method based on the moving least   From the experiments, we can see that this method is accurate and efficient.

=
Firstly, in order to illustrate the accuracy of the method, we plot the error W. Liu, B. Y. Wang DOI: 10.4236/jamp.2018.65083975 Journal of Applied Mathematics and Physics
squares method and the local radial basis functions method to solve two classes of inverse problems of reconstructing the source term in parabolic equations.
we apply one step forward difference formula to t, and let