Next Article in Journal
Carrying Capacity of a Population Diffusing in a Heterogeneous Environment
Next Article in Special Issue
The Impact of the Discrepancy Principle on the Tikhonov-Regularized Solutions with Oversmoothing Penalties
Previous Article in Journal
A Lyapunov-Type Inequality for Partial Differential Equation Involving the Mixed Caputo Derivative
Previous Article in Special Issue
The Truncation Regularization Method for Identifying the Initial Value on Non-Homogeneous Time-Fractional Diffusion-Wave Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized-Fractional Tikhonov-Type Method for the Cauchy Problem of Elliptic Equation

1
School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China
2
Center for Faculty Development, North Minzu University, Yinchuan 750021, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2020, 8(1), 48; https://doi.org/10.3390/math8010048
Submission received: 20 November 2019 / Revised: 22 December 2019 / Accepted: 23 December 2019 / Published: 1 January 2020
(This article belongs to the Special Issue Numerical Analysis: Inverse Problems – Theory and Applications)

Abstract

:
This article researches an ill-posed Cauchy problem of the elliptic-type equation. By placing the a-priori restriction on the exact solution we establish conditional stability. Then, based on the generalized Tikhonov and fractional Tikhonov methods, we construct a generalized-fractional Tikhonov-type regularized solution to recover the stability of the considered problem, and some sharp-type estimates of convergence for the regularized method are derived under the a-priori and a-posteriori selection rules for the regularized parameter. Finally, we verify that the proposed method is efficient and acceptable by making the corresponding numerical experiments.

1. Introduction

Let Ω R n ( n 1 ) be a connected and bounded region, Ω be the smooth boundary of Ω , L x : H 2 ( Ω ) H 0 1 ( Ω ) L 2 ( Ω ) L 2 ( Ω ) be a linear elliptic operator, which is densely defined, self-adjoint and positive-definite with regard to the variable x. Suppose that the eigenvalues of L x are λ n ( n 1 ) , i.e., there is one nontrivial solution X n L 2 ( Ω ) , and it satisfies the below boundary problem
L x X n = λ n X n in Ω , X n = 0 , on Ω .
Further assume that the eigenvalues of L x satisfies
0 < λ 1 λ 2 λ 3 , lim n λ n = .
The present article studies the problem below
w y y ( y , x ) L x w ( y , x ) = 0 , x Ω , 0 < y < T , w ( y , x ) = 0 , x Ω , 0 y T , w ( 0 , x ) = φ ( x ) , x Ω , w y ( 0 , x ) = ψ ( x ) , x Ω ,
which is a Cauchy problem for elliptic-type equation. We seek u ( y , · ) ( 0 < y T ) under the Cauchy datum φ , ψ L 2 ( Ω ) are given.
In many engineering and science areas, the Cauchy problem for elliptic-type equations has many important applications, see [1,2,3,4]. Note that, as L x = 2 x 2 , (3) is a special ill-posed problem—the Cauchy problem of the Laplace equation. If L x = 2 x 2 + k 2 ( k > 0 ), we know that (3) becomes the Cauchy problem of modified Helmholtz equation.
In fact, we can divided (3) into two linear problem
u y y ( y , x ) L x u ( y , x ) = 0 , x Ω , 0 < y < T , u ( y , x ) = 0 , x Ω , 0 y T , u ( 0 , x ) = φ ( x ) , x Ω , u y ( 0 , x ) = 0 , x Ω ,
and
v y y ( y , x ) L x v ( y , x ) = 0 , x Ω , 0 < y < T , v ( y , x ) = 0 , x Ω , 0 y T , v ( 0 , x ) = 0 , x Ω , v y ( 0 , x ) = ψ ( x ) , x Ω ,
thus, the solution of (3) can be expressed as w = u + v .
It can be found that many scholars have researched this kind of problem in the aspect of theory and algorithm, such as [5,6,7,8,9,10,11,12,13,14,15,16,17], and so on. In [14], the author solved (4), (5) by constructing a generalized Tikhonov regularization method, meanwhile derived the a-priori convergence estimate of regularized method. In [18], Hochstenbach-Reichel studied the ill-posed problems of discrete type by using a fractional Tikhonov regularization method. In the present paper, by placing the a-priori restrictions on the exact solutions, we establish and prove the conditional stability of problems (4), (5). Meanwhile, inspired by the methods in [14,18], we develop a generalized-fractional Tikhonov-type regularization method to do with (4), (5), then adopt the a-priori and a-posteriori rules to choose the regularized parameters, and give and prove some sharp estimates of convergence for our method. In fact, the proposed method is a generalization for the nonlocal boundary value problem method (or quasi-boundary value method), the boundary (or modified) Tikhonov method, and the generalized Tikhonov method, it also can be regarded as a modification on the fractional Tikhonov method (see Remark 1). So far, there are no related references where this method is proposed to study (4), (5). In the numerical simulation aspect, we also notice that the computation effect of this method is also efficient and feasible.
We arrange the structure of the article as below. We give the conditional stabilities of problems (4), (5) in Section 2. Section 3 describes the construction procedure of regularization method, and Section 4 provides some necessary preparation knowledge. We give the results of convergence estimate in Section 5. Section 6 is arranged as the numerical simulation part. A summary of the article and further outlook are given in Section 7. The proofs of related Lemmas and Theorems are arranged in Appendix A.

2. Conditional Stability

The conditional stability means that the solution is continuously dependent on the given datum under certain additional condition [5,19,20]. This section establishes the conditional stability of problems (4), (5) by imposing the corresponding a-priori conditions for the exact solutions.
Define
D γ , q ξ = ξ L 2 ( Ω ) ; n = 1 λ n 2 γ e 2 q T λ n < ξ , X n > 2 < + , γ 1 , q > 1 ,
where < · , · > is the inner product in L 2 ( Ω ) , X n = X n ( x ) are the eigenfunctions of L x , and it is the orthogonal basis of space L 2 ( Ω ) . We define the norm of D γ , q ξ as
ξ D γ , q ξ = n = 1 λ n 2 γ e 2 q T λ n < ξ , X n > 2 1 / 2 .
By adopting the Fourier method, we respectively can express the solutions of (4) and (5) as
u ( y , x ) = n = 1 cosh ( λ n y ) φ n X n , φ n = φ , X n ,
v ( y , x ) = n = 1 sinh ( λ n y ) λ n ψ n X n , ψ n = ψ , X n .
In 1996, [14] considered problems (4) and (5). For (4), the author formulated the problem as
A 1 ( y ) u ( y , x ) = u ( 0 , x ) = φ ( x ) ,
here the linear operator A 1 ( y ) = 1 / cosh ( L x y ) : L 2 ( Ω ) L 2 ( Ω ) is self-adjoint and compact, and 1 / cosh ( λ n y ) are its eigenvalues, X n are the corresponding eigenelements. For (5), the author formulated the problem as
A 2 ( y ) v ( y , x ) = v y ( 0 , x ) = ψ ( x ) ,
here A 2 ( y ) = L x / sinh ( L x y ) : L 2 ( Ω ) L 2 ( Ω ) is self-adjoint, linear bounded, and compact, λ n / sinh ( λ n y ) are its eigenvalues, X n are the corresponding eigenelements.
Below, we give the conditional stabilities for problems (4) and (5), respectively.
Theorem 1.
Assume that u ( T , x ) satisfies
u ( T , x ) D γ , q u E ,
then the below stability estimate of condition can be established
u ( y , x ) L 2 ( Ω ) 2 y q T λ 1 γ e λ 1 T y q T E y q T φ L 2 ( Ω ) 1 y q T .
Theorem 2.
Suppose that v ( T , x ) satisfies
v ( T , x ) D γ , q v E ,
then we can establish the following result of conditional stability
v ( y , x ) L 2 ( Ω ) 2 y q T λ 1 1 2 γ q T 2 y e λ 1 T 1 e 2 λ 1 T y q T E y q T ψ L 2 ( Ω ) 1 y q T .

