1 Introduction

In this paper, we consider a problem of recovering the interior temperature from surface data (or boundary data). In fact, the interior temperature of a body (e.g., the skin of a missile) cannot be determined in several engineering contexts (see, e.g., [15]) and many industrial applications. Hence, in order to get the distribution of interior temperature, we have to use the measured temperature outside the surface. In optoelectronics, the determination of a radiation field surrounding a source of radiation (e.g., a light emitting diode) is a frequently occurring problem. As a rule, experimental determination of the whole radiation field is not possible. Practically, we are able to measure the electromagnetic field only on some subset of physical space (e.g., on some surfaces). So, the problem arises how to reconstruct the radiation field from such experimental data (see, for instance, [6]). In the paper of Reginska [6], the authors considered a physical problem which is connected with the notion of light beams. Some applications of this model can be established in more detail in [6].

Precisely, we consider a two-dimensional body represented by the domain R×(0,1). Let u(x,y) be the temperature of the body at (x,y)R×(0,1), and let ff(x,y) be a given source, we have the following nonhomogeneous equation:

Δu=f(x,y),xR,0<y<1,
(1)

where Δ= 2 x 2 + 2 y 2 . We assume that the temperature on the line y=1 is known, i.e.,

u(x,1)=φ(x),
(2)

and that

u y (x,1)=ψ(x),
(3)

where φ(x), ψ(x) are given functions in L 2 (R). The problem can be referred to as a sideways elliptic problem and the interior measurement φ(x) is also called (in geology) the borehole measurement.

The latter problem is a Cauchy elliptic problem in an infinite strip and is well known as an ill-posed problem, i.e., solutions of the problem do not always exist and, whenever they do exist, there is no continuous dependence on the given data. This makes the numerical computations become difficult. So, ill-posed problems need to be regularized.

The homogeneous problem (f0) was studied with various methods in many papers. Using the boundary element method, the homogeneous problems were considered in [2, 7, 8]etc. Similarly, many methods have been investigated to solve the Cauchy problem for a linear homogeneous elliptic equation such as the method of successive iterations [8, 9], the optimization method [10, 11], the quasi-reversibility method [1214], fourth-order modified method [15, 16], Fourier truncation regularized (or spectral regularized method) [1719], etc. The number of papers devoted to the Cauchy problem for linear homogeneous elliptic equation are very rich, for example, [7, 2023] and the references therein.

Although there are many papers on homogeneous cases, we only find a few papers on nonhomogeneous sideways problems (for both parabolic and elliptic equations). The main aim of this paper is to present a simple and effective regularization method, and investigate the error estimate between the regularization solution and the exact solution. In a sense, this paper is an extension of recent results in [4, 911, 22, 24].

The paper is organized as follows. In Section 2, we present the formulation of the Cauchy problem for the elliptic equation and propose a modified regularization method. The error estimate is given based on two different a priori assumptions for the exact solution. Finally, in Section 3, we give a numerical example to demonstrate the effectiveness of our proposed method.

2 Regularization and error estimate

Let f ˆ (ξ)= 1 2 π + f(x) e i ξ x dx be the Fourier transform of function f L 2 (R). By taking Fourier transformation with respect to variable xR, we transform problem (1)-(3) to the following form:

u ˆ ( ξ , y ) = 1 2 φ ˆ ( ξ ) [ e ( 1 y ) | ξ | + e ( y 1 ) | ξ | ] + 1 2 | ξ | ψ ˆ ( ξ ) [ e ( y 1 ) | ξ | e ( 1 y ) | ξ | ] + 1 2 y 1 1 | ξ | [ e ( η y ) | ξ | e | y η | | ξ | ] f ˆ ( ξ , η ) d η = 1 2 φ ˆ ( ξ ) [ e ( 1 y ) | ξ | + e ( y 1 ) | ξ | ] + [ 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ] e ( 1 y ) | ξ | ψ ˆ ( ξ ) + y 1 [ e 2 ( η y ) | ξ | 1 2 | ξ | e 2 ( η y ) | ξ | ] e ( η y ) | ξ | f ˆ ( ξ , η ) d η .
(4)

In the present paper, by approximating (4), we have a regularized solution u ϵ (x,y), the Fourier transform of which is

