Abstract and Applied Analysis

Volume 2014 (2014), Article ID 686020, 12 pages

http://dx.doi.org/10.1155/2014/686020

## Moving Least Squares Method for a One-Dimensional Parabolic Inverse Problem

College of Mathematics and Econometrics, Hunan University, Changsha, Hunan 410082, China

Received 7 November 2013; Accepted 17 January 2014; Published 5 March 2014

Academic Editor: Jaan Janno

Copyright © 2014 Baiyu Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper investigates the numerical solution of a class of one-dimensional inverse parabolic problems using the moving least squares approximation; the inverse problem is the determination of an unknown source term depending on time. The collocation method is used for solving the equation; some numerical experiments are presented and discussed to illustrate the stability and high efficiency of the method.

#### 1. Introduction

The inverse problem of parabolic equations appears in a wide variety of physical and engineering settings, such as elasticity, plasticity, hydrology, material sciences, heat transfer, combustion systems, medical imaging, transport problems, and control theory. Many researchers solved this problem using different methods [1–10].

For many decades, many numerical methods have been developed to solve partial differential equations, such as finite difference method, finite elements method, and boundary elements method. However, these above methods are mesh dependent methods, and, for some problems such as large deformation, the mesh generation is very difficult, especially with the irregular geometries. As a result, the meshless method appeared.

Compared with these mesh dependent numerical methods, in the meshless methods, 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, and it is a technique on scattered data; this method uses the distributed nodal points to approximate the unknown function; the distribution of nodes could be selected regularly or randomly in the analyzed domain, and there is no need for the geometry of the domain.

Many meshless methods have been discussed, such as smooth particle hydrodynamics method [11], the finite point method [12], diffuse element method [13], element-free Galerkin method [14], hp-clouds method [15], and meshless local Petrov-Galerkin method [16]. Moving least squares is very important for constructing the shape functions in meshless method, and it had been studied by a number of investigators, Lancaster and Salkauskas [17], Levin [18], Mirzaei and Dehghan [19], Armentano [20, 21], and so forth.

In this paper, a collocation meshless method based on moving least squares approximation is used for numerical solution of a class of inverse problems in parabolic equation. The rest of the paper is organized as follows. In Section 2, we will give an outline of the moving least squares. In Section 3, we solve the inverse problem using the meshless method based on the moving least squares. Numerical experiments will be given in Section 4 in order to illustrate the feasibility of the method.

#### 2. An Outline of the Moving Least Squares (MLS)

The MLS method as an approximation and interpolating method has been introduced by Lancaster and Salkauskas.

Given data values at nodes , is the number of scattered nodes, the MLS method produces a function that approximates data in a weighted square sense.

It can be defined as where is the number of terms in the basis, are the monomial basis functions, are the coefficients of the basis functions, and

The unknown coefficient is determined by minimizing the functional , which is defined as where is the number of nodes in the support domain of the point , is the weight function, and are the nodes in the influence domain of .

Equation (3) can be rewritten in the vector form where

According to the above conditions (4)-(5), taking the derivative to zero, we have which is equivalent to where Then, we get and, by substituting (9) into (1), we have where and is called the shape function.

#### 3. The Inverse Problem and Its Numerical Solution

In this section, the collocation meshless method based on moving least squares approximation is implemented for the numerical solution of the inverse problem of parabolic equations, and the problem is as follows.

Find and which satisfy And the additional specification is where , , , and are known functions and is a fixed prescribed point in the admissible set.

Assume that these known functions satisfy the compatibility conditions; the unique solvability of this inverse problem is presented in [5]. However, this inverse problem is ill-posed; that is to say, the solution is unstable, and any small change in the additional specification may result in a dramatic change in the numerical solution. To obtain a stable numerical solution, some regularization strategies should be applied.

According to (13), consider the following transformation [22]: and using (14), we get

By substituting (14) into (12), (12) is transformed to the following equation: So the inverse problem is transformed to a direct problem.

The approximate function of can be represented as where is the shape function described in Section 2.

By substituting (17) into (16), the system (16) can be rewritten as

It is well known that the step lengths in the standard numerical method have regularization effect; hence, we can choose appropriate step lengths to compute the derivative of . We apply a simple one-step forward difference formula, and we get Then, from the first formula of (19), we obtain by substituting each for in (20), we get