3. Regularization Method

From (8), (9), we know that, as n , the limits of the sequences { cosh ( λ n y ) } and sinh ( λ n y ) λ n are infinities, respectively, hence problems (4), (5) are both severely ill-posed. To recover the continuous dependence of the solutions on the datum φ , ψ , we need construct the corresponding regularization solutions for (4), (5). For the references which describe the usual regularization theory, we can refer to [21,22], etc.

3.1. Regularization Method for Problem (4)

In [14], the author considered (4) and expressed it as the operator equation (10). Then let γ > 0 , φ δ ( x ) = u δ ( 0 , x ) be the observation data, δ is the observed error bound, μ is the regularized parameter, the author proposed a generalized Tikhonov method by solving the minimum value problem
min u L 2 ( Ω ) J μ ( u ) , J μ ( u ) = 1 cosh ( L x y ) u u δ ( 0 , x ) 2 + μ L x γ 2 cosh ( L x T ) cosh ( L x y ) u 2 ,
denote u μ δ ( y , x ) be the regularization solution, then it satisfies the normal equation
1 cosh 2 ( L x y ) + μ L x γ cosh 2 ( L x T ) cosh 2 ( L x y ) u μ δ ( y , x ) = 1 cosh ( L x y ) u δ ( 0 , x ) ,
from (17), we can get that the regularized solution is
u μ δ ( y , x ) = n = 1 cosh ( λ n y ) φ n δ 1 + μ λ n γ cosh 2 ( λ n T ) X n ( x ) ,
where φ n δ = φ δ , X n L 2 ( Ω ) , the error data φ δ satisfies
φ δ φ L 2 ( Ω ) δ .
In 2011, Hochstenbach-Reichel studied the ill-posed problems of discrete type by using a fractional Tikhonov regularization method [18]. Note that, if applying the method of [18] to problem (4), we can write the regularized solution as
u μ δ ( y , x ) = n = 1 cosh ( λ n y ) φ n δ 1 + μ cosh q ( λ n y ) X n ( x ) , q > 1 .
Inspired by the ideas of [14,18], setting γ 1 , q > 1 , α is the regularized parameter, we develop a generalized-fractional Tikhonov-type regularized solution u α δ ( y , x ) by solving the minimum value problem
min u L 2 ( Ω ) J α ( u ) , J α ( u ) = 1 cosh ( L x y ) u u δ ( 0 , x ) 2 + α L x γ 2 cosh q 2 ( L x T ) cosh ( L x y ) u 2 ,
from the necessary condition of the first order, we know that u α δ ( y , x ) satisfies the normal equation
1 cosh 2 ( L x y ) + α L x γ cosh q ( L x T ) cosh 2 ( L x y ) u α δ ( y , x ) = 1 cosh ( L x y ) u δ ( 0 , x ) ,
from (22), we can express the regularized solution of (4) as
u α δ ( y , x ) = n = 1 cosh ( λ n y ) φ n δ 1 + α λ n γ cosh q ( λ n T ) X n ( x ) , q > 1 .
Remark 1.
In the process of definition for the regularization solution (23), we always assume that γ 1 and q > 1 , this assumption mainly is used to derive the sharp convergence estimate of regularization method. In fact, if γ = 0 , q = 1 , the method in this paper becomes the nonlocal boundary value problem method (or quasi-boundary value method) in [13]. If γ = 0 , q > 1 , compared with (20), (23) can be seen as a modification on fractional Tikhonov method in [18]. When γ = 0 , q = 2 , our method is the boundary (or modified) Tikhonov method (you can see [23,24], etc). As γ > 0 , q = 2 , our method is the generalized Tikhonov method in [14]. In summary, the proposed method in this paper is a meaningful expansion and extension on the these existing works.

3.2. Regularization Method for Problem (5)

For (5), [14] expressed it as the operator equation (11) equivalently. Then let γ > 0 , μ is the regularized parameter, δ is the bound of observed error, ψ δ ( x ) = v y δ ( 0 , x ) is the observed data, the author designed a generalized Tikhonov regularized method by solving the minimum value problem below
min v L 2 ( Ω ) J μ ( v ) , J μ ( v ) = L x sinh ( L x y ) v v y δ ( 0 , x ) 2 + μ L x γ 2 sinh ( L x T ) sinh ( L x y ) v 2 ,
denote v μ δ ( y , x ) be the regularized solution, then it satisfies the normal equation
L x sinh 2 ( L x y ) + μ L x γ sinh 2 ( L x T ) sinh 2 ( L x y ) v α δ ( y , x ) = L x sinh ( L x y ) v y δ ( 0 , x ) ,
from (25), the expression of the regularized solution of (5) is
v μ δ ( y , x ) = n = 1 sinh ( λ n y ) ψ n δ λ n ( 1 + μ λ n γ 1 sinh 2 ( λ n T ) ) X n ( x ) ,
where ψ n δ = ψ δ , X n L 2 ( Ω ) , and
ψ δ ψ L 2 ( Ω ) δ .
Meanwhile, if applying the fractional Tikhonov method of Hochstenbach-Reichel [18] to problem (5), the expression of regularization solution is
v μ δ ( y , x ) = n = 1 sinh ( λ n y ) ψ n δ X n ( x ) λ n 1 + μ sinh ( λ n y ) / λ n q , q > 1 .
Similar with Section 3.1, let γ 1 , q > 1 , β be the regularized parameter, by solving the following minimization problem we constructed a generalized-fractional Tikhonov-type regularization solution of (5)
min v L 2 ( Ω ) J β ( v ) , J β ( v ) = L x sinh ( L x y ) v v y δ ( 0 , x ) 2 + β L x γ 2 sinh q 2 ( L x T ) sinh ( L x y ) v 2 ,
from the necessary condition of the first order, we can derive that the regularized solution v β δ ( y , x ) satisfies the normal equation
L x sinh 2 ( L x y ) + β L x γ sinh q ( L x T ) sinh 2 ( L x y ) v β δ ( y , x ) = L x sinh ( L x y ) v y δ ( 0 , x ) ,
from (30), the expression of regularized solution of (5) is
v β δ ( y , x ) = n = 1 sinh ( λ n y ) ψ n δ λ n 1 + β λ n γ 1 sinh q ( λ n T ) X n ( x ) , q > 1 .