u ˆ ϵ ( ξ , y ) = [ 1 2 φ ˆ ( ξ ) ( 1 α ( ϵ ) + e ( y 1 ) | ξ | + e ( y 1 ) | ξ | ) + ( 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ) ψ ˆ ( ξ ) α ( ϵ ) + e ( y 1 ) | ξ | + y 1 ( e 2 ( η y ) | ξ | 1 2 | ξ | e 2 ( η y ) | ξ | ) f ˆ ( ξ , η ) α ( ϵ ) + e ( y η ) | ξ | d η ] χ [ β ( ϵ ) , β ( ϵ ) ] ( ξ )
(5)

or

u ϵ ( x , y ) = 1 2 2 π + [ 1 2 φ ˆ ( ξ ) ( 1 α ( ϵ ) + e ( y 1 ) | ξ | + e ( y 1 ) | ξ | ) + ( 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ) ψ ˆ ( ξ ) α ( ϵ ) + e ( y 1 ) | ξ | + y 1 ( e 2 ( η y ) | ξ | 1 2 | ξ | e 2 ( η y ) | ξ | ) f ˆ ( ξ , η ) α ( ϵ ) + e ( y η ) | ξ | d η ] χ [ β ( ϵ ) , β ( ϵ ) ] ( ξ ) e i ξ x d ξ .
(6)

Here, α(ϵ) and β(ϵ) are positive numbers (called regularization parameters) which depend on ϵ. They will be chosen later such that α(ϵ)(0,1) and β(ϵ)+ when ϵ0. For convenience, from now on, we denote α(ϵ) by α, and β(ϵ) by β.

In practice, the exact data ( φ e x , ψ e x ) L 2 (R)× L 2 (R) is given only by measurement. Assume that the exact data ( φ e x , ψ e x ) and the noisy data ( φ e x , ψ e x ) both belong to L 2 (R)× L 2 (R) and satisfy the following noise level

φ ϵ φ e x 2 ϵ, ψ ϵ ψ e x 2 ϵ.
(7)

Let v e x and v ϵ be the solutions of problem (6) corresponding to the exact data ( φ e x , ψ e x ) and the measured data ( φ ϵ , ψ ϵ ), respectively. Here, we denote by 2 the norm on L 2 (R). By taking the Fourier transform of v e x and v ϵ , we have

v ˆ e x ( ξ , y ) = [ 1 2 φ ˆ e x ( ξ ) ( 1 α + e ( y 1 ) | ξ | + e ( y 1 ) | ξ | ) + ( 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ) ψ ˆ e x ( ξ ) α + e ( y 1 ) | ξ | + y 1 ( e 2 ( η y ) | ξ | 1 2 | ξ | e 2 ( η y ) | ξ | ) f ˆ ( ξ , η ) α + e ( y η ) | ξ | d η ] χ [ β , β ] ( ξ ) ,
(8)
v ˆ ϵ ( ξ , y ) = [ 1 2 φ ˆ ϵ ( ξ ) ( 1 α + e ( y 1 ) | ξ | + e ( y 1 ) | ξ | ) + ( 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ) ψ ˆ ϵ ( ξ ) α + e ( y 1 ) | ξ | + y 1 ( e 2 ( η y ) | ξ | 1 2 | ξ | e 2 ( η y ) | ξ | ) f ˆ ( ξ , η ) α + e ( y η ) | ξ | d η ] χ [ β , β ] ( ξ ) .
(9)

We first have the following lemma.

Lemma 1 (The stability of a solution of problem (5))

Suppose that φ e x , ψ e x , φ ϵ , ψ ϵ L 2 (R) and φ ϵ φ e x 2 ϵ, ψ ϵ ψ e x 2 ϵ. Then we have

v ˆ ϵ ( , y ) v ˆ e x ( , y ) 2 2 2 α ( ϵ ) ϵ

for all y[0,1).

Proof From (7) and (8), we have

v ˆ ϵ ( , y ) v ˆ e x ( , y ) 2 2 = + | v ˆ ϵ ( ξ , y ) v ˆ e x ( ξ , y ) | 2 d ξ = + | v ˆ ϵ ( ξ , y ) v ˆ e x ( ξ , y ) | 2 χ [ β , β ] ( ξ ) d ξ = + | 1 2 ( 1 α + e ( y 1 ) | ξ | + e ( y 1 ) | ξ | ) [ φ ˆ ϵ ( ξ ) φ ˆ e x ( ξ ) ] + ( 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ) 1 α + e ( y 1 ) | ξ | [ ψ ˆ ϵ ( ξ ) ψ ˆ e x ( ξ ) ] | 2 χ [ β , β ] ( ξ ) d ξ .
(10)