Let then (21) can be rewritten as follows: using the iterative method, by (19) and (22), we can obtain , , , and the numerical solution ; then we get the numerical solution

#### 4. Numerical Experiments and Discussions

In this section, we give two examples to illustrate the correctness of the theoretical result and the feasibility of the method.

*Example 1. *Consider (12)-(13), with the conditions
and we let , , and .

The exact solutions are

At first, in order to get the approximation effect of according to different nodes of and , we let , and , , respectively; the exact solution , the numerical solution , and the error are plotted in Figures 1–4.

As seen from Figures 1 and 2 if the is fixed, the error decreases as decreases, but around the initial point, the error changes a little. When we decrease , from Figures 3 and 4, it is clear that the error around the initial point decreases obviously, and with the decrease of , the total error decreases too.

In Figure 5, we plot the exact solution and the numerical solutions at , respectively, with and .

Figure 5 shows clearly that the approximate solution is well for different value of .

Figures 6 and 7 give the numerical solution and the error with , , respectively.

As seen from Figures 6 and 7 the effect of different to the approximate solution is the same to ; that is, the error decreases according to decreasing .

Next, in order to illustrate the effect of the noisy data on numerical solution, we define the artificial error function as follows: where represents the noisy parameter, and we consider two cases in this paper as follows:(i)is const;(ii) is random uniformly distributed on .

Let , respectively; in case (i), we plot the exact solution , the numerical solution , and the error with , , in Figures 8 and 9.

From Figures 8 and 9, we can see that when the noisy data exist in additional specification, the effect of numerical solution is worse than when there is no noisy data. However, the effect of approximation becomes better with the noisy parameter decrease; this suggests that the method in this paper is stable.

In case (ii), we let the parameter and , respectively, and plot the exact solution , the numerical solution , and the error with , , and the results are shown in Figures 10 and 11.

Figures 10 and 11 show that when the noisy parameter is random, the result of numerical solution is also bad, but it is the same to the case that is const.; with the parameter decrease, the effect of approximation becomes better. Moreover, comparing with the fact that is const, when the noisy parameter is random, although the result fluctuation is very big, they can be controlled in a certain range.

At last, in order to illustrate the approximate effect, we define the root mean square error of the functions and as follows: where and are the exact solution and and are the approximate numerical solution. The error results for different and with no noisy data are listed in Table 1.

We will give the error results for different noisy parameter with , in Tables 2 and 3 and for different with the same noisy parameter in Table 4.

From Tables 2 and 3, we see that the errors vary with the noisy parameter. In Table 4, we find that the approximation effect varies with for the same noisy parameter, and these show that the length of has the effect of regularization, and our method in this paper is stable.

In the next example, we will compare the numerical solution using the finite difference method (FDM) and the meshless collocation method based on moving least squares (MLS), respectively.

*Example 2. *Consider the conditions
and we let , , and .

The exact solutions are

We plot the exact solution and numerical solution of in three different cases using FDM and MLS, respectively.

Let , ; first, we plot the result in Figure 12 with no noisy data.

In Figures 13 and 14, we let and , respectively.

From Figures 12, 13, and 14, we can see that when there is no noisy data, the two methods are stable relatively, and, when there exist noisy data, the method FDM is unstable, especially in the case that the noisy parameter is random; but the method MLS is always stable.

Finally, we give the errors of numerical solution with different cases using these two methods in Table 5.

From Table 5, we obtain that the method MLS is more stable and efficient than the method FDM in any case.

#### 5. Conclusion

In this paper, the meshless method based on the moving least squares is used for solving the inverse problem of parabolic equation with the time-dependent source term. We use some transformations to change the problem, and, in order to overcome the ill-posedness, we use the appropriate length of time. From the experiments, we find that the numerical solution is stable. Moreover, compared with the method FDM, we see that our method is stable and highly efficient.

#### Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work was supported by the Hunan Provincial Innovation Foundation for Postgraduate (CX2011B156) and NNSF of China (nos. 11271117 and 11201136).

#### References

