Linearized inverse Schr\"odinger potential problem at a large wavenumber
Victor Isakov, Shuai Lu, Boxi Xu

TL;DR
This paper studies the linearized inverse Schrödinger potential problem at high wavenumbers, demonstrating improved stability and proposing an efficient Fourier mode reconstruction algorithm verified by numerical examples.
Contribution
It introduces a stability analysis at large wavenumbers and develops a new reconstruction algorithm for the potential function.
Findings
Hölder type stability at large wavenumbers
Exponential dependence of stability on attenuation constant
Successful numerical reconstruction of Fourier modes
Abstract
We investigate recovery of the (Schr\"odinger) potential function from many boundary measurements at a large wavenumber. By considering such a linearized form, we obtain a H\"older type stability which is a big improvement over a logarithmic stability in low wavenumbers. Furthermore we extend the discussion to the linearized inverse Schr\"odinger potential problem with attenuation, where an exponential dependence of the attenuation constant is traced in the stability estimate. Based on the linearized problem, a reconstruction algorithm is proposed aiming at the recovery of the Fourier modes of the potential function. By choosing the large wavenumber appropriately, we verify the efficiency of the proposed algorithm by several numerical examples.
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.
\newsiamremark
remarkRemark \newsiamremarkhypothesisHypothesis
\newsiamthmclaimClaim \headersLinearized inverse Schrödinger potential problem V. Isakov, S. Lu and B. Xu
Linearized inverse Schrödinger potential problem at a large wavenumber††thanks: Submitted to the editors DATE.
\fundingThis research is supported in part by the Emylou Keith and Betty Dutcher Distinguished Professorship and the NSF grant DMS 15-14886. Shuai Lu is supported by NSFC No.11522108, Shanghai Municipal Education Commission No.16SG01. Boxi Xu is supported by NSFC No.11801351.
Victor Isakov Department of Mathematics, Statistics, and Physics, Wichita State University, Wichita, KS 67260-0033, USA (Email: [email protected]).
Shuai Lu School of Mathematical Sciences, Fudan University, No.220 Road Handan, Shanghai 200433, China (Email: [email protected]).
Boxi Xu Corresponding author. School of Mathematics, Shanghai University of Finance and Economics, No.777 Road Guoding, Shanghai 200433, China (Email: [email protected]).
Abstract
We investigate recovery of the (Schrödinger) potential function from many boundary measurements at a large wavenumber. By considering such a linearized form, we obtain a Hölder type stability which is a big improvement over a logarithmic stability in low wavenumbers. Furthermore we extend the discussion to the linearized inverse Schrödinger potential problem with attenuation, where an exponential dependence of the attenuation constant is traced in the stability estimate. Based on the linearized problem, a reconstruction algorithm is proposed aiming at the recovery of the Fourier modes of the potential function. By choosing the large wavenumber appropriately, we verify the efficiency of the proposed algorithm by several numerical examples.
keywords:
Stability estimate, Inverse boundary value problem, Schrödinger potential problem
{AMS}
35R30, 65N21
1 Introduction
We consider a linearized problem of recovering the potential function in the Schrödinger equation
[TABLE]
from many boundary measurements at a large wavenumber in the dimension . As the data, we use a linearized form of the standard Dirichlet-to-Neumann (DtN) map
[TABLE]
which will be specified below.
Reconstruction of the Schrödinger potential function at a fixed wavenumber in (1) retrospects back to the original inverse conductivity problem, proposed by Calderón, arising in electrical impedance tomography where uniqueness for the linearization can be proven by using the complex exponential solutions [7]. Later on, the fundamental work by Sylvester and Uhlmann proved the global uniqueness for the inverse potential problem in three and higher dimensions by constructing almost complex exponential solutions, which also yields the global uniqueness of the inverse conductivity problem [17]. In two dimensions, recent work by Bukhgeim [6] demonstrated uniqueness, at any fixed , by introducing stationary phase methods. At , a logarithmic stability estimate of recovering the potential function is given by Alessandrini [1] and is further proven to be optimal by Mandache [16]. As for the numerical reconstruction of the potential function (or the conductivity function) at a fixed wavenumber, we refer to [10] and recent work [9]. We shall mention that the inverse medium problem in [2] also highly relates with the current work.
Recently it has been widely observed in different inverse boundary value problems that the stability estimate improves with growing wavenumbers (or energy) both analytically and numerically. The increasing stability in the inverse boundary value problem for the Schrödinger equation (1) was firstly observed within different ranges of the wavenumbers in [12]. In [15], the authors considered the increasing stability on inverse boundary value problems for the Schrödinger equation with attenuation where a linear exponential dependence on the attenuation constant is established. We note that all the above mentioned increasing stability results on inverse Schrödinger potential problems are considered in three and higher dimensions under different a priori regularity assumptions.
Another multifrequency set-up uses single observation for multiple wavenumbers. To have an overview of such results, we recommend a recent review paper [3] which nicely summarizes the theoretical and numerical evidences verifying the increasing stability in inverse medium and source problems for acoustic Helmholtz equations and Maxwell equations.
In this paper, we investigate a linearized form of the inverse Schrödinger potential problem (1) with a large wavenumber in two and higher dimensions. Such a linearization is carried out at a zero potential function which is reasonable if is sufficiently small compared with the squared wavenumber . Noticing that the squared wavenumber may be large, we are allowed to reconstruct a potential function of moderate amplitude. In Section 2 we introduce the linearized problem and obtain an (increasing) Hölder-type stability estimate for the linearized inverse Schrödinger potential problem with a large wavenumber by using bounded complex exponential solutions. We extend, in Section 3, the discussion to the inverse Schrödinger potential problem with attenuation. An exponential dependence on the attenuation constant in the stability estimate is observed. A novel reconstruction algorithm is proposed to recover the Fourier modes of the potential function in Section 4 based on the Calderón’s method. By choosing the large wavenumber appropriately, we show various numerical examples confirming the efficiency of the proposed algorithm in Section 5. Finally a conclusion Section 6 ends the manuscript with further prospects.
2 Increasing stability in the linearized inverse Schrödinger potential problem at the large wavenumber
We recall that the original problem, which initializes the current work, is to find the Schrödinger potential function defined in a bounded domain in the following problem
[TABLE]
from the knowledge of the Dirichlet-to-Neumann (DtN) map
[TABLE]
We assume that is not a Dirichlet eigenvalue for the Laplace operator in .
If we assume that is small (or is large), we can justify the linearization of the Schrödinger equation. More precisely, let , solve the following sub-problems
[TABLE]
then the solution of the original problem (2) is
[TABLE]
where the remaining ”” are ”higher” order terms. The linearzied DtN map of in (3) is defined accordingly as
[TABLE]
Multiplying both sides of the sub-problem (4b) with a test function satisfying the equation
[TABLE]
we obtain
[TABLE]
Without loss of generality we may assume that . Let and be the operator norm of . We present the main stability estimate below:
Theorem 2.1**.**
Let , , and , , then the following estimate holds true
[TABLE]
*for the linearized system (4a)-(4b) with and the constant depending on the domain . *
Proof.
The proof is based on the complex exponential solutions suggested by Calderón [7] and Faddeev [11]. Let and with . We consider the following solutions
[TABLE]
To select and , we introduce an orthonormal base of and let
[TABLE]
where if . For brevity, we denote . Then and from the equality (6) we derive
[TABLE]
Here denotes the Fourier transform.
Observe that if , then the norms of exponential solutions in (7) are bounded as follow
[TABLE]
where is the volume of . If , then
[TABLE]
where over all -dimensional orthonormal projections of .
By the trace theorem, there hold
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Let and , , we consider two cases
- a)
(i.e. ), and 2. b)
(i.e. ).
In the case a), we have
[TABLE]
where is the volume of an unit ball in , and the constant is defined as .
In the case b), we let and split
[TABLE]
The second term in the above inequality is derived by (12) and the fact that
[TABLE]
increases while and hence
[TABLE]
Observe that, since ,
[TABLE]
Thus
[TABLE]
where .
Combining case a) with the bound (13) and case b) with the bound (14), we prove Theorem 2.1.
Remark 2.1**.**
*When is a sphere, constants in the trace theorem are explicit and one can make in Theorem 2.1 explicitly. *
In view of (14) it is obvious that stability is increasing with growing wavenumber , provided . We comment on the increasing stability when . In such a case, we have an upper bound estimate (13) of which is
[TABLE]
By an elementary calculus, the upper bound decreases on and increases on where
[TABLE]
If in (15), we have
[TABLE]
and the minimum of is obtained at such that
[TABLE]
If , then minimum of is obtained at such that
[TABLE]
Now we consider the ”small” perturbation when (i.e., ). If , then minimum of (at ) is
[TABLE]
If , then minimum of is at which is the same as in the case . So in all possible cases above, given a small error (or a perturbation) we can choose a large wavenumber producing a Hölder stability which is a big improvement over a logarithmic stability at low wavenumbers.
3 Linearized inverse Schrödinger potential problem at the large wavenumber with attenuation
Furthermore we provide some extended discussion on the linearized inverse Schrödinger potential problem with attenuation. The original problem in three (and higher) dimensions is studied in [15] where increasing stability estimates with a linearly exponential dependence of the attenuation constant are obtained for low/high frequencies separately by constructing almost complex exponential solutions and real solutions respectively.
In current section, we investigate the stability estimate recovering the potential function below
[TABLE]
from the knowledge of linearized DtN map for a large wavenumber . The constant is the attenuation constant. For the sake of simplicity, we use the notations in Section 2, for instance, that represents the solution of the Schrödinger potential equation with attenuation.
Referring to Section 2, we let , solve the following sub-problems
[TABLE]
and the solution of (16) is
[TABLE]
with ”” denoting the remaining terms. Similarly the linearized DtN map is defined as
[TABLE]
Multiplying both sides of the sub-problem (17b) with a test function satisfying
[TABLE]
we obtain the equality
[TABLE]
which will again play important roles below.
Let be the operator norm of , and , . We present the main stability estimate in this section.
Theorem 3.1**.**
Let , , and , , then the following estimate holds true
[TABLE]
*for the linearized system (17a)-(17b) with and the constant depending on the domain . *
Proof.
Similar to the proof of Theorem 2.1, we again use the exponential solutions.
Let and with . We consider the following solution
[TABLE]
The orthonormal base is chosen by and we let
[TABLE]
Then and we derive, by (19)
[TABLE]
We can write , . If , then squaring the both sides and following the arguments in [15], we have
[TABLE]
If , we derive
[TABLE]
On the other hand, if , then
[TABLE]
We then derive that
- •
if , then
[TABLE]
- •
If , then
[TABLE]
- •
If , there holds
[TABLE]
where a variable due to (20).
Similarly to the proof of Theorem 2.1, we have
[TABLE]
which further yields that
- •
if , then
[TABLE]
- •
If , then
[TABLE]
- •
If , then
[TABLE]
Let , and . We again consider the cases below
- a)
(i.e. ), and 2. b)
(i.e. ).
In the case a), we have
[TABLE]
In the case b), we again choose and split
[TABLE]
As in Theorem 2.1, increases while and thus it attains the maximum value if , which yields
[TABLE]
Since
[TABLE]
and, by using
[TABLE]
we then bound
[TABLE]
Meanwhile, by using and the proof of Theorem 2.1, we yield
[TABLE]
Combining above inequalities and using again, we conclude that
[TABLE]
We end the proof by combining the bounds (21) for and (22) for .
Following the discussion in Section 2, we again observe the increasing stability with growing wavenumbers . At the same time, because of the attenuation term, such an error estimate is deteriorated by the attenuation constant with a linearly exponential growth. Such a dependance is better than that for the multifrequency inverse source problem where a quadratically exponential growth is observed comparing the increasing stability estimates in [8, 14].
4 Reconstruction algorithm
In this section, we propose a reconstruction algorithm for the linearized inverse Schrödinger potential problem at a large wavenumber, observing that the linearized problems are (4a) and (4b). For the sake of simplicity, we fix the dimensionality .
The linearized problem (4a)-(4b) represents a linearized DtN map by varying . In particular, we can choose the solutions to be the bounded complex exponential solutions (7) for such that
[TABLE]
by varying different vectors in the phase space and , where satisfies and . At the same time, substituting each above into the second problem (4b), we obtain the solution and its Neumann trace which also varies with different choice of . Similarly we can choose the test function to be the relevant exponential solutions
[TABLE]
To realize the reconstruction algorithm numerically, we shall approximate the linearized DtN map (5) accurately. In particular, we mention that the Neumann boundary data depends on the unknown potential function referring to (4b). Assuming that the potential function is comparably small with respect to the squared wavenumber and following the standard linearization approach (for instance, in [10]), we define a linearized Neumann boundary data
[TABLE]
where is the Neumann boundary data in (3) of the original problem (2) and is the Neumann boundary data of the sub-problem (4a). We thus approximate the linearized Neumann boundary data numerically by , where the ”higher” order terms are ignored in (25). If we substitute the above solutions (23), (24) into the equality (6), the recovery of is equivalent to solving the following integral equations
[TABLE]
where vectors , vary in the phase space with a fixed wavenumber . The left hand side of the above formula (26) is the Fourier coefficient of the potential function at a point . Thus the reconstruction of can be achieved by varying vectors , and the inverse Fourier transform.
Remark 4.1**.**
Notice that, in current section, the chosen orthonormal base of the phase space is . Thus the formula of a vector (or ) is fixed by . Noticing that and , we write the exponential solution (or ) explicitly by
[TABLE]
*Indeed, is a plane wave traveling along its wave-vector with a length equal to the wavenumber if . Meanwhile, if , the (high) oscillation of the exponential solution is observed in a direction with the spatial frequency , and decays exponentially along the unit vector . Then numerical calculation in (6) or (26) becomes unstable when . *
Now we describe a reconstruction algorithm based on discrete sets of length and angle of the vectors in phase space. We first choose a discrete and finite length set
[TABLE]
Here we choose and is the maximum length of the vector . Combining with two unit vector (or angle) sets
[TABLE]
which satisfy that , we denote
[TABLE]
which are the vectors (or points) chosen in the phase space, while and . More precisely, the superscript notation will be referred to a vector with the th length and the th angle . Finally, for the inverse Fourier transform, a numerical quadrature rule can be constructed by a suitable choice of the weights according to these points .
We summarize our reconstruction algorithm below.
Algorithm 1: Reconstruction Algorithm for the Linearized Schrödinger Potential Problem
Input: , , and ;
Output: Approximated Potential .
- 1:
Set ; 2. 2:
For (length updating) 3. 3:
For (angle updating) 4. 4:
Choose and ; 5. 5:
Measure the Neumann boundary data of the forward problem (2) 6. given the Dirichlet boundary data ; 7. 6:
Calculate the approximated Neumann boundary data 8. on the boundary ; 9. 7:
Choose and w:=\big{[}u_{0}v\big{]}^{-1}=\exp\{-\mathbf{i}\xi^{\langle\ell;s\rangle}\cdot x\}; 10. 8:
Compute ; 11. 9:
Update ; 12. 10:
End 13. 11:
Set ; 14. 12:
End.
The above Algorithm 1 provides us with a reconstructed potential function to mimic the exact one. The main error between these two potential functions consists of two parts. The first one is the approximation error because of the discrete and finite length set and angle sets. The second one is the numerical error of approximated linearized DtN map in (26) where the elliptic equation solvers of large wavenumbers and the numerical differentiation of the Neumann boundary data may induce some additional ill-posedness. The error estimate of Algorithm 1 may be carried out by choosing the length and angle sets following the analysis in [4, 5]. We intend to report such results in a separate work.
5 Numerical examples
In this section, we provide some numerical examples verifying the efficiency of the above Algorithm 1. The main computational costs in Algorithm 1 is Step 5 for the forward problem (2) and Step 9 for the inverse Fourier transform. To avoid the inverse crime, we will use fine grids (for instance, or equal-distance points) for the forward problem and a coarse grid ( equal-distance points) for the inversion both in the square domain .
5.1 CASE 1
In the first case, a circular domain with a radius and a simple true potential function are chosen, which are shown in the upper left panel of Figure 1. The potential function contains one peak and one valley patterns in the bounded domain . The boundary measurement points on are also presented in the upper left panel of Figure 1, marked by ””. The forward problem grid is equal-distance points and the inversion grid is equal-distance points in the domain . In Subsection 5.1.3, we will show that one can improve the resolution of the reconstructed potential function if a finer grid of the forward problem is chosen.
5.1.1 CASE 1: General recovery
To realize the Fourier transform , we use the following sampling points in the phase space which are marked by ”” in the upper right panel of Figure 1. The modulus of , that is , are equally distributed in the interval , and the step size is . The degree of the angle between two adjacent slope lines is . For example, the red ”” in the upper right panel of Figure 1 is a point in the phase space with an angle and a modulus . Thus, the coordinate of this point in the phase space is , or and , i.e., . Fourier coefficients of the true potential function near the nine slope lines are presented in the bottom panel of Figure 1.
By varying different (or corresponding ) and different in the given sets, we obtain different exponential solutions (23) (or (27)). In particular, we present two different (real part only) in Figures 2 for and Figure 4 for while is fixed. The real part of the corresponding Dirichlet boundary data for the linearized problem are also presented in these two figures. For instance, in Figure 2 (left), the exponential solution with a small length and is a plane wave indeed. In Figure 2 (middle), we present its Dirichlet boundary data . By substituting the Dirichlet boundary data into the original problem (2), we obtain the solution and its Neumann boundary data , which are shown in Figure 2 (right). In order to obtain the measurable data of the linearized DtN map (5), we subtract the benchmark solution with respect to the solution in Figure 3 (left), and measure the linearized data on the boundary , which is shown in Figure 3 (right).
The second exponential solution with a large length and is shown in Figure 4 (left) where exponential decay in the direction is observed. The Dirichlet boundary data and the Neumann boundary data are shown in Figure 4 (middle and right) respectively. The difference between and , the measurable data of the linearized DtN map are shown in Figure 5. Compared with the moderate linearized difference for as shown in Figure 3, we observe a large amplitude of the linearized difference in the right panel of Figure 5 for . Such phenomena further yields an unstable calculation of the Fourier coefficients when .
Noticing that the exponential solution in (24) is similar to , we use the same sampling points in the upper right panel of Figure 1 for . However, to illustrate the difference, for any given wavenumber and vector , the directions of two wave-vectors and are not the same. Indeed, since these vectors obey , the wave-vectors , of exponential solutions and are symmetric with respect to the vector (or ). Thus, we could reflect the pattern of the exponential solution with respect to the vector to obtain the pattern of the solution .
The key step of the reconstruction Algorithm 1 is to compute the value of each Fourier coefficient with different for any fixed by employing the formula (26). The numerical coefficients are collected in Figure 6 when . Each curve there represents the recovered value of Fourier coefficients on each slope of sampling points in the upper right panel of Figure 1, while the horizontal axis is the length interval for . We shall emphasize that the chosen wavenumber avoids the eigenvalues for the Laplacian operator in the domain . On the other hand, by choosing a wavenumber near the eigenvalues, we may recover a potential function with lower resolution which will be presented in next subsection.
Finally, we implement the inverse Fourier transform to reconstruct the potential function . To obtain such a reconstruction, we need to choose a truncated value in the phase space such that all the Fourier coefficients with shall be used to reconstruct an approximant. By choosing different truncated value while , we collect those reconstructed functions in Figure 7. More precisely, the dashed lines in Figure 6 highlight those threshold values as , and when . The Fourier coefficients with lengths smaller than the threshold values, i.e. , will be used to generate respectively. As one can observe, we obtain a stable reconstructed potential function with threshold values and in Figure 7 (left and middle), because all the Fourier coefficients are rather small for or . The more Fourier coefficients when , the better resolution of the reconstructed potential . On the other hand, if we increase the truncated value to , we observe some high frequency patterns in the right panel of Figure 7, which are also reflected in the (blowing-up) Fourier coefficients when , see Figure 6, or referring to the estimate (12) in the proof of Theorem 2.1. In current work, we change different truncated value , but in real calculation we suggest to choose the truncated value .
We shall note that a large value of the wavenumber allows us to use more (stable) Fourier coefficients in the phase space when . To visualize such difference, we presents the reconstructed potential function in Figure 8 by choosing and the truncated values respectively.
5.1.2 CASE 1: Recovery at a large wavenumber near eigenvalues
In this subsection, we numerically investigate the consequence by choosing a large wavenumber near eigenvalues for a Laplacian operator in the circular domain .
A particular choice of such a large wavenumber is . In Figure 9, we present the reconstructed Fourier coefficients and the reconstructed potential function analogously as in the previous subsection by choosing truncated values . Noticing that the high frequency patterns appear in Figure 9 (right), we also observe (blowing-up) Fourier coefficients compared with those in Figures 6.
5.1.3 CASE 1: Finer grids and less Fourier modes
We further focus on another two numerical aspects enhancing or weakening the resolution of the reconstructed potential function .
The first aspect is the grid of the forward problem. In the above two subsections, we choose a equal-distance points grid in . The chosen grid may capture some solution patterns if the wavenumber is small. But when the wavenumber increases, for instance from to , the high frequency patterns induced by large wavenumbers may not be accurately demonstrated in the grid. To weaken such difficulty, we consider a finer equal-distance points grid in . By implementing the same approach in the above subsection, we present the Fourier coefficients and their reconstructed potential function in Figure 10 for again. As one can observe, the Fourier coefficients of the finer grid become more accurate in the large length interval () than those of the original grid. The reconstructed potential functions also enhance the resolution (in the peak pattern) if we choose the truncated value , see Figure 10 (right).
We also investigate the influence of the observation angles, i.e. the limited-angle slope lines in the upper right panel of Figure 1. In Figure 11, we show the recovered potential functions with , , different slope lines by choosing the truncated value and . Compared with the result in Figure 10, we observe that the more slope lines, the better accurately recovered potential functions, because of the gained Fourier coefficients. In principle, one can include more angle slope lines to obtain better resolution.
5.2 Another numerical example
Another example considers a complicate potential function in Figure 12 (left) with the same circular domain . Similar to the previous example, the same set of the sampling points in the phase space is utilized referring to the upper right panel of Figure 1. For the sake of simplicity, we skip all the discussion on the reconstruction algorithm but provide the reconstructed potential function with the truncated value and , respectively in Figure 12 (middle & right). Similarly, we also have chosen a finer equal-distance points grid in the domain for the forward problem. Comparing the reconstructed potential functions for and , we clearly visualize the improved resolution at the large wavenumber.
6 Conclusion
The original inverse problem for the Schrödinger potential is ill-posed and nonlinear (moreover, non-convex). To study stability we prefer to focus on the most serious difficulty: ill-conditioning and we linearized inverse problem to avoid additional difficulties with multiple local minima. A numerical solution of the linearized problem is much faster and more reliable and is quite satisfactory in many applications.
We demonstrated that recovery of the Schrödinger potential from all boundary data at a fixed energy/wavenumber is dramatically improving for a larger . There is no doubt that this improvement will be more significant when finding more complicated or using a complete nonlinear problem.
These results promise a better numerical reconstruction of the conductivity coefficient in the stationary Maxwell system at higher wavenumbers, as predicted analytically in [13]. We intend to work on the reconstruction at least in the linearized version in near future. There are good expectations that such numerical results will be a solid base for a serious improvement in the electrical impedance tomography which now suffers from a very low resolution. As known, this type of tomography has many geophysical and medical applications.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Alessandrini, G Stable determination of conductivity by boundary measurement . Appl. Anal, 27 (1988), 153–172.
- 2[2] Bao, G; Li, P Inverse medium scattering for the Helmholtz equation at fixed frequency . Inverse Problems 21 (2005), no. 5, 1621–1641.
- 3[3] Bao, G; Li, P; Lin, J; Triki, F Inverse scattering problems with multi-frequencies . Inverse Problems 31 (2015), no. 9, 093001, 21 pp.
- 4[4] Bao, G; Lu, S; Rundell, W; Xu, B A recursive algorithm for multifrequency acoustic inverse source problems . SIAM J. Numer. Anal. 53 (2015), no. 3, 1608–1628.
- 5[5] Bao, G; Triki, F Error estimates for the recursive linearization of inverse medium problems . J. Comput. Math. 28 (2010), 725–744.
- 6[6] Bukhgeim, A L Recoverying a potential from Cauchy data in the two-dimensional case . J. Inv. Ill-Posed Probl. 16 (2008), 19–34.
- 7[7] Calderón, A P On an inverse boundary value problem . in Seminear on Numerical Analysis and Its Application to Continuum Physics, Rio de Jeneiro (1980), 65–73.
- 8[8] Cheng, J; Isakov, V; Lu, S Increasing stability in the inverse source problem with many frequencies . J. Differential Equations 260 (2016), no. 5, 4786–4804.