Using the inequality e | x | 1 | x | e | x | , we obtain

| 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | |1for 0y<1.
(11)

Note that α(ϵ)(0,1), e ( y 1 ) | ξ | 1 for 0<y<1, then from (9) and (10) we get

v ˆ ϵ ( , y ) v ˆ e x ( , y ) 2 2 + [ 1 2 ( 1 α + 1 ) | φ ˆ ϵ ( ξ ) φ ˆ e x ( ξ ) | + 1 α | ψ ˆ ϵ ( ξ ) ψ ˆ e x ( ξ ) | ] 2 d ξ 1 α 2 + ( | φ ˆ ϵ ( ξ ) φ ˆ e x ( ξ ) | + | ψ ˆ ϵ ( ξ ) ψ ˆ e x ( ξ ) | ) 2 d ξ 2 α 2 + ( | φ ˆ ϵ ( ξ ) φ ˆ e x ( ξ ) | 2 + | ψ ˆ ϵ ( ξ ) ψ ˆ e x ( ξ ) | 2 ) d ξ = 2 α 2 ( φ ˆ ϵ φ ˆ e x 2 2 + ψ ˆ ϵ ψ ˆ e x 2 2 ) .

Applying the inequality a 2 + b 2 a+b for a,b0, we obtain

v ˆ ϵ ( , y ) v ˆ e x ( , y ) 2 2 α 2 ( φ ˆ ϵ φ ˆ e x 2 + ψ ˆ ϵ ψ ˆ e x 2 ) 2 2 α ϵ .

This completes the proof of Lemma 1. □

Theorem 1 Assume that u e x is the exact solution of problem (1)-(3) corresponding to the exact data φ e x , ψ e x L 2 (R) and that φ ϵ , ψ ϵ L 2 (R) are the measured data satisfying φ ϵ φ e x 2 ϵ, ψ ϵ ψ e x 2 ϵ. Moreover, if we assume in addition that x u e x L 2 (R) and 0 1 + | f ˆ (ξ,η) | 2 dξdη<. Then, with α= ϵ 1 / 2 and β=ln 1 ϵ 1 / 8 , we can construct from φ ϵ , ψ ϵ a function v ϵ L 2 (R) for every 0y<1

v ϵ ( , y ) u e x ( , y ) 2 C ln 1 ϵ ,

where

C = 2 2 + 3 M + 8 x u e x ( , y ) 2 , M = 1 2 φ ˆ e x ( ξ ) 2 + ψ ˆ e x ( ξ ) 2 + 0 1 + | f ˆ ( ξ , η ) | 2 d ξ d η .

Proof From (4), we have

u ˆ e x ( ξ , y ) = 1 2 φ ˆ e x ( ξ ) ( e ( 1 y ) | ξ | + e ( y 1 ) | ξ | ) + ( 1 e 2 ( 1 y ) | ξ | 2 | ξ | e 2 ( 1 y ) | ξ | ) e ( 1 y ) | ξ | ψ ˆ e x ( ξ ) + y 1 ( e 2 ( η y ) | ξ | 1 2 | ξ | e 2 ( η y ) | ξ | ) e ( η y ) | ξ | f ˆ ( ξ , η ) d η .
(12)

Taking into account (7) and (11), we get

v ˆ e x ( , y ) u ˆ e x ( , y ) 2 2 = + | v ˆ e x ( ξ , y ) u ˆ e x ( ξ , y ) | 2 d ξ = + | v ˆ e x ( ξ , y ) u ˆ e x ( ξ , y ) | 2 χ [ β , β ] ( ξ ) d ξ + + | v ˆ e x ( ξ , y ) u ˆ e x ( ξ , y ) | 2 χ ( , β ) ( β , + ) ( ξ ) d ξ = + | v ˆ e x ( ξ , y ) u ˆ e x ( ξ , y ) | 2 χ [ β , β ] ( ξ ) d ξ + + | u ˆ e x ( ξ , y ) | 2 χ ( , β ) ( β , + ) ( ξ ) d ξ .

Moreover, one has, for 0y<1,

| 1 α + e ( y 1 ) | ξ | e ( 1 y ) | ξ | |α e 2 | ξ | .
(13)

By a similar way, we also have