- Z. H. Liu and B. Y. Wang, “Coefficient identification in parabolic equations,”
*Applied Mathematics and Computation*, vol. 209, no. 2, pp. 379–390, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. B. Liu, B. Y. Wang, and Z. H. Liu, “Determination of a source term in a heat equation,”
*International Journal of Computer Mathematics*, vol. 87, no. 5, pp. 969–975, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Hasanov and Z. H. Liu, “An inverse coefficient problem for a nonlinear parabolic variational inequality,”
*Applied Mathematics Letters*, vol. 21, no. 6, pp. 563–570, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z. H. Liu and S. Tatar, “Analytical solutions of a class of inverse coefficient problems,”
*Applied Mathematics Letters*, vol. 25, no. 12, pp. 2391–2395, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. G. Fatullayev and E. Can, “Numerical procedures for determining unknown source parameter in parabolic equations,”
*Mathematics and Computers in Simulation*, vol. 54, no. 1–3, pp. 159–167, 2000. View at Publisher · View at Google Scholar · View at MathSciNet - A. G. Fatullayev, “Numerical solution of the inverse problem of determining an unknown source term in a heat equation,”
*Mathematics and Computers in Simulation*, vol. 58, no. 3, pp. 247–253, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Farcas and D. Lesnic, “The boundary-element method for the determination of a heat source dependent on one variable,”
*Journal of Engineering Mathematics*, vol. 54, no. 4, pp. 375–388, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. E. Badia and T. Ha-Duong, “On an inverse source problem for the heat equation. Application to a pollution detection problem,”
*Journal of Inverse and Ill-Posed Problems*, vol. 10, no. 6, pp. 585–599, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. R. Cannon, “Determination of an unknown heat source from overspecified boundary data,”
*SIAM Journal on Numerical Analysis*, vol. 5, pp. 275–286, 1968. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Choulli and M. Yamamoto, “Conditional stability in determining a heat source,”
*Journal of Inverse and Ill-Posed Problems*, vol. 12, no. 3, pp. 233–243, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. J. Monaghan, “An introduction to SPH,”
*Computer Physics Communications*, vol. 48, no. 1, pp. 89–96, 1988. View at Google Scholar · View at Scopus - E. Oate, F. Perazzo, and J. Miquel, “A finite point method for elasticity problems,”
*Computers and Structures*, vol. 79, no. 22–25, pp. 2151–2163, 2001. View at Publisher · View at Google Scholar · View at Scopus - B. Nayroles, G. Touzot, and P. Villon, “Generalizing the finite element method: diffuse approximation and diffuse elements,”
*Computational Mechanics*, vol. 10, no. 5, pp. 307–318, 1992. View at Publisher · View at Google Scholar · View at Scopus - T. Belytschko, Y. Y. Lu, and L. Gu, “Element-free Galerkin methods,”
*International Journal for Numerical Methods in Engineering*, vol. 37, no. 2, pp. 229–256, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. A. Duarte and J. T. Oden, “Hp clouds—an meshless method to solve boundary-value problems,” Texas Institute for Computational and Applied Mathematics, University of Texas at Austin, 1995.
- S. N. Atluri and S. Shen,
*The Meshless Local Petro-Galerkin (MLPG) Method*, Tech Science Press, Stuttgart, Germany, 2002. - P. Lancaster and K. Salkauskas, “Surfaces generated by moving least squares methods,”
*Mathematics of Computation*, vol. 37, no. 155, pp. 141–158, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Levin, “The approximation power of moving least-squares,”
*Mathematics of Computation*, vol. 67, no. 224, pp. 1517–1531, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Mirzaei and M. Dehghan, “A meshless based method for solution of integral equations,”
*Applied Numerical Mathematics*, vol. 60, no. 3, pp. 245–262, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. G. Armentano, “Error estimates in Sobolev spaces for moving least square approximations,”
*SIAM Journal on Numerical Analysis*, vol. 39, no. 1, pp. 38–51, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. G. Armentano and R. G. Durán, “Error estimates for moving least square approximations,”
*Applied Numerical Mathematics*, vol. 37, no. 3, pp. 397–416, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Colton, R. Ewing, and W. Rundell,
*Inverse Problems in Partial Differential Equation*, SIAM, Philadelphia, Pa, USA, 1990.