4. Preparation Knowledge

We need three functions and get help from some useful inequalities, which will be used in the procedure of the proof for the convergence of regularized solutions.
Let α , β > 0 , 0 < y T , the following two functions G 1 ( λ n ) and G 2 ( λ n ) are defined
G 1 ( λ n ) = e ( q T y ) λ n α 2 q λ n γ + e q T λ n , γ 1 , q > 1 ,
G 2 ( λ n ) = e ( q T y ) λ n λ 1 β λ n γ 1 1 e 2 λ 1 T 2 q + e q T λ n , γ 1 , q > 1 .
Simultaneously, the function H ( η ) also will be used, and it is given in [13].
H ( η ) = η η ( 1 η ) 1 η , η ( 0 , 1 ) . 1 , η = 0 , 1 ,
Lemma 1.
[13] Assume that 0 r s < , s 0 , ν > 0 , thus
ν e r ν + e s H r s ν r s .
Theorem 3.
Assume that α > 0 , G 1 ( λ n ) is given by (32), hence we can derive that
G 1 ( λ n ) 2 C 1 α y q T , C 1 = max { 1 , ( λ 1 γ ) 1 } .
Theorem 4.
Suppose that β > 0 , G 2 ( λ n ) is the function given in (33), we have the result as below
G 2 ( λ n ) 2 D 1 β y q T , D 1 = C 1 λ 1 y q T 1 2 1 e 2 λ 1 T y T .

5. Convergence Estimate

This section gives the a-priori and a-posteriori convergence results of the proposed method.

5.1. The Estimate of Convergence for the Method in (4)

5.1.1. The Estimate of a-Priori Convergence

Theorem 5.
We denote u, u α δ as the exact and regularized solutions given in (8) and (23), respectively, φ δ denotes the observed data and satisfy (19). Assume that there holds the a-priori condition
u ( T , · ) D γ , q u 2 = n = 1 λ n 2 γ e 2 q T λ n | u ( T , · ) , X n | 2 E 2 ,
α is the regularized parameter, and we select it by
α = δ / E ,
thus we can establish the below result of convergence
u α δ ( y , · ) u ( y , · ) 4 C 1 E y q T δ 1 y q T .

5.1.2. The Estimate of a-Posteriori Convergence

In Theorem 5, we adopt the a-priori rule to select the regularized parameter α , i.e., α = δ / E . But in some actual problems, since the analysis form of the exact solution cannot be sought easily, the computation of E usually has certain difficulty. In view of this, it is necessary to consider the a-posteriori selection rule of α . Now, we give an a-posteriori rule and use it to choose α , which is similar to the discrepancy principle described in [25]. In this rule, the regularized parameter α only depends on the bound of observed error δ and the observed data φ δ , we need not know the a-priori bound E.
We choose α by the equation below
u α δ ( 0 , x ) φ δ ( x ) = τ δ , τ > 1 .
The following two Lemmas are necessary and meaningful in deriving the a-posteriori result of convergence.
Lemma 2.
Denote the function ρ ( α ) = u α δ ( 0 , x ) φ δ ( x ) , then there hold the following assertions: (i) In the interval ( 0 , + ) , ρ ( α ) is consecutive; (ii) lim α 0 ρ ( α ) = 0 ; (iii) lim α + ρ ( α ) = φ δ ; (iv) For α ( 0 , + ) , ρ ( α ) is increasing and strictly incremental.
Lemma 3.
Let τ > 1 , the regularized parameter α = α ( δ , φ δ ) determined by (41) satisfies that α ( τ 1 ) e λ 1 T 2 δ E .
Theorem 6.
Let u, u α δ be the exact and regularized solutions given in (8) and (23), respectively, φ δ denotes the observed data and satisfy (19). Assume that there holds the a-priori condition (38), the regularized parameter is selected by (41), then the below a-posteriori estimate of convergence can be established
u α δ ( y , · ) u ( y , · ) C 2 E y q T δ 1 y q T ,
where C 2 = max 2 C 1 ( τ 1 ) e λ 1 T / 2 y q T , 2 y q T λ 1 γ e λ 1 T y q T ( τ + 1 ) 1 y q T .
Remark 2.
We all know that, as we use one regularized method to solve the ill-posed operator equation K f = g , let δ be the observed error bound, g δ denotes the error data which satisfies g δ g < δ , f α δ is the regularization solution, the basic idea of selecting the regularized parameter by a-posteriori rule is to seek α by K f α δ g δ = τ δ , ( τ > 1 ). Based on this description, we can verify that the a-posteriori selection rule (41) actually can written as A 1 ( y ) u α δ ( y , · ) φ δ ( x ) = τ δ , so it is consistent with the idea of [25].

5.2. The Estimate of Convergence for the Method in (5)

5.2.1. The Estimate of a-Priori Convergence

Theorem 7.
Let v given by (9), v β δ defined by (31) be the exact and regularized solutions, respectively, ψ δ is the observation data and (27) is satisfied. Assume that the a-priori condition
v ( T , · ) D γ , q v 2 = n = 1 λ n 2 γ e 2 q T λ n | v ( T , · ) , X n | 2 E 2 ,
is valid, and we choose the regularized parameter β as
β = δ / E ,
thus, the below estimate of convergence can be derived
v β δ ( y , · ) v ( y , · ) 2 1 + 1 / ( λ 1 e λ 1 y ) D 1 E y q T δ 1 y q T .

5.2.2. The Estimate of a-Posteriori Convergence