| 1 α + e ( y η ) | ξ | e ( η y ) | ξ | |α e 2 | ξ | for 0<y<η<1.
(14)

Moreover, using the inequality e | x | 1 | x | e | x | , we have

| 1 e 2 ( η y ) | ξ | 2 | ξ | e 2 ( η y ) | ξ | |1for 0<y<η<1.
(15)

From (7), (11), (13), (14), (15), we obtain

v ˆ e x ( , y ) u ˆ e x ( , y ) 2 2 + ( 1 2 α e 2 | ξ | | φ ˆ e x ( ξ ) | + α e 2 | ξ | | ψ ˆ e x ( ξ ) | + α e 2 | ξ | 0 1 | f ˆ ( ξ , η ) | d η ) 2 χ [ β , β ] ( ξ ) d ξ + + 1 | ξ | 2 | ξ u ˆ e x ( ξ , y ) | 2 χ ( , β ) ( β , + ) ( ξ ) d ξ .

It follows from ( a + b + c ) 2 3( a 2 + b 2 + c 2 ) that

v ˆ e x ( , y ) u ˆ e x ( , y ) 2 2 1 4 α 2 + e 4 | ξ | | φ ˆ e x ( ξ ) | 2 χ [ β , β ] ( ξ ) d ξ + α 2 + e 4 | ξ | | ψ ˆ e x ( ξ ) | 2 χ [ β , β ] ( ξ ) d ξ + α 2 + ( 0 1 | f ˆ ( ξ , η ) | d η ) 2 e 2 | ξ | χ [ β , β ] ( ξ ) d ξ + + 1 | ξ | 2 | ξ u ˆ e x ( ξ , y ) | 2 χ ( , β ) ( β , + ) ( ξ ) d ξ 3 4 α 2 e 4 β + | φ ˆ e x ( ξ ) | 2 χ [ β , β ] ( ξ ) d ξ + 3 α 2 e 4 β + | ψ ˆ e x ( ξ ) | 2 χ [ β , β ] ( ξ ) d ξ + 3 α 2 e 4 β + ( 0 1 | f ˆ ( ξ , η ) | 2 d η ) χ [ β , β ] ( ξ ) d ξ + 1 β 2 + | ξ u ˆ e x ( ξ , y ) | 2 χ ( , β ) ( β , + ) ( ξ ) d ξ 3 4 α 2 e 4 β φ ˆ e x ( ξ ) 2 2 + 3 α 2 e 4 β ψ ˆ e x ( ξ ) 2 2 + 3 α 2 e 4 β 0 1 + | f ˆ ( ξ , η ) | 2 d ξ d η + 1 β 2 x u e x ( , y ) 2 2 .

Applying the inequality a 2 + b 2 + c 2 + d 2 a+b+c+d for a,b,c,d0, we obtain

v ˆ e x ( , y ) u ˆ e x ( , y ) 2 3 α e 2 β ( 1 2 φ ˆ e x ( ξ ) 2 + ψ ˆ e x ( ξ ) 2 + 0 1 + | f ˆ ( ξ , η ) | 2 d ξ d η ) + 1 β x u e x ( , y ) 2 .
(16)

According to the triangle inequality,

v ˆ ϵ ( , y ) u ˆ e x ( , y ) 2 v ˆ ϵ ( , y ) v ˆ e x ( , y ) 2 + v ˆ e x ( , y ) u ˆ e x ( , y ) 2

so using Parseval’s equality, (16) and Lemma 1, we get

v ϵ ( , y ) u e x ( , y ) 2 2 2 α ϵ + 3 α e 2 β ( 1 2 φ ˆ e x ( ξ ) 2 + ψ ˆ e x ( ξ ) 2 + 0 1 + | f ˆ ( ξ , η ) | 2 d ξ d η ) + 1 β x u e x ( , y ) 2 .

The choice of α= ϵ 1 / 2 and β=ln 1 ϵ 1 / 8 leads to

v ϵ ( , y ) u e x ( , y ) 2 C ln 1 ϵ ,

where

C = 2 2 + 3 M + 8 x u e x ( , y ) 2 , M = 1 2 φ ˆ e x ( ξ ) 2 + ψ ˆ e x ( ξ ) 2 + 0 1 + | f ˆ ( ξ , η ) | 2 d ξ d η .

This completes the proof of Theorem 1. □

Remark Theorem 1 gives a good approximation not only in the case 0<y<1 but also in the case y=0.

