Theoretical stability in coefficient inverse problems for general hyperbolic equations with numerical reconstruction
Jie Yu, Yikan Liu, Masahiro Yamamoto

TL;DR
This paper establishes theoretical local stability results for determining spatial coefficients in hyperbolic equations and proposes a numerical iterative method using Tikhonov regularization and Poisson equations, demonstrated through 1D examples.
Contribution
It provides new theoretical stability estimates for coefficient inverse problems in hyperbolic equations and introduces a practical iterative reconstruction method with numerical validation.
Findings
Local Hölder stability under geometric conditions
Effective iterative reconstruction method based on Tikhonov regularization
Numerical examples demonstrating the method's performance
Abstract
In this article, we investigate the determination of the spatial component in the time-dependent second order coefficient of a hyperbolic equation from both theoretical and numerical aspects. By the Carleman estimates for general hyperbolic operators and an auxiliary Carleman estimate, we establish local H\"older stability with both partial boundary and interior measurements under certain geometrical conditions. For numerical reconstruction, we minimize a Tikhonov functional which penalizes the gradient of the unknown function. Based on the resulting variational equation, we design an iteration method which is updated by solving a Poisson equation at each step. One-dimensional prototype examples illustrate the numerical performance of the proposed iteration.
| Case | Elapsed time | |||
|---|---|---|---|---|
| (a) | ||||
| (b) | ||||
| (c) |
| Elapsed time | ||||||
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.
Theoretical Stability in Coefficient Inverse Problems
for General Hyperbolic Equations with
Numerical Reconstruction
Jie YU*†* Yikan LIU*‡,∗* Masahiro YAMAMOTO*‡*
Abstract
In this article, we investigate the determination of the spatial component in the time-dependent second order coefficient of a hyperbolic equation from both theoretical and numerical aspects. By the Carleman estimates for general hyperbolic operators and an auxiliary Carleman estimate, we establish local Hölder stability with both partial boundary and interior measurements under certain geometrical conditions. For numerical reconstruction, we minimize a Tikhonov functional which penalizes the gradient of the unknown function. Based on the resulting variational equation, we design an iteration method which is updated by solving a Poisson equation at each step. One-dimensional prototype examples illustrate the numerical performance of the proposed iteration.
[TABLE]
**AMS Subject Classifications ** 35L20, 35R30, 35A23, 65M32, 65F22
††footnotetext:
Manuscript last updated: .
†
School of Mathematical Sciences, Fudan University, No. 220 Handan Road, Shanghai 200433, China.
‡
Graduate School of Mathematical Sciences, The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo 153-8914, Japan.
∗
Corresponding author. E-mail: [email protected]
@hangfrom@seccntformat
sectionIntroduction
@xsect
2.3ex plus.2ex
Let and () be an open bounded domain whose boundary is of class. Let be the outward unit normal vector to , and denote the normal derivative on by . Introduce the hyperbolic operator
[TABLE]
where is a symmetric matrix, is a vector, and are scalar functions. For the non-degeneracy, we assume that is strictly positive in , and is strictly positive-definite in . For later use, we denote the normal derivative associated with the second order coefficient as
[TABLE]
In this paper, we consider the initial value problem for a hyperbolic equation
[TABLE]
From the physical point of view, (1.3) models the general acoustic wave in a highly anisotropic medium depending on both space and time. In a recent paper [22], it turns out that (1.3) also describes the one-dimensional time cone model for phase transformation. Note that for the well-posedness of the forward problem, we should attach (1.3) with a boundary condition. However, for the inverse problem proposed later, it suffices to access e.g. only the partial boundary value, which is regarded as a part of observation data. Therefore, for the moment we do not include any boundary condition in (1.3). To emphasize the dependency, throughout this paper we will write any solution satisfying (1.3) with the coefficient as . Detailed assumptions on the coefficients involved in (1.3) will be given later in Section Theoretical Stability in Coefficient Inverse Problems for General Hyperbolic Equations with Numerical Reconstruction.
This paper is mainly concerned with the following coefficient inverse problem on the determination of the spatial component in the principal part of the hyperbolic operator (1.1).
Problem 1.1
Let be a subboundary, be a subdomain, and satisfy (1.3). Determine the coefficient by
Type (I)* the partial boundary observation of and on , or*
Type (II)* the partial interior observation of in .*
In the formulation of Problem 1.1, the second order coefficient takes the form of incompletely separated variables, where the unknown spatial component contributes an important part in the wave propagation speed. In view of the acoustic equation, Problem 1.1 stands for the identification of the bulk modulus, which is of practical significance. Hence, we will not only investigate the theoretical aspect of Problem 1.1 due to our interest in mathematics, but also consider the reconstruction method to solve numerically.
In retrospect, researches on coefficient inverse problems for hyperbolic equations started soon after the pioneering work of Bukhgeim and Klibanov [5] which discovered the potential of Carleman estimates. We refer e.g. to [17, 18, 11] for some early results mainly on the uniqueness. Around 2000s, [24, 8, 9] established the global Lipschitz stability for determining the zeroth order coefficient in by the same types of data in Problem 1.1. For Problem 1.1 with and in (1.1), Imanuvilov and Yamamoto [10] employed an Carleman estimate to obtain the global Hölder stability by partial boundary observation. Later, this result was improved to Lipschitz in Bellassoued and Yamamoto [4] with time-independent coefficients, i.e., in (1.1). For other references on this direction, see also [3, 12]. It reveals that all of the above literature more or less imposes some geometrical conditions because of the finite wave propagation speed. Meanwhile, the above results mostly rely on a linearization approach, which reduces the problem to a corresponding inverse source problem. In addition, we emphasize the difference between e.g. and , where the former is more physical and the latter is technically easier (see [2]). However, there seems no publication treating Problem 1.1 in the case of time-dependent principal parts due to the essential difficulty. Recently, Jiang, Liu and Yamamoto [15] established the second order Carleman estimate for (1.1) and proved the local Hölder stability for a related inverse source problem. Motivated by [15], we first attempt to generalize the result in [10] with a more general hyperbolic operator with time-dependent coefficients, which is the first focus of this article.
Simultaneously, we have witnessed the recent applications of the iterative thresholding algorithm to inverse problems for partial differential equations. For the abstract formulation and convergence analysis of the algorithm, we refer to [6, 7, 23]. Attracted by its efficiency and robustness in many image processing problems, [13] first utilized the iterative thresholding algorithm to solve inverse problems for elliptic and parabolic equations. In [20, 15, 16], similar iteration methods were implemented to treat inverse source problems for hyperbolic-type equations with different types of observation data. Following the same line, we also attempt to develop the same class of iteration method to solve Problem 1.1 numerically, which is the second focus of this article. However, we should realize the underlying ill-posedness as well as the nonlinearity of Problem 1.1, which differs considerably from inverse source problems. For the numerical reconstruction of a time-dependent principal coefficient, we refer to [21].
Based on the newly established Carleman estimate in [15], we first prove the local Hölder stability of Problem 1.1 for both types of observation data (see Theorem 2.3). Due to the lack of an Carleman estimate for as that in [10], we have to argue in an alternative way to evaluate the -norm of the difference in unknown functions, which results from the divergence form in (1.3). For the numerical reconstruction, we reformulate Problem 1.1 as a minimization problem with the Tikhonov regularization penalizing the -norm of . Deriving the variational equation of the minimizer, we arrive at a novel iteration method which needs to solve a Poisson equation at each step.
The rest of this article is organized as follows. Preparing the necessary ingredients including the key Carleman estimates, in Section Theoretical Stability in Coefficient Inverse Problems for General Hyperbolic Equations with Numerical Reconstruction we state the main result on the theoretical stability of Problem 1.1. Then we give the proof of the main result in Section Theoretical Stability in Coefficient Inverse Problems for General Hyperbolic Equations with Numerical Reconstruction. Next, Section Theoretical Stability in Coefficient Inverse Problems for General Hyperbolic Equations with Numerical Reconstruction is devoted to the derivation of an iteration method for Problem 1.1, followed by Section Theoretical Stability in Coefficient Inverse Problems for General Hyperbolic Equations with Numerical Reconstruction illustrating several one-dimensional numerical examples. Finally, we provide some concluding remarks in Section Theoretical Stability in Coefficient Inverse Problems for General Hyperbolic Equations with Numerical Reconstruction.
@hangfrom@seccntformat
sectionPreliminaries and Main Results
@xsect
2.3ex plus.2ex
In this section, we start from the general settings and assumptions concerning the governing equation (1.3), and prepare the key Carleman estimates for the hyperbolic operator (1.1). Then we state the main result of this paper, which gives the stability estimate for Problem 1.1.
Throughout this paper, we write and () for the partial derivatives in space. We recall the definition and the notations , , , etc. () for the usual Sobolev spaces (see Adams [1]). For the various coefficients appearing in (1.3), we basically make the following assumptions:
[TABLE]
With some suitably given boundary condition and the compatibility condition, it is well known that the initial-boundary value problem governed by (1.3) admits a unique solution which depends continuously on the involved coefficients (see e.g. [19, 15]). In order to prove the theoretical stability for Problem 1.1, we have to assume
[TABLE]
which satisfies the a priori estimate
[TABLE]
with a constant . As was mentioned in [15], the smoothness of coefficients assumed in (2.1) may not guarantee the regularity in (2.2). Instead, we only understand (2.1)–(2.3) as the minimum necessary assumptions for the stability.
If the initial value problem (1.3) is only formulated in , we should additionally impose
[TABLE]
Then we can perform even reflections of and the solution with respect to , so that they preserve the same regularity in as assumed in (2.1) and (2.2). To circumvent the above technical assumption, we simply consider (1.3) in without loss of generality.
Next, we recall the Carleman estimates for the hyperbolic operator defined in (1.1), which play an essential role in both the statement and the proof of the main result. Similarly to [15], we pick such that in , and set
[TABLE]
By and , we introduce the level sets with a parameter as
[TABLE]
With a sufficiently large parameter , we define the weight function as
[TABLE]
We collect the Carleman estimates concerning (1.1) in the following lemma.
Lemma 2.1** **(see [15])
Let the coefficients and satisfy (2.1). Suppose that the hyperbolic operator in (1.1) admits the following Carleman estimate with the weight function in (2.6): For any , there exists constants and such that
[TABLE]
holds for all and satisfying , where is defined in (2.5). Then for any , there exist constants and such that
[TABLE]
holds for all and satisfying
[TABLE]
Remark 2.2
In general, the first order Carleman estimate (2.7) does not hold automatically. Indeed, some artificial conditions on and the second order coefficient are necessary to validate (2.7). For example, in the isotropic case
[TABLE]
under certain geometrical assumptions and the choice
[TABLE]
a sufficient condition for (2.7) can be (see Isakov [12, Theorem 3.4.3])
[TABLE]
where is the parameter in (2.4). On the other hand, the second order Carleman estimates (2.8)–(2.9) was established in [15, Lemma 3.1] on the basis of (2.7).
Now we turn our attention to Problem 1.1. For the subboundary , the subdomain and where the observation is taken, we make the following assumption. Given a constant and a function such that in , we assume
[TABLE]
where is the level set defined in (2.5). Although the above assumption looks technical, it generalizes the similar assumption in treating the same inverse problems for simpler wave equations (see [9, 20]), where the function was simply taken as with .
Finally, for the unknown function to be determined, we define an admissible set in the following way. For given constants and given functions and where satisfies (2.10), we restrict in
[TABLE]
Collecting all necessary ingredients, now we are in a position to state the main theoretical result, which answers the stability issue of Problem 1.1.
Theorem 2.3
Let , and satisfy (2.10) with arbitrarily fixed and such that in . Let and satisfy (1.3) with coefficients and respectively, where satisfy (2.1) and defined in (2.11). Suppose that satisfy (2.2)–(2.3), and the hyperbolic operator admits the Carleman estimate (2.7) with the weight function (2.6). Further assume that there exists a constant such that
[TABLE]
Then for any , there exist constants and depending on or such that
[TABLE]
where is defined in (2.5), with the a priori bounds in (2.3) and (2.11) respectively, and
[TABLE]
Remark 2.4
We discuss Theorem 2.3 from various points of view.
(1) At a first glance, the statement of Theorem 2.3 resembles that of [15, Theorem 2.3] to a large extent. Indeed, as the majority of existing literature did, here we also linearize the system to consider the governing equation of the difference , which partially reduces Problem 1.1 to an inverse source problem. Even though, Theorem 2.3 is nontrivial because one should deal with the source term
[TABLE]
as that in [10]. However, in our case there seems no Carleman estimate and thus we cannot evaluate (2.15) simply by . As a result, we should treat (2.15) in the sense, so that we have to argue more to dominate the -norm of . Hence, although (2.13) gives an estimate which looks stronger than that in [10], the fact is that we fail to provide an one instead.
(2) In Theorem 2.3, the unknown coefficient is restricted in the admissible set . According to the definition (2.11), it means that the partial Cauchy data of is known on the subboundary , which seems reasonable because the observation is taken there. Moreover, the boundary operator defined in (1.2) becomes linear on within the admissible set , which allows us to write
[TABLE]
in the observation data (2.14).
(3) We explain the geometry of the observation data in the assumption (2.10). Since is strictly positive in , by definition we know for . Therefore, if we fix , then (2.10) requires and , that is, the observation should be taken on the whole boundary. Nevertheless, in this case (2.13) becomes a global Hölder estimate with sufficiently small . On the other hand, if one attempt to shrink the observation region, then the estimate (2.13) tends to be local. On the opposite extreme, since for any , our result becomes trivial with large . As a result, the choice of in the weight function plays a delicate role in the balance between the cost of measurements and the stability. The optimal choice of seems to be an interesting topic, but we will not discuss it in this paper.
@hangfrom@seccntformat
sectionProof of Theorem 2.3
@xsect
2.3ex plus.2ex
In this section, we prove Theorem 2.3 under the same assumptions therein. The proof basically follows the same line as that in [15], which relies heavily on the Carleman estimates in Lemma 2.1. However, many details are different from each other, and in our problem we should especially argue more for the estimate in (2.13).
Henceforth, by we denote generic constants independent of the parameter in Carleman estimates and the observation data , which may change line by line.
For clearness, we divide the proof into five steps.
Step 1 We start from the general preparation of notations and auxiliary functions. For simplicity, we abbreviate the hyperbolic operator as throughout this section. Fixing any , we set . Then it follows from the definition (2.11) that and on . Together with the a priori bound, we conclude
[TABLE]
Correspondingly, we set . According to (1.3), (2.2) and (2.3), satisfies
[TABLE]
We note that is a first order differential operator with respect to .
By the Sobolev extension theorem, there exists such that
[TABLE]
For later use, we further introduce
[TABLE]
Then it is readily seen that (), and satisfy
[TABLE]
where we define
[TABLE]
Moreover, it follows from (3.4), (3.3) and (3.5) that for ,
[TABLE]
Note that () may not vanish outside the observation region, which prevents us from applying the Carleman estimates in Lemma 2.1. To this end, it is necessary to introduce a cutoff function as that in [15]. Recall the constant and the function given in advance. For any , we fix a constant , e.g., . With the level set defined in (2.5), we define such that
[TABLE]
Especially, we see that the condition (3.10) is possible by the definition (2.4) of . Meanwhile, owing to the assumption in (2.10), we can choose such that , indicating in . Together with the assumption in (2.10), we conclude
[TABLE]
Now we further set
[TABLE]
Employing (3.7), (3.11) and the assumption in (2.10), we obtain for that
[TABLE]
On the other hand, it is obvious that share the same regularity as that of , i.e., () and especially . By (3.6) and direct calculations, we deduce
[TABLE]
where
[TABLE]
Similarly to [15], it turns out that , and are all first order differential operators which only involve derivatives of . Then the definition (3.9) of implies
[TABLE]
Step 2 Now that () satisfy (3.12), we are well prepared to apply the Carleman estimates in Lemma 2.1 to . We will utilize estimates (3.1), (3.5) and (3.8) repeatedly throughout the proof, and take advantage of the properties of the cutoff function as well as the weight function .
Applying the first order Carleman estimate (2.7) in Lemma 2.1 to (3.15), we have
[TABLE]
Our aim in this step is to give an estimate for . To this end, we apply (2.7)–(2.8) in Lemma 2.1 to (3.13)–(3.14) to obtain for that
[TABLE]
To proceed, we should estimate for . First, we combine the properties (3.9)–(3.10) with (3.16), (3.5) and (3.8) to dominate
[TABLE]
where we used in by the definition (2.5). Similarly, by
[TABLE]
we further estimate
[TABLE]
where we turned to the a priori estimate (3.1) to treat the term . Hence, substituting (3.19)–(3.20) into (3.18) with yields
[TABLE]
Next, we deal with defined in (3.14). Noting the fact that is a second order differential operator in space, we apply (3.21), (3.5) and (3.8) to derive
[TABLE]
for all . To bound , we calculate
[TABLE]
Similarly to the treatment for , we employ (3.21) again to estimate
[TABLE]
Substituting (3.22)–(3.23) into (3.18) with , we deduce
[TABLE]
Choosing sufficiently large, we can absorb the first term on the right-hand side into the left-hand side and conclude
[TABLE]
Using (3.5), (3.8) and (3.16) again, we apply (3.21) and (3.24) to the definition (3.15) of and arrive at the estimate
[TABLE]
for all .
Step 3 We further introduce
[TABLE]
Then simple calculations yield
[TABLE]
We attempt to give upper and lower estimates for
[TABLE]
First, since , the application of (3.17) immediately gives
[TABLE]
for all . Noticing and using (3.17) again, we employ (3.26)–(3.27) to estimate from above as
[TABLE]
On the other hand, it follows from (3.12) that
[TABLE]
which allows us to perform integration by parts to estimate from below as
[TABLE]
where we applied the lower bounds in (2.1) and (2.11) to obtain (3.29). Utilizing (3.26) and (3.17) again, we further estimate
[TABLE]
Combining the above inequality with (3.29), (3.28) and (3.25), we obtain for all that
[TABLE]
Next, we shall relate the above estimate of with that of . In fact, by the definition of , we take in (3.2) and find
[TABLE]
where
[TABLE]
Hence, by , we obtain
[TABLE]
Recalling the definition (2.5) of , we see and in . By the same argument as before, we apply (3.30) to bound
[TABLE]
where we used the Sobolev embedding and (3.5) to dominate
[TABLE]
Step 4 In order to relate the above estimate (3.33) with the -norm of , we need the following Carleman estimate for the first order differential operator in (3.32).
Lemma 3.1
Let and be defined in (3.32) and (3.31) respectively, and assume (2.12). Then there exist constants and such that
[TABLE]
holds for all and .
Proof.
First we show that there exist constants and such that
[TABLE]
In fact, by setting , we calculate
[TABLE]
By the assumption (2.12) and in , we obtain the lower bound
[TABLE]
Then we can estimate
[TABLE]
where
[TABLE]
By , we perform integration by parts to treat as
[TABLE]
According to the assumption (2.1), both and are bounded, which indicates and thus
[TABLE]
Therefore, there exists a constant such that the right-hand side is strictly positive for all , which implies (3.34).
Next, since gives , we apply (3.34) to to obtain
[TABLE]
To further estimate the right-hand side of (3.35), we calculate
[TABLE]
Since (2.1) also gives the boundedness of and , we estimate
[TABLE]
Substituting the above inequality into (3.35), we obtain
[TABLE]
which, together with (3.34), yields
[TABLE]
Then there exists a constant such that
[TABLE]
Finally, it follows from that
[TABLE]
Applying the above estimate to (3.36), we obtain
[TABLE]
Since is a first order differential operator, it reveals that , which allows us to apply the Poincaré inequality to conclude
[TABLE]
This completes the proof of Lemma 3.1. ∎
Step 5 We complete the proof of Theorem 2.3 in this step. By (2.10) and the definition of , we see on . Together with (3.1), we obtain , which allows us to take advantage of (3.33) and Lemma 3.1 with to derive
[TABLE]
Substituting
[TABLE]
into the above inequality, we arrive at
[TABLE]
Owing to the choice of the weight function, we can employ Lebesgue’s dominated convergence theorem to absorb the first term in the right-hand side of the above estimate in the sense that
[TABLE]
Consequently, we have
[TABLE]
Recalling the facts that and , in , we further estimate the left-hand side of the above inequality from below to deduce
[TABLE]
Since and for all , we conclude
[TABLE]
Finally, discussing the two cases and as that in [15], we eventually obtain (2.13) and finish the proof.
@hangfrom@seccntformat
sectionIteration Method for Numerical Reconstruction
@xsect
2.3ex plus.2ex
As the theoretical stability is guaranteed by Theorem 2.3, in this section we study Problem 1.1 from the numerical viewpoint and aim at the derivation of an iteration method. Basically, the derivation is parallel to its counterpart in [15], where the corresponding inverse source problem was investigated. However, for Problem 1.1 we shall pay special attention to the nonlinearity and the ill-posedness in the recovery of the second order coefficient.
Instead of the general governing equation (1.3) whose coefficients are all assumed to be time-dependent, throughout this section we consider the initial-boundary value problem for a hyperbolic equation with the homogeneous Neumann boundary condition
[TABLE]
Here the boundary condition is simplified from on because is assumed as strictly positive on for the non-degeneracy. We limit the numerical treatment to the time-independent case (4.1) not only for its simplicity, but also due to the belief that the ill-posedness are essentially the same.
For later use, we recall the classical theory on the well-posedness of (4.1).
Lemma 4.1** **(see [12, 19])
Let and satisfy (4.1), where
[TABLE]
and the th order compatibility condition is satisfied on . Then there exists a unique solution to (4.1). Moreover, there exists a constant depending on such that
[TABLE]
Henceforth, we basically assume
[TABLE]
and the second order compatibility condition is satisfied on . Then according to Lemma 4.1 with , problem (4.1) admits a unique solution . As before, we still denote the unique solution to (4.1) as .
To deal with Problem 1.1 from the numerical aspect, we restrict ourselves to the following situation. Regarding the observation region, we consider the partial interior observation of in with a subdomain satisfying . In other words, we require to cover the whole boundary , which is special in Type (II) of Problem 1.1. In fact, although there seems no difference between boundary and interior measurements in the theoretical stability, the latter is definitely more informative and suitable for the numerical implementation. On the other hand, it follows from Remark 2.4 that is a sufficient condition for the global stability of Problem 1.1, which is desirable for determining in the whole domain .
In accordance with the above setting, we restrict the unknown function in
[TABLE]
with given constants and a given function . Compared with the admissible set defined in (2.11) for the theoretical stability, here we remove the restriction of on . Nevertheless, we still require that is known on the whole boundary due to the key assumption (2.10) for the stability. We refer to [10] for the same type of admissible sets as .
In practice, we are given the noisy observation data such that
[TABLE]
where and stand for the true solution and the noise level respectively. Now we are well prepared to recast Problem 1.1 into a minimization problem with the Tikhonov regularization
[TABLE]
where denotes the regularization parameter. Unlike the formulation in [20, 15], here we penalize the -norm of because one can expect certain smoothness of as the second order coefficient. Meanwhile, there is no need to penalize the -norm of due to the boundary condition on .
As usual, we shall compute the Fréchet derivative of in order to characterize its possible minimizer . For arbitrarily fixed , we may choose any such that
[TABLE]
holds for all sufficiently small . By (4.4), we directly calculate
[TABLE]
In order to pass in (4.6), we need the following technical lemma.
Lemma 4.2
Let and be the solutions to (4.1) with coefficients and respectively, where satisfy (4.2), in (4.3) and satisfies (4.5) for all sufficiently small . Then
[TABLE]
where satisfies
[TABLE]
Proof.
Introduce . By taking difference of (4.1) with and , it reveals that satisfies
[TABLE]
Since lies in the -neighborhood of by (4.5), it follows from Lemma 4.1 with that there exists a constant such that
[TABLE]
holds uniformly for all sufficiently small . This indicates
[TABLE]
uniformly for all sufficiently small , where we have by (4.5). Applying Lemma 4.1 with to (4.8), we obtain
[TABLE]
In the same manner, we further set and manipulate (4.7)–(4.8) to find
[TABLE]
Then we employ (4.9) and Lemma 4.1 with to conclude
[TABLE]
which finishes the proof. ∎
Now that the convergence is guaranteed by the above lemma, we can pass in (4.6) to deduce
[TABLE]
where denotes the characteristic function of , and we utilized on to obtain (4.10) by integration by parts.
In order to derive the explicit form of , we should further transform the first term on the right-hand side of (4.10). To this end, we follow the same line as that in [20, 15] to introduce the backward problem
[TABLE]
To clarify the dependency, we also denote the solution to (4.11) as . Since , Lemma 4.1 gives . On the other hand, it can be inferred from the proof of Lemma 4.2 that the solution of (4.7) satisfies and . Hence, in view of the weak solution of hyperbolic equations, we can regard and as mutual test functions of each other, so that we can further treat
[TABLE]
Substituting the above identity into (4.10), we arrive at
[TABLE]
Since was taken arbitrarily which satisfies (4.5), this suggests a characterization of the minimizer to the problem (4.4).
Proposition 4.3
Let be the admissible set defined in (4.3), and be the functional defined in (4.4). Then is a minimizer of within only if it satisfies the variational equation
[TABLE]
where and solve the forward system (4.1) and the backward one (4.11) with the coefficient , respectively.
On the basis of (4.12), we design the following iteration scheme
[TABLE]
where is a tuning parameter. In other words, given the result of the previous step, we have to solve the forward system (4.1), the backward system (4.11) and the boundary value problem (4.13) for a Poisson equation subsequently to obtain . In comparison with the inverse source problems treated in [20, 15, 16, 14], we see that both solutions to forward and backward problems appear in (4.13) due to the nonlinearity of Problem 1.1. More importantly, here we should update indirectly by solving an extra Poisson equation since we penalize instead of itself. Such an additional procedure, however, does not affect the efficiency because the computational cost for solving (4.13) is rather minor compared with that for solving two time evolution equations. On the other hand, in view of the variational principle, it is readily seen that the solution of (4.13) coincides with the minimizer of the minimization problem
[TABLE]
for all satisfying on .
Concerning the convergence issue, we notice the relation between the iteration (4.13) and the minimization problem of a surrogate functional
[TABLE]
Indeed, let us fix and consider the minimization of with respect to which is sufficiently close to , e.g., . Separating the terms involving from others in (4.15), we treat as
[TABLE]
where satisfies
[TABLE]
Utilizing the backward problem (4.11), we take and as mutual test functions to deduce
[TABLE]
where we used on and applied Lemma 4.1 with to to estimate
[TABLE]
within the admissible set . Substituting (4.17) into (4.16), we collect the constant component of as and conclude
[TABLE]
Comparing the above expression with (4.14), we figure out that the iterative update (4.13) is almost equivalent to solving a series of minimization problem
[TABLE]
provided that is sufficiently small. On the other hand, it is well known that the convergence of (4.18) is guaranteed by the positivity of the surrogate functional for all (see [23]). By definition, this is achieved by taking sufficiently large such that
[TABLE]
Consequently, it reveals that the convergence of (4.18) almost indicates the convergence of our proposed iteration (4.13). Unfortunately, due to the nonlinearity of the problem, we cannot remove the second order term in (4.17), which prevents us from proving the convergence rigorously.
We close this section by summarizing the main algorithm for the numerical reconstruction.
Algorithm 4.4
Fix the boundary value of . Choose a tolerance , a regularization parameter and a suitably large tuning constant . Give an initial guess and set .
Compute according to the iterative update (4.13). 2. 2.
If , then stop the iteration. Otherwise, update and return to Step 1.
@hangfrom@seccntformat
sectionNumerical Examples
@xsect
2.3ex plus.2ex
In this section, we apply the iteration method proposed in the previous section to the numerical treatment for Problem 1.1, and evaluate its numerical performance. More precisely, we shall implement Algorithm 4.4 to reconstruct the principal coefficient in the hyperbolic equation (4.1). As the first attempt, we restrict ourselves to one spatial dimension, and simply set and . We divide into equidistant meshes, and employ some unconditionally finite difference methods to solve the equations involved in Algorithm 4.4, namely, (4.1), (4.11) and (4.13).
We specify various coefficients and parameters to be used in the numerical tests as follows. For the source term and the initial value of (4.1), we fix
[TABLE]
For the boundary condition of required in (4.3), we simply set
[TABLE]
Given the true solution and thus the noiseless data , we generate the noisy data by adding uniform random noises in such a way that
[TABLE]
where denotes the random number uniformly distributed in . For the noise level , we choose it as a certain portion of the amplitude of the noiseless data, that is,
[TABLE]
For the tuning parameter , it should be chosen sufficiently large to guarantee the convergence (see (4.19)). Roughly speaking, it depends on the operator norm of the forward operator which maps to , which is impossible to compute in practice. Hence, we have to postulate that is proportional to the size of the observation subdomain. Analogously, we also make empirical choices of the the regularization parameter and the stopping criteria in Algorithm 4.4 in such a way that
[TABLE]
In all examples, we fix the initial guess as . As usual, we evaluate the numerical performance of Algorithm 4.4 by the number of iterations, the relative error
[TABLE]
the elapsed time and sometimes the illustrative figures, and we recognize as the result of the numerical reconstruction.
Example 5.1
First, we test Algorithm 4.4 with several choices of true solutions to demonstrate its accuracy and efficiency. More precisely, we fix the subdomain and the relative noise level . Correspondingly, we choose and . The following true solutions with different shapes and smoothness are taken into consideration:
- (a)
A smooth and symmetric true solution . 2. (b)
An asymmetric true solution . 3. (c)
A non-smooth true solution .
Various aspects of the numerical performance are listed in Table 1. The comparisons of true solutions with their reconstructed ones are illustrated in Figure 1.
Example 5.2
In this example, we fix the true solution as
[TABLE]
and evaluate the performance of Algorithm 4.4 with different combinations of noise levels and observation subdomains. In detail, we first fix the relative noise level as as that in Example 5.1, and change the observation subdomain as
[TABLE]
with decreasing sizes. Next, we fix and increase the relative noises as , , , and . In accordance with the above combinations of and , we also change the parameters and according to (5.1). The choices of parameters in the tests and the resulting numerical performance are listed in Table 2.
The above examples demonstrate the accuracy and robustness of Algorithm 4.4 as its previous applications e.g. in [20, 15]. Especially, in the reconstruction of the principal coefficient, it is obvious that the problem suffers from stronger ill-posedness and nonlinearity compared with the corresponding inverse source problem. Even though, the proposed method still provides satisfactory results with rather small observation subdomain and moderately large noise in observation data.
In Example 5.1, our method proves its feasibility for various choices of true solutions, even including a non-smooth one. This suggests the possibility of relaxing the assumption in the derivation of Algorithm 4.4. Unfortunately, it is shown in Figure 1(c) that our method fails to capture the local non-smoothness far away from because of its -based formulation.
On the other hand, Example 5.2 illustrates the influence of the size of and the noise level upon the numerical performance. The results agree well with our common sense, namely, a smaller observation subdomain results in a larger relative error with more iteration steps until convergence. Still, we need the coverage for the numerical stability. Meanwhile, both error and iteration steps also increase with larger noise level as expected. However, we see in Table 2 that an relative noise causes considerably large error in the reconstruction, possibly due to the strong nonlinearity of the problem.
@hangfrom@seccntformat
sectionConcluding Remarks
@xsect
2.3ex plus.2ex
The propose of this article is to investigate Problem 1.1, namely, the determination of the spatial component in the second order coefficient of a hyperbolic equation, from both theoretical and numerical aspects. Theoretically, we are mainly motivated by the existing literature represented by [10] and formulate the problem within the general hyperbolic operator with a time-dependent principal part. On the same direction of [15], we take advantage of the key Carleman estimates for to establish a local Hölder stability result for Problem 1.1. The proof starts from the routine linearization, but unlike [10] we should turn to another Carleman estimate to dominate the -norm of by that of . The reason traces back to our choice of including in the divergence in (1.1) for a concrete physical meaning. Instead, if we base the discussion on a nearly non-divergence form
[TABLE]
then the source term after linearization becomes , and the estimate of reduces to an immediate corollary of [15, Theorem 2.3]. The same comment applies to the determination of any spatial components of lower order coefficients in , by which we can expect the identical stability result. In these cases, it suffices to replace (2.12) by some analogous non-vanishing assumptions, and we omit the details here.
In the numerical aspect, we adopt the orthodox Tikhonov regularization to interpret Problem 1.1 as a minimization problem. For the highest order coefficient , we penalize the -norm of with its information given on the whole boundary. Calculating the Fréchet derivative, we derive the variational equation for a minimizer of the Tikhonov functional, which involves a backward problem and the Laplacian of . This suggests a novel iterative update (4.13), where one should solve a Poisson equation at each step. Moreover, by the variational principle we find a link between (4.13) and the minimization of a corresponding surrogate functional. Unfortunately, the convergence of the latter does not imply that of the former, because their equivalence is not rigorous due to the nonlinearity of Problem 1.1.
We conclude this paper with some possible future topics related to Problem 1.1. As was mentioned in Remark 2.4, the local stability in Theorem 2.3 relies heavily on the choice of the weight function in Carleman estimates. We shall consider the possibility of a clever choice of which optimizes the stability and reduces the observation cost. Meanwhile, another interesting issue is the simultaneous determination of several coefficients, e.g., finding in
[TABLE]
For such kind of problems, possibly one should take several measurements. As a similar but far more difficult case, one can study the same problem for linear anisotropic Lamé systems with time-dependent principal parts. Numerically, the idea of solving an auxiliary equation seems fresh in iteration methods to the best of our knowledge. We are interested in applying it to other inverse problems and analyze its properties, especially convergence.
Acknowledgement The authors appreciate the valuable discussions with Jin Cheng and Shuai Lu (Fudan University). This work is supported by A3 Foresight Program “Modeling and Computation of Applied Inverse Problems”, Japan Society for the Promotion of Science (JSPS) and National Natural Science Foundation of China. The second and the third authors are partially supported by Grant-in-Aid for Scientific Research (S) 15H05740, JSPS. The second author is supported by JSPS Postdoctoral Fellowship for Overseas Researchers and Grant-in-Aid for JSPS Fellows 16F16319.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. A. Adams, Sobolev Spaces , Academic Press, New York, 1975.
- 2[2] M. Bellassoued, Uniqueness and stability in determining the speed of propagation of second-order hyperbolic equation with variable coefficients, Appl. Anal. , 83 (2004), 983–1014.
- 3[3] M. Bellassoued and M. Yamamoto, Logarithmic stability in determination of a coefficient in an acoustic equation by arbitrary boundary observation, J. Math. Pures Appl. , 85 (2006), 193–224.
- 4[4] M. Bellassoued and M. Yamamoto, Determination of a coefficient in the wave equation with a single measurement, Appl. Anal. 87 (2008), 901–920.
- 5[5] A. L. Bukhgeim and M. V. Klibanov, Global uniqueness of a class of multidimensional inverse problems, Soviet Math. Dokl. , 24 (1981), 244–247.
- 6[6] I. Daubechies, M. Defrise and C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Comm. Pure Appl. Math. , 57 (2004), 1413–1457.
- 7[7] I. Daubechies, G. Teschke and L. Vese, Iteratively solving linear inverse problems under general convex constraints, Inverse Probl. Imaging , 1 (2007), 29–46.
- 8[8] O. Y. Imanuvilov and M. Yamamoto, Global uniqueness and stability in determining coefficients of wave equations, Comm. Partial Differential Equations , 26 (2001), 1409–1425.