Let us seek β by the equation below
( v β δ ) y ( 0 , x ) ψ δ ( x ) = τ δ , τ > 1 .
Lemma 4.
Denote ϱ ( β ) = ( v β δ ) y ( 0 , x ) ψ δ ( x ) , there hold the following assertions: (i) β ( 0 , + ) , ϱ ( β ) is consecutive; (ii) lim β 0 ϱ ( β ) = 0 ; (iii) lim β + ϱ ( β ) = ψ δ ; (iv) ϱ ( β ) increases strictly in the interval ( 0 , + ) .
Lemma 5.
Let τ > 1 is a constant, the regularized parameter β = β ( δ , ψ δ ) determined by (46) satisfies that β λ 1 sinh ( λ 1 T ) ( τ 1 ) δ E .
Theorem 8.
Let v, v β δ be given in (9), (31), respectively, ψ δ is the observed data and (27) is satisfied. We assume (43) to be true, and choose the regularized parameter β by a-posteriori rule (46), then the a-posteriori estimate of convergence below can be established
v β δ ( y , · ) v ( y , · ) D 2 E y q T δ 1 y q T ,
where D 2 = max 2 D 1 λ 1 sinh ( λ 1 T ) ( τ 1 ) y q T , 2 y q T λ 1 1 2 γ q T 2 y e λ 1 T 1 e 2 λ 1 T y q T ( τ + 1 ) 1 y q T .
Remark 3.
We can verify that the a-posteriori selection rule (46) is equivalent to the form A 2 ( y ) v β δ ( y , · ) ψ δ ( x ) = τ δ , which is also consistent with the idea of [25].
Remark 4.
We derive the sharp results of convergence (40), (42), (45), and (47) by imposing the a-priori assumptions (38), (43) and applying the conclusions of Theorems 3, 4. We know that (38) and (43) are the stronger conditions, however we can verify that they can be accepted and natural, we can set some functions that satisfy this two conditions. For example, in order to verify the feasibility of (38), we take T = 1 , L x = 2 x 2 : H 2 ( 0 , π ) H 0 1 ( 0 , π ) L 2 ( 0 , π ) L 2 ( 0 , π ) , here λ n = n 2 , X n ( x ) = 2 / π sin ( n x ) . Taking u ( y , x ) = sin ( x ) cosh ( y ) , then
u ( T , · ) D γ , q u 2 = n = 1 n 4 γ e 2 n q T | u ( T , · ) , X n | 2 = n = 1 n 4 γ e 2 n q T π 2 cosh ( T ) 2 π sin ( x ) , 2 π sin ( n x ) 2 = e 2 q T π 2 cosh ( T ) 2 π sin ( x ) , 2 π sin ( x ) 2 = ( 2 / π ) e 2 q T cosh 2 ( T ) 0 π sin 2 x d x 2 = ( π / 2 ) e 2 q T cosh 2 ( T ) .
For all γ 1 , q > 1 , there always exists a positive number μ, subject to μ > q , hence it can be obtained
u ( T , · ) D γ , q u 2 = n = 1 n 4 γ e 2 n q T | u ( T , · ) , X n | 2 = ( π / 2 ) e 2 q T cosh 2 ( T ) ( π / 2 ) e 2 μ T cosh 2 ( T ) .
Choosing E = E ( μ ) = π / 2 e μ T cosh ( T ) , we can find that u ( y , x ) = sin ( x ) cosh ( y ) satisfies (38). Note that, as setting u ( y , x ) = sin ( l x ) cosh ( l y ) , these functions also satisfy (38). For the feasibility of (43), we can explain it by adopting the similar way as above, and it is ignored here.
Remark 5.
We can apply this regularized method to solve the following classical problem
Δ u ( y , x ) + k 2 u ( y , x ) = 0 , x ( 0 , π ) , y ( 0 , 1 ) , u ( 0 , x ) = φ ( x ) , x [ 0 , π ] , u y ( 0 , x ) = 0 , x [ 0 , π ] , u ( y , 0 ) = u ( y , π ) = 0 , y [ 0 , 1 ] ,
this is a Cauchy problem for Helmholtz equation in rectangular area. Using the Fourier method, we can express the exact solution as
u ( y , x ) = n = 1 [ k ] cos k 2 n 2 y φ n X n ( x ) + n = [ k ] + 1 cosh n 2 k 2 y φ n X n ( x ) ,
denote · , · as the inner product of L 2 ( 0 , π ) , then in (49), φ n = φ ( x ) , X n , the eigenfunction of L 2 ( 0 , π ) is X n ( x ) = 2 π sin ( n x ) .
Since the main factor that leads to the ill-posedness of (48) is the second term of right hand side in (49), similar with the procedure of Section 3.1, we can construct the following regularization solution of (48)
u α δ ( y , x ) = n = 1 [ k ] cos k 2 n 2 y φ n δ X n + n = [ k ] + 1 cosh ( n 2 k 2 y ) φ n δ 1 + α ( n 2 k 2 ) γ cosh q ( n 2 k 2 T ) X n ,
here φ n δ = φ δ , X n , α is the regularization parameter. About the convergence estimate, the process is almost the same as one in this paper, we omit it.

6. Numerical Experiments

In this section, by doing the corresponding numerical experiment we verify the simulation effect of the proposed method. For convenience, we only investigate the case of inhomogeneous Dirichlet data in two dimensions.
Example 1.
Let k > 0 , the following problem is investigated
u y y + u x x k 2 u = 0 , 0 < x < π , 0 < y < 1 , u ( 0 , x ) = φ ( x ) , 0 x π , u y ( 0 , x ) = 0 , 0 x π , u ( y , 0 ) = u ( y , π ) = 0 , 0 y 1 ,
here, we take x Ω = ( 0 , π ) , L x = 2 x 2 + k 2 : H 2 ( Ω ) H 0 1 ( Ω ) L 2 ( Ω ) L 2 ( Ω ) , λ n = n 2 + k 2 , X n ( x ) = 2 π sin ( n x ) are the eigenvalues and eigenfunction of L x , respectively. This is a classical ill-posed problem—the Cauchy problem for the modified Helmholtz equation. Generally, since the reconstruction of solution at y = 1 is the most difficult, we mainly verify the computational effect of regularization method at this point.
We know that, if Ω is a more complex domain, generally the analysis form of the exact solution for a considered problem cannot be found easily, which leads to certain difficulty in constructing the exact data φ ( x ) , so in order to overcome this problem and possess the representativeness, we consider the forward problem below
u y y + u x x k 2 u = 0 , 0 < x < π , 0 < y < 1 , u ( 1 , x ) = f ( x ) , 0 x π , u y ( 0 , x ) = 0 , 0 x π , u ( y , 0 ) = u ( y , π ) = 0 , 0 y 1 ,
and use a finite difference method to solve problem (52), here f ( x ) = ( 1 + k 2 ) x ( x π ) , and u x x , u y y , u y ( 0 , x ) are approximated by
u x x ( y , x ) u ( y , x + Δ x ) 2 u ( y , x ) + u ( y , x Δ x ) ( Δ x ) 2 ,
u y y ( y , x ) u ( y + Δ y , x ) 2 u ( y , x ) + u ( y Δ y , x ) ( Δ y ) 2 ,
u y ( 0 , x ) 2 u y ( Δ y , x ) u y ( 2 Δ y , x ) u ( 2 Δ y , x ) u ( 0 , x ) Δ y u ( 3 Δ y , x ) u ( Δ y , x ) 2 Δ y ,
where Δ x = π ι , Δ y = 1 κ . Thus, the discrete form of (52) can be expressed as
( Δ y ) 2 u p , i 1 ( k 2 ( Δ x ) 2 ( Δ y ) 2 + 2 ( Δ y ) 2 + 2 ( Δ x ) 2 ) u p , i + ( Δ y ) 2 u p , i + 1 + ( Δ x ) 2 u p 1 , i + ( Δ x ) 2 u p + 1 , i = 0 , p = 1 , 2 , , κ 1 ; i = 1 , 2 , , ι 1 , u κ , i = f i , i = 1 , 2 , , ι 1 , 2 u 0 , i + u 1 , i + 2 u 2 , i u 3 , i = 0 , i = 1 , 2 , , ι 1 , u p , 0 = u p , ι = 0 , p = 0 , 1 , 2 , , κ ,
where u p , i are the approximate values at ( y p , x i ) , x i = i Δ x , i = 0 , 1 , 2 , , ι , y p = p Δ y , p = 0 , 1 , 2 , , κ .
Denote u dif as the difference solution of (52), then we choose the exact data as
φ ( x ) = u ( x , 0 ) u dif ( x , 0 ) ,
the observation data is randomly generated by
φ δ ( x ) = φ ( x ) + ε randn ( size ( φ ( x ) ) ) .
We calculate the bound of observation error δ by
δ : = φ δ φ l 2 .
The regularized solution is calculated by (23) for n = 1 , 2 , , M , the error is computed by
ϵ ( u ) = u u α δ l 2 u l 2 .
For k = 0.5 , 1.5 , γ = 2 , q = 4 , the exact and regularized solutions for various ε are shown in Figure 1 and Figure 2. We also investigate the influence of q on numerical results by taking ε = 0.01 , γ = 3 to compute the errors for the different q, Table 1 presents the computational results. Meanwhile, we choose ε = 0.01 , q = 5 to investigate the influence of γ on calculation effect, Table 2 shows the corresponding results. In practice, we cannot acquire the a-priori bound E for exact solution easily, so in the process of computation, the regularized solution is only calculated by the rule of a-posteriori form (41) with τ = 1.1 .
Figure 1 and Figure 2, Table 1 and Table 2 show that generalized-fractional Tikhonov-type is stable and feasible. Table 1 indicates that, for the same ε and fixed γ , as q becomes large, the numerical results gradually become steady, and the best value of it should be greater than or equal to 4. The results of Table 2 mean that the errors also become stable as γ increases for the same ε and fixed q, and the best value of γ should be greater than or equal to 2.