If we choose α= ϵ k , 0<k<1, and e 2 β α= ϵ m , m<k, then β= 1 ϵ k m and

v ϵ ( , y ) u e x ( , y ) 2 2 2 ϵ 1 k + 3 ϵ m ( 1 2 φ ˆ e x ( ξ ) 2 + ψ ˆ e x ( ξ ) 2 + 0 1 + | f ˆ ( ξ , η ) | 2 d ξ d η ) + ϵ k m x u e x ( , y ) 2 .

Let k= 1 2 and m= 1 4 , we have Theorem 1.

3 Numerical experiment

In this section, we present a simple example intended to demonstrate the usefulness of the approach. The test was performed using Matlab 6.1. The numerical example was constructed in the following way: first we selected the initial data u(x,1)=φ(x) and u y (x,1)=ψ(x). We have the following problem

Δu=f(x,y),xR,0<y<1,

where u satisfies

u ( x , 1 ) = φ ( x ) , u y ( x , 1 ) = ψ ( x ) .

Let φ ϵ (x,y), ψ ϵ be the disturbed measure data such that φ(x) φ ϵ (x)ϵ, ψ(x) ψ ϵ (x)ϵ.

For example, we take

f ( x , y ) = 4 ( 1 x 2 y 2 ) e x 2 y 2 , φ ( x ) = e x 2 1 , ψ ( x ) = 2 e x 2 1 , φ ϵ ( x ) = φ ( x ) + ϵ r a n d ( ) , ψ ϵ ( x ) = ψ ( x ) + ϵ r a n d ( ) .

In the numerical experiment, we always fix the interval 0x3.

For an exact data function φ(x), its discrete noisy version is

φ ϵ (x)=φ(x)+ϵ r a n d ( ) ,

where

φ= ( φ ( x 1 ) , , φ ( x N ) ) , x j =3+ 3 ( j 1 ) N 1 ,j=1,2,,N,

and

ϵ= φ ϵ φ = 1 N j = 1 N | φ ( x j ) φ ϵ ( x j ) | 2 .

The function r a n d ( ) generates arrays of random numbers whose elements are normally distributed with mean 0, variance σ 2 =1, and SD σ=1. N is the total test points at x-axis. In our computations, we always take N=100. Let us define the error estimate δ i , ϵ between the exact solution u(,y) and regularized solutions u i , ϵ (,y) at given value y

δ i , ϵ (y)= u ( , y ) u i , ϵ ( , y ) .

Here, u i , ϵ regularized solutions are calculated by the first regularization solution (i=1) with α= ϵ 1 / 2 , β= 1 ln 8 ϵ and the second regularization (i=2) with α= ϵ 1 / 2 , β= 1 ln 10 ϵ .

Table 1 shows the error estimate between the exact solution and the regularized solutions. In the table, we see that when ϵ= 10 1 the error estimations of the first method are slightly better than the error estimations of the second method. However, starting from ϵ= 10 3 , the second method gradually gives much better results.

Table 1 Error estimations for the first regularization solution ( δ 1 , ϵ ) and the second regularization solution ( δ 2 , ϵ )

Because the error estimations in L 2 are relatively big, it is difficult to see the effectiveness of our methods. For a better illustration, we define the relative error estimate between exact solution and regularized solutions as follows:

σ i , ϵ (y)= k = 1 I | u i , ϵ ( x k , y ) u ( x k , y ) | 2 k = 1 I | u ( x k , y ) | 2 .

Table 2 shows the relative error estimations between the exact solution and the first regularized solution ( σ 1 , ϵ ) and by the second regularization solution ( σ 2 , ϵ ). Obviously from the table, our proposed method is stable and effective.

Table 2 Relative error estimations for the first method ( σ 1 , ϵ ) and second regularization solution ( σ 2 , ϵ )

We also present some graphical representations of the exact solution and regularized solutions. Figure 2 is the 3-D representation of these solutions, and Figure 1 shows some graphs of section cut at value y=0.5, with ϵ= 10 i , i=1,3,5. From the graphs, we see that the second method gives very precise solution when ϵ= 10 5 .

Figure 1
figure 1

2D graphs of section cut at y=0.5 of the exact solution u(x,y) and regularized solutions u i , ϵ (x,y) .

Figure 2
figure 2

3D graphs of the exact solution u(x,y) and regularized solutions u i , ϵ (x,y) .