Convergent numerical methods for parabolic equations with reversed time via a new Carleman estimate
Michael V. Klibanov, Anatoly G. Yagola

TL;DR
This paper introduces a new Carleman estimate for second-order parabolic equations with reversed time, enabling stable numerical methods over arbitrary time intervals and extending to quasilinear cases with proven convergence.
Contribution
It develops a novel Carleman estimate applicable to any time interval, facilitating stable quasi-reversibility methods and global convergence results for reversed time parabolic equations.
Findings
Established a stability estimate for reversed time parabolic equations.
Proposed a quasi-reversibility numerical method with proven convergence.
Constructed a globally convex Tikhonov-like functional ensuring convergence.
Abstract
The key tool of this paper is a new Carleman estimate for an arbitrary parabolic operator of the second order for the case of reversed time data. This estimate works on an arbitrary time interval. On the other hand, the previously known Carleman estimate for the reversed time case works only on a sufficiently small time interval. First, a stability estimate is proven. Next, the quasi-reversibility numerical method is proposed for an arbitrary time interval for the linear case. This is unlike a sufficiently small time interval in the previous work. The convergence rate for the quasi-reversibility method is established. Finally, the quasilinear parabolic equation with reversed time is considered. A weighted globally strictly convex Tikhonov-like functional is constructed. The weight is the Carleman Weight Function which is involved in that Carleman estimate. The global convergence of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Convergent numerical methods for parabolic equations with reversed
time via a new Carleman estimate
Michael V. Klibanov and Anatoly G. Yagola Department of Mathematics and Statistics, University of North Carolina Charlotte, Charlotte, NC, 28223, [email protected] of Mathematics, Faculty of Physics, Moscow State University, Moscow, 119991, Russia, e-mail: [email protected]
Abstract
The key tool of this paper is a new Carleman estimate for an arbitrary parabolic operator of the second order for the case of reversed time data. This estimate works on an arbitrary time interval. On the other hand, the previously known Carleman estimate for the reversed time case works only on a sufficiently small time interval. First, a stability estimate is proven. Next, the quasi-reversibility numerical method is proposed for an arbitrary time interval for the linear case. This is unlike a sufficiently small time interval in the previous work. The convergence rate for the quasi-reversibility method is established. Finally, the quasilinear parabolic equation with reversed time is considered. A weighted globally strictly convex Tikhonov-like functional is constructed. The weight is the Carleman Weight Function which is involved in that Carleman estimate. The global convergence of the gradient projection method to the exact solution is proved for this functional.
Key Words. linear and quasilinear parabolic equations, reversed time, Carleman estimate, stability estimate, convergent quasi-reversibility method for the linear case, globally convergent numerical method for the quasilinear case
AMS subject classification. 35R25, 35R30
1 Introduction
In this paper, we construct convergent numerical methods for linear and quasilinear parabolic equations with reversed time. The key tool of the convergence analysis is a new Carleman estimate. While the previously known Carleman estimate for these problems works only on a sufficiently small time interval, the one of this paper works on any finite time interval.
All functions below are real valued ones. Below denotes points in and for any appropriate function Let be a bounded domain with a piecewise smooth boundary Let and be two numbers. Denote
[TABLE]
For , let functions be such that
[TABLE]
[TABLE]
[TABLE]
Introduce a uniform elliptic operator of the second order in the domain
[TABLE]
Let the function For this function, we assume that there exists a constant depending only on such that
[TABLE]
Consider the following quasilinear parabolic equation:
[TABLE]
We impose the zero Dirichlet boundary condition on the function
[TABLE]
Since we work with the time reversed case, we assume that the function is known at the final time ,
[TABLE]
Thus, we have obtained the following problem:
Problem with Time Reversed Data. Suppose that conditions (1.1)-(1.5). Find a function satisfying conditions (1.7)-(1.9).
One of possible applications is in the case when a solid is heated and the initial temperature is unknown. However, one can measure the temperature of this solid at a final time. It is required to restore the temperature distribution inside of this solid at all preceding times. Another application of this problem, which was found recently, is in financial mathematics, more precisely in a the problem of forecast of prices of stock options using the Black-Scholes equation and real market data [17].
The problem of our interest is well known to be unstable, i.e. this is an ill-posed problem. Hölder stability estimates for this problem are known, see, e.g. [8, 14, 24]. To the best knowledge of the author, the strongest Hölder stability result, which is valid for an arbitrary large time interval is obtained by Isakov, see Theorem 3.1.3 in [8]. In section 2 of chapter 4 of [24] and later in [14] a Carleman estimate was used to obtain the Hölder stability estimate. However, that Hölder stability estimate is valid only on a sufficiently small time interval for a sufficiently small The smallness of this interval is due to the Carleman Weight Function (CWF), which has been used in the Carleman estimates for that problem so far [14, 24]. This function is where numbers are sufficiently small and the parameter is sufficiently large. The same CWF was used in [7] for the proof of the uniqueness theorem.
Using this estimate, the first author has constructed in [14] the quasi-reversibility method (QRM) for the above problem in the linear case and has proven its convergence, again on a sufficiently small time interval. Below as well as in [14, 17] the QRM is realized via the minimization of a certain regularization functional. On the other hand, QRM is quite often realized via a proper perturbation of the underlying PDE operator [8, 25]. A surprising idea of the recent publication of Kaltenbacher and Rundell [9] it to use the non local operator of the fractional derivative as the perturbing operator for the QRM. In the work of Tuan, Khoa and Au [27] another version of the QRM is constructed for the quasilinear case. Its convergence was proven for an arbitrary . However, the perturbation operator of [27] is a very complicated one. Another version of the QRM was proposed in [8]. This version works only in the case when the set of eigenfunctions of the underlying elliptic operator forms an orthonormal basis in
The QRM was originally developed by Lattes and Lions in 1969 [25]. Their idea became quite popular since then with many publications treating a variety of ill-posed problems for PDEs. In this regard we refer to, e.g. [4, 5, 6, 8, 10, 17, 23, 27]. In particular, the first author has shown in the survey paper [14] that as soon as a proper Carleman estimate for an ill-posed problem for a linear PDE is available, then the QRM can be constructed for this problem and its convergence rate can be established. In the case of the time reversed data for the linear parabolic PDE the construction of the QRM in [14] is valid only on a sufficiently small time interval
As to the ill-posed problems for quasilinear PDEs, it was shown in [15] that, again as soon as a proper Carleman estimate is available for the linear principal part of the PDE operator, a weighted globally strictly convex Tikhonov-like functional can be constructed, i.e. this problem can be “convexified”. The key element of this functional is the presence of the CWF in it, i.e. the function which is involved as the weight in the Carleman estimate for that linear principal part of the PDE operator. In the follow up paper [1] existence and uniqueness of the minimizer of that functional were established and global convergence to the exact solution of the gradient projection method of the minimization of this functional was proven. As to the quasilinear parabolic equations, they were considered in [1, 15, 18] only for the case of lateral Cauchy data with numerical results in [1, 18]. However, the case of time reversed data was not considered in [1, 15, 18].
The idea of convexifying coefficient inverse problems was first proposed in 1995-1997 in [11, 12], although without numerical studies, also see [13]. Recently the interest to the convexification approach was renewed. First, this was done only analytically [3, 16]. Next, a number of papers was published, which combined the theory with numerical studies, see, e.g. [1, 18] for the case of quasilinear PDEs and [19, 20, 21, 22] for coefficient inverse problems.
We call a numerical method for an ill-posed problem globally convergent if there is a theorem claiming that it converges to the exact solution of this problem without an a priori knowledge of a sufficiently small neighborhood of this solution. On the other hand, we call a numerical method for that problem locally convergent if its convergence is rigorously guaranteed only if iterations start in a sufficiently small neighborhood of the exact solution. Thus, the convexification is a globally convergent method (see Theorem 5.4 in section 5). On the other hand, a gradient-like method being applied to a non-convex Tikhonov-like functional, might have guaranteed convergence to the exact solution only if its starting point is located in a sufficiently small neighborhood of that solution. The latter is called the local convergence.
New elements of this paper are:
A new Carleman estimate for a general parabolic operator of the second order with time reversed data is proven. This estimate works on an arbitrary time interval , unlike a sufficiently small interval of previous publications [7, 14, 24]. Results listed in items 2-4 below are based on this estimate. 2. 2.
A stability estimate is proven for the above Problem with Time Reversed Data. This estimate is somewhat “between” Hölder and logarithmic stability estimates. In other words, although it is weaker than the Hölder stability estimate of [8, 14, 24], it is stronger than the logarithmic stability estimate. Still, the main advantage of our stability estimate over ones in [14, 24] is that it works without a smallness assumption imposed on the time interval. 3. 3.
In the linear case, the QRM is constructed, existence and uniqueness of the minimizer as well as convergence of minimizers to the exact solution are proven. Unlike previous works [14, 17], a smallness assumption is not imposed on the time interval. 4. 4.
In the quasilinear case, this problem is convexified for the first time. In other words, a weighted globally strictly convex Tikhonov-like functional is constructed with the CWF in it. Both the existence and uniqueness of its minimizer are proved. In addition, the global convergence of the gradient projection method to the exact solution is established. This way we avoid the use of a complicated perturbation operator of [27].
In section 2 we prove the new Carleman estimate. In section 3 we present stability estimate. In section 4 we describe the quasi-reversibility method for the linear case, prove existence and uniqueness of the minimizer as well as convergence of minimizers to the exact solution when the level of the noise in the data tends to zero. In section 5 we construct the above mentioned weighted globally strictly convex Tikhonov-like functional and formulate corresponding theorems. These theorems are proved in section 6.
2 Carleman Estimate
Theorem 2.1. (Carleman estimate). Assume that conditions (1.1)-(1.5) are in place. Then there exists a sufficiently large number depending only on listed parameters and the number depending on the same parameters as ones of , such that for all functions satisfying the zero Dirichlet boundary condition (1.8) the following Carleman estimate is valid
[TABLE]
[TABLE]
[TABLE]
Proof. In this proof,
[TABLE]
The case can be obtained from (2.2) via density arguments. Everywhere below in this paper denotes different constants depending only on listed parameters.
We prove this theorem in six steps. Introduce a new function
[TABLE]
Hence,
[TABLE]
[TABLE]
[TABLE]
Hence,
[TABLE]
[TABLE]
[TABLE]
Step 1. First, we estimate from the below
[TABLE]
Next,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Applying the Cauchy-Schwarz inequality “with to (2.5),
[TABLE]
and using (2.4), we obtain
[TABLE]
[TABLE]
Hence,
[TABLE]
[TABLE]
Step 2. Estimate the term in the third line of (2.3). We have:
[TABLE]
[TABLE]
Step 3. Sum up (2.7), (2.8). Then, taking into account (2.3), we obtain
[TABLE]
[TABLE]
Replacing here with and using we obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
What is not good in estimate (2.9) is that the first line in its right hand side contains both positive and negative terms. However, only positive terms must be in such cases in any Carleman estimate. Hence, we continue with further steps.
Step 4. Estimate from the below the expression We have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By (1.3)
[TABLE]
Hence, using (2.6) and (2.10), we obtain for all
[TABLE]
[TABLE]
[TABLE]
Step 5. Multiply (2.11) by and sum up with (2.9). Since and for sufficiently large then we obtain for
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Next, we estimate from the above the left hand side of inequality (2.12) as
[TABLE]
[TABLE]
Comparing this with (2.12), we obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where the vector function is such that
[TABLE]
Condition (2.14) follows from the boundary condition in (2.2) and the lines 5 and 6 of (2.12).
Step 6. Integrate the pointwise Carleman estimate (2.13) over the domain Using Gauss’ formula and (2.14), we obtain (2.1).
3 Stability Estimate
For an arbitrary denote
[TABLE]
Prior establishing our stability estimate, we prove Lemma 3.1.
Lemma 3.1. Let be a sufficiently small number and let the number . Choose a sufficiently large number such that
[TABLE]
*Then for any and for any number *
[TABLE]
[TABLE]
Remark 3.1. It follows (3.2) and (3.3) that any stability estimate via is weaker than Hölder and stronger than logarithmic stability estimate.
Proof of Lemma 3.1. By (3.1)* * Hence, Hence,
[TABLE]
Next,
[TABLE]
By (3.4)
[TABLE]
[TABLE]
[TABLE]
Hence,
[TABLE]
Using (3.8), we now prove (3.2). Indeed,
[TABLE]
[TABLE]
Since by (3.7) then
[TABLE]
Hence,
[TABLE]
We now prove (3.3), which is equivalent with
[TABLE]
Next,
[TABLE]
[TABLE]
Obviously
[TABLE]
Thus, (3.10) follows from (3.11) and (3.12).
Theorem 3.1 (stability estimate). Assume that conditions (1.1)-(1.5) are in place. Suppose that two functions are solutions of problem (1.7), (1.8) with different data at ,
[TABLE]
Suppose that
[TABLE]
**
[TABLE]
*where is a number and the parameter characterizes the level of noise in the data . Denote * Let be the number in (1.6) and be the parameter of Theorem 2.1. Then there exist constants
[TABLE]
[TABLE]
* depending only on listed parameters such that if the number is so small that*
[TABLE]
*then the following estimate holds for any and for all * **
[TABLE]
where *the constant is independent on and the number * is defined in (3.7).
Estimate (3.17) is between Hölder and logarithmic stability estimates, see Lemma 3.1 and Remark 3.1. Everywhere below denotes different numbers depending on the same parameters as ones listed in this theorem.
Proof. It follows from (1.6)-(1.9) and (3.13) that
[TABLE]
[TABLE]
[TABLE]
Square both sides of inequality (3.18), then multiply by integrate over and then apply Theorem 2.1 taking into account (3.19) and (3.20). We obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Choose so that Then (3.14) and (3.21) imply that for all
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hence,
[TABLE]
Choose such that (3.1) would be satisfied with , i.e.
[TABLE]
Hence,
[TABLE]
The choice (3.25) is possible since (3.16) holds and Hence, by (3.8)
[TABLE]
Hence, (3.15), (3.23), (3.24) and (3.26) imply that
[TABLE]
The target estimate (3.17) of this theorem obviously follows from (3.2) and (3.27).
4 The Quasi-Reversibility Method for the Linear Case
We assume in this section that the function in (1.7) is linear with respect to the function and its first derivatives,
[TABLE]
where functions Then (1.7)-(1.9) become
[TABLE]
[TABLE]
[TABLE]
Assuming that for and
[TABLE]
consider the function Then (4.2)-(4.5) lead to
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We introduce the subspace of the space as
[TABLE]
The QRM for problem (4.6)-(4.9) amounts to the minimization of the following functional
[TABLE]
where is the regularization parameter. We arrive at the following problem:
Minimization Problem 1. Minimize the functional on the space
Theorem 4.1. Assume that conditions (1.1)-(1.5), (4.9) hold. Then there exists unique minimizer of the functional
Proof. Let denotes the scalar product in By the variational principle, any minimizer if it exists, satisfies the following integral identity
[TABLE]
[TABLE]
Since
[TABLE]
[TABLE]
then the equality
[TABLE]
defines a new scalar product in the space We rewrite integral identity (4.11) as
[TABLE]
Next, by the Cauchy-Schwarz inequality
[TABLE]
Hence, by Riesz theorem, there exists a unique function such that
[TABLE]
Comparing this with (4.12), we obtain
[TABLE]
Therefore, there exists unique minimizer of the functional
In the regularization theory, the function is called the regularized solution of problem (4.6)-(4.9) [2, 26]. The next step after Theorem 4.1 is to prove convergence of regularized solutions to the exact one when the noise in the data tends to zero. While we have used only Riesz theorem to prove existence and uniqueness of the minimizer, the convergence result requires the Carleman estimate of Theorem 2.1.
Let the function be the exact data in problem (4.6)-(4.9), i.e. the data without a noise in it. Suppose that there exists the exact solution of problem (4.6)-(4.9) with Theorem 1.2 implies that this solution is unique. Let be the noisy data and let be the corresponding minimizer of functional (4.10) (Theorem 4.1). We assume that
[TABLE]
where is the noise level. Consider the difference
[TABLE]
Theorem 4.2 estimates the function via It follows from the regularization theory that we need to assume a certain dependence of the regularization parameter on the noise level
Theorem 4.2 (convergence rate). Assume that conditions (1.1)-(1.6) and (4.13) are in place. Let and be the numbers of Theorems 2.1 and 3.1 respectively and let Then there exists a number
[TABLE]
depending only on listed parameters *such that if * and
[TABLE]
then the following convergence estimate of the QRM holds for every
[TABLE]
*where the function * *is defined in (4.14) and the number is defined in (3.7). *
As to estimate (4.16), also see Lemma 3.1 and Remark 3.1.
Proof of Theorem 4.2. The function satisfies the following integral identity
[TABLE]
[TABLE]
Subtracting (4.17) from (4.11) and using (4.14), we obtain
[TABLE]
[TABLE]
Set in (4.18) Using Cauchy-Schwarz inequality, we obtain
[TABLE]
[TABLE]
Hence,
[TABLE]
Since then (4.19) implies that Hence, trace theorem leads to
[TABLE]
To proceed further, we apply to (4.19) the Carleman estimate of Theorem 2.1. Let We have
[TABLE]
[TABLE]
Hence, using (4.19), we obtain
[TABLE]
We have
[TABLE]
[TABLE]
Next, since then by (3.20) and (3.21)
[TABLE]
[TABLE]
[TABLE]
Choose such that Then, using (4.20) and (4.23), we obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hence, (4.21)-(4.24) imply that
[TABLE]
[TABLE]
Dividing this by we obtain for all
[TABLE]
Choose such that (3.1) would be satisfied with , i.e.
[TABLE]
Hence,
[TABLE]
The choice (4.26), (4.27) is possible since (4.15) holds and It follows from (3.1), (3.8) and (4.26) that
[TABLE]
Hence, using (4.25)-(4.28) and Lemma 3.1, we obtain
[TABLE]
which implies (4.16).
5 The Global Strict Convexity
5.1 The weighted Tikhonov-like functional
While the linear case (4.1) was studied in section 4, in this section we consider the quasilinear case. First, just like in section 4, we consider the function Then, assuming (4.5), we obtain instead of (1.7)-(1.9):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
In our derivations below and arguments of the function must be uniformly bounded for all Hence, similarly with [1, 15], we now need to impose a higher smoothness than just as in section 4. Consider an integer such that where denotes the maximal integer which does not exceed Then embedding theorem implies that and
[TABLE]
where the constant depends only on the domain Define the subspace as
[TABLE]
In addition, since we need below the function to be bounded in then we assume that
[TABLE]
Let be an arbitrary number. We consider the ball in the space
[TABLE]
Hence, by (5.5)
[TABLE]
[TABLE]
where the number depends only on listed parameters.
We want to find an approximate solution of problem (5.1)-(5.4) in the closed ball . To do this, we select a number and minimize the following weighted Tikhonov-like functional
[TABLE]
[TABLE]
The multiplier in (5.10) introduced to balance two terms in the right hand side of (5.10). Indeed, the regularization parameter and
[TABLE]
also, see (5.14).
Minimization Problem 2. *Minimize the functional on the ball *
5.2 Theorems about the functional
The central theorem of this section is Theorem 5.1.
Theorem 5.1 (global strict convexity). Assume that conditions (1.1)-(1.6) and (5.4) hold. Then the functional has the Fréchet derivative at every point and for all values of parameters Let be the number of Theorem 2.1. Then there exists a number
[TABLE]
*depending only on listed parameters such that * for and if for these values of the regularization parameter is such that
[TABLE]
* then the functional is strictly convex on More precisely, for every the following strict convexity estimate holds*
[TABLE]
[TABLE]
*where the constant depends only on parameters listed in (5.12). *
Everywhere below denotes different positive constants depending on the same parameters as those listed in (5.12).
Remark 5.1. *The presence of the term in the right hand side of (5.14) indicates that the convergence of a gradient-like method of the minimization of functional is likely faster in the space then in the space *
Theorem 5.2. The Fréchet derivative of the functional is Lipschitz continuous on for all values of parameters In other words, there exists a number
[TABLE]
depending only on listed parameters such that
[TABLE]
Furthermore, let be the number of Theorem 5.1. Then for every pair there exists unique minimizer of the functional on the closed ball and the following inequality holds
[TABLE]
Let be the orthogonal projection operator mapping the space onto the closed ball Let be an arbitrary point of Let the number Consider the sequence of the gradient projection method,
[TABLE]
Theorem 5.3. Let be the number of Theorem 5.1. Choose the number Let be the unique minimizer of the functional on the set (Theorem 5.2). Then there exists a sufficiently small number
[TABLE]
such that for every there exists a number such that
[TABLE]
Consider now the case of noise in the data. Following one of the Tikhonov’s concept of the regularization [2, 26], we assume that there exists exact noiseless data in (5.4) and, respectively, there exists exact solution of problem (5.1)-(5.4). Let be the level of noise in the data , i.e.
[TABLE]
In Theorem 5.4 we estimate the accuracy of the minimizer, i.e. the norm for any In turn, this estimate, combined with (5.18), provides the convergence rate of the sequence (5.17) to the exact solution. Note that since then by (5.19), we replace below dependencies on of the above numbers with dependencies on
**Theorem 5.4 **(estimates of the accuracy and the convergence rate). *Assume that the exact solution of problem (5.1)-(5.5) and that (5.19) holds. Let * *be the number of Theorem 5.1. Select an arbitrary number * For any set the number be the same as in (4.27). Let the number be so small that
[TABLE]
Let *and let be the unique minimizer of the functional on the set (Theorem 5.2). Let * *be the number defined in Theorem 5.3. Let and also be the numbers of Theorem 5.3. Choose the regularization parameter * as
[TABLE]
* * Then the following accuracy and convergence estimates hold
[TABLE]
[TABLE]
where the number is defined in (3.7).
Remark 5.2. *According to section 1, since is an arbitrary number and since the starting point of the gradient projection method is an arbitrary point of then Theorem 5.4 implies the global convergence to the exact solution of the gradient projection method of the minimization of the functional *
In this paragraph, we temporary assume that Theorem 5.1 is proved. Then the proof of the Lipschitz continuity (5.15) of the Fréchet derivative is very similar to the proof of Theorem 3.1 of [1]. The rest of Theorem 5.2 follows from (5.15) and Lemma 2.1 of [1]. Given Theorem 5.1, Theorem 5.3 follows from Theorem 3.3 of [1].
Therefore, we prove in section 6 only Theorems 5.1 and 5.4. Below, if we say that a vector function belongs to a certain Banah space, then this means that each of its components belongs to that space. The norm of that vector function in that space is defined as the square root of the sum of squared norms of its components.
6 Proofs of Theorems 5.1 and 5.4
6.1 Proof of Theorem 5.1
Consider two arbitrary functions Denote Then
[TABLE]
Hence, by (5.9)
[TABLE]
Consider the expression
[TABLE]
[TABLE]
Using the multidimensional analog of Taylor formula [28], (1.6), (5.4), (5.9) and (6.2), we obtain
[TABLE]
[TABLE]
where the D vector function the function and the function is such that
[TABLE]
In addition,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where and denote linear and nonlinear expressions with respect to respectively,
[TABLE]
We represent the term in (6.7) as
[TABLE]
[TABLE]
[TABLE]
Hence, using Cauchy-Schwarz inequality, (6.5) and (6.6), we obtain
[TABLE]
Also, by (5.5) and (6.5)-(6.7)
[TABLE]
Thus, (5.10), (6.7) and (6.8) imply that
[TABLE]
[TABLE]
[TABLE]
where is the scalar product in Assuming temporary that is an arbitrary function of consider the expression
[TABLE]
It follows from (5.9), (6.6) and (6.8) that is a bounded linear functional. Hence, by Riesz theorem there exists a unique function such that
[TABLE]
At the same time, it follows from (6.10)-(6.13) that
[TABLE]
[TABLE]
Hence, is the Fréchet derivative of the functional at the point
[TABLE]
We now come back again to the case when as in (6.1). Using (6.9), (6.11) and (6.13)-(6.15), we obtain
[TABLE]
[TABLE]
[TABLE]
We now use the Carleman estimate (2.1). Recalling that and using (6.16), we obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By (5.5)
[TABLE]
Choose the number depending on the same parameters as those listed in (5.12) and such that Hence, (5.11), (6.16)-(6.18) and (5.13) imply that for all
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
6.2 Proof of Theorem 5.4
Denote
[TABLE]
[TABLE]
By (5.4)
[TABLE]
[TABLE]
Hence, using the multidimensional analog of Taylor formula [28] and (5.19), we obtain similarly with (6.4)-(6.6)
[TABLE]
[TABLE]
where the function is such that Since then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hence, using (6.20), we obtain
[TABLE]
Next, by (5.14)
[TABLE]
[TABLE]
By (5.16) Hence, (6.22) and (6.23) imply that
[TABLE]
Recall that the numbers and are defined in (4.27) and (5.21) respectively. These choices of and are possible since (5.20) holds and Thus, condition (5.13) of Theorem 5.1 imposed on is in place. Hence, (4.26) and (4.28) hold. Hence, using (3.2), (4.26)-(4.28), and (6.24), we obtain
[TABLE]
which implies (5.22). To prove (5.23), we use the triangle inequality,
[TABLE]
[TABLE]
Using (5.18), (5.22) and (6.25), we obtain (5.23).
Acknowledgment
The work of M.V. Klibanov was supported by US Army Research Laboratory and US Army Research Office grant W911NF-19-1-0044.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. B. Bakushinskii, M. V. Klibanov and N. A. Koshev, Carleman weight functions for a globally convergent numerical method for ill-posed Cauchy problems for some quasilinear PD Es, Nonlinear Analysis: Real World Applications, 34 (2017) 201–224.
- 2[2] L. Beilina and M. V. Klibanov, Approximate Global Convergence and Adaptivity for Coefficient Inverse Problems , Springer, New York, 2012.
- 3[3] L. Beilina and M.V. Klibanov, Globally strongly convex cost functional for a coefficient inverse problem, Nonlinear Anal.: Real World Applications, 22 (2015) 272–278.
- 4[4] L. Bourgeois and J. Dardé, A duality-based method of quasi-reversibility to solve the Cauchy problem in the presence of noisy data, Inverse Problems, 26 (2010) 095016.
- 5[5] L. Bourgeois, D. Ponomarev, and J. Dardé, An inverse obstacle problem for the wave equation in a finite time domain, Inverse Problems and Imaging, 13 (2019) 377-400.
- 6[6] C. Clason and M. V. Klibanov, The quasi-reversibility method for thermoacoustic tomography in a heterogeneous medium, SIAM J. Sci. Comp., 30 (2007) 1–23.
- 7[7] A. Friedman, Partial Differential Equations of Parabolic Type , Prentice-Hall, Inc., Englewood Cliffs, N.J., 1964.
- 8[8] V. Isakov, Inverse Problems for Partial Differential Equations . Second Edition, Springer, New York, 2006.