7. Conclusions and Discussion

We establish the conditional stabilities by placing the a-priori restrictions on exact solutions of (4), (5). Based on the generalized Tikhonov and fractional Tikhonov method, we construct a generalized-fractional Tikhonov-type regularized solution to recover the stability of the considered problem, and the convergence estimates of a-priori and an a-posteriori forms for this method are obtained. Ultimately, by doing the related numerical simulations, we verify that the proposed method is efficient and acceptable.
In fact, our regularized method can be seen as a variational method. Recently, we note that there are some new works in which the variational regularized methods are researched, such as [26,27,28,29,30], and so on. Meanwhile, this method is based on the eigenvalues and eigenfunctions of the operator involved. This means it is of limited applicability since often these are not explicitly known. For instance, many problems in science and engineering usually can be transformed into the form of operator equations (10) or (11). For each fixed y, (10) and (11) both can be expressed as the Fredholm integral operator with the first kind ( A U ) ( x ) : = Ω K ( x , ξ ) U ( ξ ) d ξ = Φ ( x ) . In order to overcome the ill-posedness of this integral equation, we often discretize it to obtain the operator equation of discrete form A U = Φ , and then restore the numerical stability by imposing one regularization method (such as the Tikhonov method) on the operator equation of discrete form. Note that if the numerical approximations of eigenfunctions or eigenvalues of the operator L x are known, we can conveniently compute the integral kernel K ( x , ξ ) , coefficient matrix A , and construct the regularization solution. Then, if we can obtain the numerical approximations of eigenfunctions or eigenvalues of the operator L x , this method can be extended to some broader application areas. In the future, we need make further consideration in this respect and study some practical problems in science and engineering.
We should point out that, in the procedure of the computation, we need to choose suitable parameters which include the regularization parameter α , the number of truncated term and positive numbers γ , q. We choose the number of truncated term, γ and q by using the a-priori method, but the a-posteriori method is not investigated. It is necessary to study the a-posteriori selection method for the number of truncated term, γ and q in the next works. Finally, we point out that this method also can be used to solve some other inverse problems of partial differential equations, such as the elliptic problem of quasi-linear case, inverse initial value problem of heat equation (also called final value problem of heat equation, or parabolic problem backward in time), and so on.

Author Contributions

Investigation, Writing—original draft preparation, H.Z.; Investigation, Writing—review and editing, X.Z. All authors have read and agreed to the published version of the manuscript.

Funding

The work was supported by the NSF of China (11761004), NSF of Ningxia (2019AAC03128) and SRP(2017SXKY05) at North Minzu University.

Acknowledgments

The authors would like to thank the reviewers for their constructive comments and valuable suggestions that improve the quality of our paper.

Conflicts of Interest

The authors declare that they have no conflict of interest.

Appendix A

Proof of Theorem 1.
We know that, as 0 < y T , n 1 , it holds that e λ n y / 2 cosh ( λ n y ) e λ n y , λ n λ 1 , from Hölder inequality and (8), (12), it can be derived that
u ( y , x ) L 2 ( Ω ) 2 n = 1 cosh 2 ( λ n y ) φ n 2 = n = 1 cosh 2 ( λ n y ) φ n 2 y q T φ n 2 2 y q T n = 1 ( cosh ( λ n y ) ) 2 q T y φ n 2 y q T n = 1 φ n 2 1 y q T n = 1 ( e λ n y ) 2 q T y φ n 2 y q T n = 1 φ n 2 1 y q T = n = 1 1 λ n 2 γ cosh 2 ( λ n T ) · λ n 2 γ e 2 q T λ n cosh 2 ( λ n T ) φ n 2 y q T n = 1 φ n 2 1 y q T 4 λ 1 2 γ e 2 λ 1 T y q T n = 1 λ n 2 γ e 2 q T λ n | < u ( T , x ) , X n ( x ) > | 2 y q T n = 1 φ n 2 1 y q T 2 λ 1 γ e λ 1 T 2 y q T E 2 y q T φ L 2 ( Ω ) 2 2 y q T .
The proof is completed. □
Proof of Theorem 2.
For 0 < y T , n 1 , we know that sinh ( λ n y ) e λ n y , and λ n λ 1 , sinh ( λ n y ) e λ 1 y ( 1 e 2 λ 1 y ) / 2 , then from (9), (14) and Hölder inequality, we have
v ( y , x ) L 2 ( Ω ) 2 n = 1 sinh ( λ n y ) λ n 2 q T y ψ n 2 y q T n = 1 ψ n 2 1 y q T n = 1 e λ n y λ n 2 q T y ψ n 2 y q T n = 1 ψ n 2 1 y q T = n = 1 e 2 q T λ n ψ n 2 1 λ n 2 q T y y q T n = 1 ψ n 2 1 y q T = n = 1 λ n 2 λ n 2 γ sinh 2 ( λ n T ) · λ n 2 γ e 2 q T λ n sinh 2 ( λ n T ) ( λ n ) 2 ψ n 2 1 λ n 2 q T y y q T n = 1 ψ n 2 1 y q T n = 1 λ 1 2 2 q T y λ 1 2 γ · 4 e 2 T λ 1 1 e 2 T λ 1 2 λ n 2 γ e 2 q T λ n | < v ( T , x ) , X n ( x ) > | 2 y q T n = 1 ψ n 2 1 y q T 2 λ 1 1 q T y λ 1 γ e T λ 1 1 e 2 T λ 1 2 y q T n = 1 λ n 2 γ e 2 q T λ n | < v ( T , x ) , X n ( x ) > | 2 y q T n = 1 ψ n 2 1 y q T 2 λ 1 1 q T y λ 1 γ e T λ 1 1 e 2 T λ 1 2 y q T E 2 y q T ψ L 2 ( Ω ) 2 2 y q T .
This finishes the proof of the result in (15). □
Proof of Theorem 3.
We select ν = α λ n γ 2 q , r = ( q T y ) λ n , s = q T λ n , use Lemma 1, and H ( η ) 1 , then
G 1 ( λ n ) = e ( q T y ) λ n α 2 q λ n γ + e q T λ n = 1 α 2 q λ n γ α 2 q λ n γ · e ( q T y ) λ n α 2 q λ n γ + e q T λ n α λ n γ 2 q 1 · H q T y q T α λ n γ 2 q q T y q T = 1 y q T 1 y q T y q T y q T α λ n γ 2 q y q T = 2 y T ( λ n γ ) y q T 1 y q T 1 y q T y q T y q T α y q T 2 ( λ n γ ) y q T α y q T .
Note that, ( λ n γ ) y q T ( λ 1 γ ) y q T . If λ 1 1 , then ( λ 1 γ ) y q T 1 ; as 0 < λ 1 < 1 , from y < q T , we get that ( λ 1 γ ) y q T ( λ 1 γ ) 1 . Setting C 1 = max { 1 , ( λ 1 γ ) 1 } , one can derive that, ( λ n γ ) y q T ( λ 1 γ ) y q T C 1 , and thus G 1 ( λ n ) 2 C 1 α y q T . □
Proof of Theorem 4.
Selecting ν = β λ n γ 1 1 e 2 λ 1 T 2 q , r = ( q T y ) λ n , s = q T λ n in Lemma 1, and combining with H ( η ) 1 , one can obtain the inequality (37). □
Proof of Theorem 5.
In (23), we take the exact data φ , and denote the corresponding solution as u α , then
u α δ u u α δ u α + u α u ,
For 0 < y T , e λ n y / 2 cosh ( λ n y ) e λ n y , from (23), (36), (19), we note that
u α δ ( y , · ) u α ( y , · ) 2 n = 1 cosh ( λ n y ) 1 + α λ n γ cosh q ( λ n T ) 2 φ n δ φ n 2 n = 1 e ( q T y ) λ n α λ n γ 2 q + e q T λ n 2 φ n δ φ n 2 4 C 1 2 δ 2 α 2 y q T .
On the other hand, by (8), (23), (36), (38), we can derive that
u α ( y , · ) u ( y , · ) 2 = n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) cosh ( λ n y ) φ n X n 2 n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) 2 cosh ( λ n T ) φ n 2 α 2 n = 1 e ( q T y ) λ n α λ n γ 2 q + e q T λ n 2 λ n 2 γ e 2 λ n ( q T y ) | u ( T , · ) , X n | 2 α 2 n = 1 e ( q T y ) λ n α λ n γ 2 q + e q T λ n 2 λ n 2 γ e 2 q T λ n | u ( T , · ) , X n | 2 4 C 1 2 α 2 2 y q T E 2 .
From (A1), (A2), (A3), (39), and (19), one can obtain the estimate in (40). □
Proof of Lemma 2.
By setting
ρ ( α ) = n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) 2 φ n δ 2 1 / 2 ,
one can prove it easily, here we omit it. □
Proof of Lemma 3.
According to (41), we can obtain that
τ δ = n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) φ n δ X n ( x ) n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) ( φ n δ φ n ) X n ( x ) + n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) φ n X n ( x ) δ + n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) φ n X n ( x ) ,
and
n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) φ n X n ( x ) n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) 2 φ n 2 1 / 2 n = 1 α 2 λ n 2 γ cosh 2 q ( λ n T ) φ n 2 1 / 2 n = 1 α 2 cosh 2 ( λ n T ) · λ n 2 γ e 2 q T λ n cosh 2 ( λ n T ) φ n 2 1 / 2 n = 1 4 α 2 e 2 λ n T · λ n 2 γ e 2 q T λ n | u ( T , · ) , X n | 2 1 / 2 ( 2 / e λ 1 T ) α E ,
by (A5), (A6), ( τ 1 ) δ ( 2 / e λ 1 T ) α E . We finish its proof. □
Proof of Theorem 6.
Similar to (A1), by the trigonometric inequality, then
u α δ ( y , · ) u ( y , · ) u α δ ( y , · ) u α ( y , · ) + u α ( y , · ) u ( y , · ) .
By (A2) and the inequality given in Lemma 3, we can derived that
u α δ ( y , · ) u α ( y , · ) 2 C 1 δ α y q T 2 C 1 ( τ 1 ) e λ 1 T / 2 y q T E y q T δ 1 y q T .
Now we estimate u α ( y , · ) u ( y , · ) of (A7). It is noticed that
A 1 ( y ) u α ( y , · ) u ( y , · ) = n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) φ n X n ( x ) = n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) ( φ n δ φ n ) X n ( x ) + n = 1 α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) φ n δ X n ( x ) ,
using (19), (41), (A9), we can obtain
A 1 ( y ) u α ( y , · ) u ( y , · ) δ + τ δ = ( τ + 1 ) δ .
Furthermore, in the light of (7) and (38), we get that
u α ( y , · ) u ( y , · ) D γ , q u α u = n = 1 λ n 2 γ e 2 q T λ n α λ n γ cosh q ( λ n T ) 1 + α λ n γ cosh q ( λ n T ) 2 cosh 2 ( λ n y ) φ n 2 1 2 n = 1 λ n 2 γ e 2 q T λ n cosh 2 ( λ n T ) φ n 2 1 2 E ,
subsequently, using the result of conditional stability in (13), we have
u α ( y , · ) u ( y , · ) 2 y q T λ 1 γ e λ 1 T y q T ( τ + 1 ) 1 y q T E y q T δ 1 y q T .
Ultimately, from (A8), (A12), the estimate of convergence (42) can be proven. □
Proof of Theorem 7.
In (31), Take the exact data ψ denote the corresponding solution as v β , then
v β δ v v β δ v β + v β v .
For 0 < y T , n 1 , we know that sinh ( λ n y ) e λ n y , and λ n λ 1 , sinh ( λ n y ) e λ n y ( 1 e 2 λ 1 y ) / 2 , from (31), (37), (27), we note that
v β δ ( y , · ) v β ( y , · ) 2 n = 1 sinh ( λ n y ) λ n 1 + β λ n γ 1 sinh q ( λ n T ) 2 ψ n δ ψ n 2 n = 1 e ( q T y ) λ n λ 1 β λ n γ 1 1 e 2 λ 1 T 2 q + e q T λ n 2 ψ n δ ψ n 2 4 D 1 2 δ 2 β 2 y q T .
On the other hand, by (9), (31), (37), (43), one gets that
v β ( y , · ) v ( y , · ) 2 = n = 1 β λ n γ 1 sinh q ( λ n T ) λ n 1 + β λ n γ 1 sinh q ( λ n T ) sinh ( λ n y ) ψ n X n 2 n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) 2 sinh ( λ n T ) λ n ψ n 2 β 2 n = 1 e λ n y λ n e λ n y 1 + β λ n γ 1 sinh q ( λ n T ) 2 λ n 2 γ e 2 q T λ n sinh ( λ n T ) λ n ψ n 2 β 2 λ 1 e 2 λ 1 y n = 1 e ( q T y ) λ n λ 1 β λ n γ 1 1 e 2 λ 1 T 2 q + e q T λ n 2 λ n 2 γ e 2 q T λ n | v ( T , · ) , X n | 2 4 λ 1 e 2 λ 1 y D 1 2 β 2 2 y q T E 2 .
From (44), (A13), (A14), (A15), and (27), we can derive the estimate (45). □
Proof of Lemma 4.
One can prove this Lemma easily by writing
ϱ ( β ) = n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) 2 ψ n δ 2 1 / 2 ,
here we also skip it. □
Proof of Lemma 5.
According to (46), it can be known that
τ δ = n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ψ n δ X n ( x ) n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ( ψ n δ ψ n ) X n ( x ) + n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ψ n X n ( x ) δ + n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ψ n X n ( x ) ,
and
n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ψ n X n ( x ) n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) 2 ψ n 2 1 / 2 n = 1 β 2 λ n 2 γ 2 sinh 2 q ( λ n T ) ψ n 2 1 / 2 n = 1 β 2 λ n sinh 2 ( λ n T ) · λ n 2 γ e 2 q T λ n sinh 2 ( λ n T ) ( λ n ) 2 ψ n 2 1 / 2 n = 1 β 2 λ 1 sinh 2 ( λ 1 T ) · λ n 2 γ e 2 q T λ n | v ( T , · ) , X n | 2 1 / 2 ( 1 / ( λ 1 sinh ( λ 1 T ) ) ) β E ,
by (A17), (A18), ( τ 1 ) δ ( 1 / ( λ 1 sinh ( λ 1 T ) ) ) β E . We finish the proof. □
Proof of Theorem 8.
From (A13), we have
v β δ ( y , · ) v ( y , · ) v β δ ( y , · ) v β ( y , · ) + v β ( y , · ) v ( y , · ) .
Using (A14) and the result in Lemma 5, it can be obtained that
v β δ ( y , · ) v β ( y , · ) 2 D 1 δ β y q T 2 D 1 λ 1 sinh ( λ 1 T ) ( τ 1 ) y q T E y q T δ 1 y q T .
In the following, let us estimate v β ( y , · ) v ( y , · ) of (A19). It is noted that
A 2 ( y ) v β ( y , · ) v ( y , · ) = n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ψ n X n ( x ) = n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ( ψ n δ ψ n ) X n ( x ) + n = 1 β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) ψ n δ X n ( x ) ,
using (27), (46), (A21), we can obtain
A 2 ( y ) v β ( y , · ) v ( y , · ) δ + τ δ = ( τ + 1 ) δ .
Furthermore, in the light of (7) and (43), one derives that
v β ( y , · ) v ( y , · ) D γ , q v β v = n = 1 λ n 2 γ e 2 q T λ n β λ n γ 1 sinh q ( λ n T ) 1 + β λ n γ 1 sinh q ( λ n T ) 2 sinh ( λ n y ) λ n 2 ψ n 2 1 2 n = 1 λ n 2 γ e 2 q T λ n sinh ( λ n T ) λ n 2 ψ n 2 1 2 E ,
subsequently, using the result of conditional stability in (15), there holds that
v β ( y , · ) v ( y , · ) 2 y q T λ 1 1 2 γ q T 2 y e λ 1 T 1 e 2 λ 1 T y q T ( τ + 1 ) 1 y q T E y q T δ 1 y q T .
Ultimately, we can prove the result of convergence (47) by combing (A20) with (A24). □

References

  1. Kaup, P.G.; Santosa, F. Nondestructive evaluation of corrosion damage using electrostatic measurements. J. Nondestruct. Eval. 1995, 14, 127–136. [Google Scholar] [CrossRef]
  2. McIver, M. An inverse problem in electromagnetic crack detection. IMA J. Appl. Math. 1991, 47, 127–145. [Google Scholar] [CrossRef]
  3. Stefanesco, S.; Schlumberger, C.; Schlumberger, M. Sur la distribution électrique potentielle autour d’uneprise de terre ponctuelle dans un terrain à couches horizontales, homogènes et isotropes. J. Phys. Radium 1930, 1, 132–140. [Google Scholar] [CrossRef] [Green Version]
  4. Colli Franzone, P.; Guerri, L.; Tentoni, S.; Viganotti, C.; Baruffi, S.; Spaggiari, S.; Taccardi, B. A mathematical procedure for solving the inverse potential problem of electrocardiography. Analysis of the time-space accuracy from in vitro experimental data. Math. Biosci. 1985, 77, 353–396. [Google Scholar] [CrossRef]
  5. Alessandrini, G.; Rondi, L.; Rosset, E.; Vessella, S. The stability for the Cauchy problem for elliptic equations. Inverse Probl. 2009, 25, 123004. [Google Scholar] [CrossRef] [Green Version]
  6. Belgacem, F.B. Why is the Cauchy problem severely ill-posed? Inverse Probl. 2007, 23, 823. [Google Scholar] [CrossRef]
  7. Cheng, H.; Feng, X.L.; Fu, C.L. A mollification regularization method for the Cauchy problem of an elliptic equation in a multi-dimensional case. Inverse Probl. Sci. Eng. 2010, 18, 971–982. [Google Scholar] [CrossRef]
  8. Bouzitouna, A.; Boussetila, N.; Rebbani, F. Two regularization methods for a class of inverse boundary value problems of elliptic type. Bound. Value Probl. 2013, 2013, 178. [Google Scholar] [CrossRef] [Green Version]
  9. Eldén, L.; Berntsson, F. A stability estimate for a Cauchy problem for an elliptic partial differential equation. Inverse Probl. 2009, 21, 1643–1653. [Google Scholar]
  10. Eldén, L.; Simoncini, V. A numerical solution of a Cauchy problem for an elliptic equation by Krylov subspaces. Inverse Probl. 2009, 25, 065002. [Google Scholar]
  11. Feng, X.L.; Eldén, L.; Fu, C.L. A quasi-boundary-value method for the Cauchy problem for elliptic equations with nonhomogeneous neumann data. J. Inverse -Ill-Posed Probl. 2010, 18, 617–645. [Google Scholar] [CrossRef]
  12. Feng, X.L.; Ning, W.T.; Qian, Z. A quasi-boundary-value method for a Cauchy problem of an elliptic equation in multiple dimensions. Inverse Probl. Sci. Eng. 2014, 22, 1045–1061. [Google Scholar] [CrossRef]
  13. Hào, D.N.; Duc, N.V.; Lesnic, D. A non-local boundary value problem method for the Cauchy problem for elliptic equations. Inverse Probl. 2009, 25, 055002. [Google Scholar]
  14. Tautenhahn, U. Optimal stable solution of Cauchy problems of elliptic equations. J. Anal. Its Appl. 1996, 15, 961–984. [Google Scholar] [CrossRef]
  15. Tautenhahn, U.; Hämarik, U.; Hofmann, B.; Shao, Y. Conditional stability estimates for ill-posed pdeproblems by using interpolation. Numer. Funct. Anal. Optim. 2013, 34, 1370–1417. [Google Scholar] [CrossRef] [Green Version]
  16. Tuan, N.H.; Trong, D.D.; Quan, P.H. A note on a Cauchy problem for the Laplace equation: Regularization and error estimates. Appl. Math. Comput. 2010, 217, 2913–2922. [Google Scholar] [CrossRef]
  17. Zhao, J.J.; Liu, S.S.; Liu, T. A new regularization method for cauchy problem of elliptic equation. Complex Var. Elliptic Equations 2014, 59, 1302–1314. [Google Scholar] [CrossRef]
  18. Hochstenbach, M.E.; Reichel, L. Fractional Tikhonov regularization for linear discrete ill-posed problems. BIT Numer. Math. 2011, 51, 197–215. [Google Scholar] [CrossRef] [Green Version]
  19. Cheng, J.; Yamamoto, M. One new strategy for a priori choice of regularizing parameters in Tikhonov’s regularization. Inverse Probl. 2000, 16, L31–L38. [Google Scholar] [CrossRef]
  20. Payne, L.E. Bounds in the Cauchy problem for the Laplace equation. Arch. Ration. Mech. Anal. 1960, 5, 35–45. [Google Scholar] [CrossRef]
  21. Engl, H.W.; Hanke, M.; Neubauer, A. Regularization of Inverse Problems, Volume 375 of Mathematics and Its Applications; Kluwer Academic Publishers Group: Dordrecht, The Netherlands, 1996. [Google Scholar]
  22. Kirsch, A. An Introduction to the Mathematical Theory of Inverse Problems, Volume 120 of Applied Mathematical Sciences; Springer: New York, NY, USA, 1996. [Google Scholar]
  23. Feng, X.L.; Fu, C.L.; Cheng, H. A regularization method for solving the Cauchy problem for the Helmholtz equation. Appl. Math. Model. 2011, 35, 3301–3315. [Google Scholar] [CrossRef]
  24. Qin, H.H.; Wei, T. Two regularization methods for the Cauchy problems of the Helmholtz equation. Appl. Math. Model. 2010, 34, 947–967. [Google Scholar] [CrossRef]
  25. Morozov, V.A.; Nashed, Z.; Aries, A.B. Methods for Solving Incorrectly Posed Problems; Springer: New York, NY, USA, 1984. [Google Scholar]
  26. Egger, H.; Hofmann, B. Tikhonov regularization in Hilbert scales under conditional stability assumptions. Inverse Probl. 2018, 34, 115015. [Google Scholar] [CrossRef] [Green Version]
  27. Hofmann, B.; Mathe, P. Tikhonov regularization with oversmoothing penalty for non-linear ill-posed problems in Hilbert scales. Inverse Probl. 2017, 34, 015007. [Google Scholar] [CrossRef] [Green Version]
  28. Hofmann, B.; Kaltenbacher, B.; Resmerita, E. Lavrentiev’s regularization method in Hilbert spaces revisited. Inverse Probl. Imaging 2017, 10, 741–764. [Google Scholar] [CrossRef] [Green Version]
  29. Plato, R.; Mathé, P.; Hofmann, B. Optimal rates for lavrentiev regularization with adjoint source conditions. Math. Comput. 2017, 87, 785–801. [Google Scholar] [CrossRef]
  30. Chen, D.H.; Hofmann, B.; Zou, J. Regularization and convergence for ill-posed backward evolution equations in Banach spaces. J. Differ. Equations 2018, 265, 3533–3566. [Google Scholar] [CrossRef]
Figure 1. k = 0.5 , γ = 2 , q = 4 ; Exact and Regularized solutions for various ε . (a): ε = 0.001 , (b): ε = 0.01 , (c): ε = 0.05 , (d): ε = 0.1 .
Figure 1. k = 0.5 , γ = 2 , q = 4 ; Exact and Regularized solutions for various ε . (a): ε = 0.001 , (b): ε = 0.01 , (c): ε = 0.05 , (d): ε = 0.1 .
Mathematics 08 00048 g001
Figure 2. k = 1.5 , γ = 2 , q = 4 ; Exact and Regularized solutions for various ε . (a): ε = 0.001 , (b): ε = 0.01 , (c): ε = 0.05 , (d): ε = 0.1 .
Figure 2. k = 1.5 , γ = 2 , q = 4 ; Exact and Regularized solutions for various ε . (a): ε = 0.001 , (b): ε = 0.01 , (c): ε = 0.05 , (d): ε = 0.1 .
Mathematics 08 00048 g002
Table 1. k = 0.5 , 1.5 , γ = 3 , ε = 0.01 , the errors for different q.
Table 1. k = 0.5 , 1.5 , γ = 3 , ε = 0.01 , the errors for different q.
q2345678
ϵ k = 0.5 ( u ) 0.04420.04410.04390.04380.04380.04380.0438
ϵ k = 1.5 ( u ) 0.04870.04810.04800.04800.04800.04800.0480
Table 2. k = 0.5 , 1.5 , q = 5 , ε = 0.01 , the errors for different γ .
Table 2. k = 0.5 , 1.5 , q = 5 , ε = 0.01 , the errors for different γ .
γ 1234567
ϵ k = 0.5 ( u ) 0.04400.04390.04380.04380.04380.04380.0438
ϵ k = 1.5 ( u ) 0.04820.04800.04800.04800.04800.04800.0480

Share and Cite

MDPI and ACS Style

Zhang, H.; Zhang, X. Generalized-Fractional Tikhonov-Type Method for the Cauchy Problem of Elliptic Equation. Mathematics 2020, 8, 48. https://doi.org/10.3390/math8010048

AMA Style

Zhang H, Zhang X. Generalized-Fractional Tikhonov-Type Method for the Cauchy Problem of Elliptic Equation. Mathematics. 2020; 8(1):48. https://doi.org/10.3390/math8010048

Chicago/Turabian Style

Zhang, Hongwu, and Xiaoju Zhang. 2020. "Generalized-Fractional Tikhonov-Type Method for the Cauchy Problem of Elliptic Equation" Mathematics 8, no. 1: 48. https://doi.org/10.3390/math8010048

APA Style

Zhang, H., & Zhang, X. (2020). Generalized-Fractional Tikhonov-Type Method for the Cauchy Problem of Elliptic Equation. Mathematics, 8(1), 48. https://doi.org/10.3390/math8010048

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop