Convergence of a spectral regularization of a time-reversed reaction-diffusion problem with high-order Sobolev-Gevrey smoothness
Abstract.
The present paper analyzes a spectral regularization of a time-reversed reaction-diffusion problem with globally and locally Lipschitz nonlinearities. This type of inverse and ill-posed problems arises in a variety of real-world applications concerning heat conduction and tumour source localization. In accordance with the weak solvability result for the forward problem, we focus on the inverse problem with high-order Sobolev-Gevrey smoothness and with Sobolev measurements. As expected from the well-known results for the linear case, we prove that this nonlinear spectral regularization possesses a logarithmic rate of convergence in a high-order Sobolev norm. The proof can be done by the verification of variational source condition; this way validates such a fine strategy in the framework of inverse problems for nonlinear partial differential equations. Ultimately, we study a semi-discrete version of the regularization method for a class of reaction-diffusion problems with non-degenerate nonlinearity. The convergence of this iterative scheme is also investigated.
Key words and phrases:
Inverse reaction-diffusion problem, spectral regularization, variational source condition, error estimates, Sobolev-Gevrey smoothness, iterations.2000 Mathematics Subject Classification:
35R30, 65J20, 45L05, 65N15, 35B651. Introduction
1.1. Statement of the inverse problem
Here we are interested in a time-reversed reaction-diffusion model, denoted by , with nonlinear source terms. Let be a cube of for . In this context, we consider a population density where with , obeying the following evolution equation:
(1.1) |
associated with the periodic boundary conditions, i.e. for where denotes the standard basis vector for .
Here, involves the linear second-order differential operator and thus accounts for the anisotropic diffusion of the population. The nonlinearity indicates either the deterministic reaction rate or the proliferation rate for some mechanism processes. Eventually, we complete the time-reversed model by the final condition
(1.2) |
Together with the periodic boundary condition, (1.1) and (1.2) structure our time-reversed reaction-diffusion model. In principle, the problem is well known to be severely ill-posed and has been investigated in a wide range of real-world applications; see e.g. [17, 10, 5] and references cited therein for an overview of recent results and existing models. Taking into account tumour models (see e.g. [10]), the physical meaning behind this problem is locating the tumour source by recovering the initial density of the tumour cells. In other words, the inverse problem we want to investigate in this paper is seeking the initial value in a regular tissue , provided that (1.1) and (1.2) are satisfied.
Naturally, we impose here the standard measurement on the final data (1.2), which reads as
(1.3) |
where represents the deterministic noise level. In practice, one attempts to get the initial function from this measured data using some potential regularization.
Remark 1.
As noteworthy examples for the nonlinearity described in Model , we take into account sigmoidal laws in population dynamics of cancer. The modest and simplest tumor growth is the logistic law, which can be generalized by the von Bertalanffy law with where and are specific non-negative numbers depending on every model. We also know that if the growth rate decays exponentially, the logistic growth turns out to be the so-called Gompertz law whenever satisfies some additional information to avoid the singularity of the logarithmic form. In more complex scenarios (e.g. two-species models), one usually agrees with the de Pillis-Radunskaya law standing for the fractional kill rate of tumor-specific effector cells, which reads as . This is, furthermore, analogous to the generalized Michaelis–Menten law in enzyme kinetics. Another example can also be the Frank-Kamenetskii model in combustion theory, governed by the Arrhenius law of the form . Accordingly, we see that investigating Model can be helpful in many areas of science and engineering.
1.2. Organization of the paper
In the following, we denote by for the Hilbert spaces equipped with the standard norms and with the periodic boundary conditions posed in the domain. For , we define the Gevrey classes where the operator is defined in (1.1). These are also Hilbert spaces with respect to the inner product
and then with the corresponding norm
With this setting, it is worth mentioning the weak solvability of the forward problem of where is real analytic. Note that cf. [2], the real analyticity of means that if it can be represented by for , then the corresponding majorising series is convergent for any .
Theorem 2.
[2, Theorem 1] Assume the initial data for and the nonlinearity is real analytic. Then there exists a time such that the forward model of Model has a unique regular solution in the sense that satisfying and
for all and for a.e. . Furthermore, this regular solution satisfies for .
As a by-product of Theorem 2, we can show that for all and then by virtue of the Taylor series expansion of . Therefore, in this work we assume our final time of observation is such that . Since , it is reasonable to assume in that
(1.4) |
This paper is devoted to the convergence analysis of a modified cut-off regularization of the inverse problem . In this regard, we comply with the weak solvability of the forward model to take into account the Gevrey-Sobolev source conditions for the inverse problem. In other words, together with Assumption (1.4) we make use of the following source condition:
(1.5) |
It is worth mentioning that in the forward process, we obtain the solution in with , which indicates the fact that the solution belongs to . Instead of working with the real analyticity of , we can further apply the mean value theorem to get
(1.6) |
where for we have denoted by
To this end, we will thus exploit Assumption (1.6) through the analysis of Section 2. We also assume that there exists a continuous function such that
(1.7) |
Naturally, observing the applications mentioned in Remark 1 we have
-
•
for the von Bertalanffy law: ;
-
•
for the Gompertz law:
-
•
for the de Pillis-Radunskaya law: for ;
-
•
for the Arrhenius law: if and if .
In this work, all the constants used here are independent of the measurement error . Nonetheless, their precise values may change from line to line and even within a single chain of estimates. On the other side, we use either the superscript or the subscript to accentuate the possible dependence of the present error on the constants.
In the first step, we derive the error bounds when is independent of . Our proof relies on the way we verify a variational source condition. This interestingly contributes to one of their first applications to the convergence analysis of regularization of inverse problems for nonlinear PDEs. In this approach, we prove the usual logarithmic-type rate of convergence of the nonlinear spectral regularization. We remark that during the time evolving backward in the open set , the nonlinear scheme yields the asymptotic Hölder rate. When essentially depends on , the convergence is slower due to the phenomenal growth of the quantity involved in the Lipschitz property (1.6). Technically, the impediment of this growth, albeit its high-impact on the structure of the variational source condition, can be solved using a careful choice of a cut-off function for the nonlinearity . In this sense, the regularized solution is sought in a proper open set decided by the measurement parameter . Eventually, a slower logarithmic-type convergence is also expected, which extends the results in [8, 17, 15] and references cited therein. Typically, this extension illuminates that the Gevrey regularity conventionally restricted to the convergence analysis in [17, 15] is applicable when solving a class of time-reversed PDEs. We also add that this work partly completes the gap of verifying variational source conditions for a class of nonlinear PDEs, which is still questioned in [8].
In the second theme, our concentration moves to a derivation of an iteration-based version of the nonlinear spectral scheme with a stronger version of (1.6). We end up with the convergence of the approximate scheme by exploring the choice of the so-called stabilization constant, which depends not only on the number of iterations, but also on the measurement .
Prior to the setting of our approach and to closing this section, we introduce what the variational source condition concerns in principle as it is exploited in the skeleton of our proof.
1.3. Background of the variational source condition
Consider the ill-posed operator equation where maps from to with and being Hilbert spaces. In this Hilbert setting, we denote by the exact solution and by the noisy data satisfying , where represents the deterministic noise level (cf. e.g (1.3)). There are several stable approximations to regularize such equations. One of the most effective methods is Tikhonov regularization in which the exact solution is approximated by a solution of the minimization problem, viz.
(1.8) |
for some regularization parameter .
In regularization theory, one can prove that for suitable choices of in some adequate topology. Furthermore, people usually want to specify rates of convergence, which turns out to be the question of finding the worst case error, since such rates are arbitrarily slow in general. Denote by an index function if it is continuous and monotonically increasing with . In this sense, one aims to:
Find (usually compact) subspaces such that there exists an index function satisfying for all , it holds
Nevertheless, we often need additional a priori assumptions on the exact solution to gain the speed of convergence, which are called source conditions. In the literature, the former type of such conditions singles out that for some , renowned as the spectral source condition in the community of inverse and ill-posed problems for several years; see e.g. [11] for a prevailing background of source conditions. Here could be of the Hölder and logarithmic types, depending on every situation. More recently, a novel formulation for source conditions has been derived in the sense of variational inequality, which reads as
(1.9) |
Cf. [6], it is in particular called as the variational source condition. Essentially, we can benefit from this source condition not only to simplify proofs for convergence rates in Hilbert frameworks, but also to extensively work in some Banach setting and in more general models with distinctive measurements (cf. e.g. [9, 4, 12]). Compared to the spectral source condition, it does not require the Fréchet derivative and would thus be helpful in certain applications where the forward operator is not sufficiently smooth. Most importantly, variational source conditions have been shown to be well-adapted to bounded linear operators in Hilbert spaces; see [3]. On top of that, the variational source condition combined with some nonlinearity condition has been formulated in e.g. [16] to treat nonlinear operators.
Even though there have been enormous advantages over the spectral source conditions, variational source conditions could barely be verified in particular models in terms of partial differential equations. So far, with the aid of complex geometrical optics solutions the variational source condition holds true for an inverse medium scattering problem (cf. [7]) with in the logarithmic form when the solution belongs to some Sobolev ball. In this paper, we aim to show that it holds true for more complex and nonlinear models. It is worth mentioning that characterizations of the variational source conditions have been obtained in [8] where the degree of ill-posedness and the smoothness of solution are established for arbitrary families of subspaces. Denoting by the set of all bounded linear transformations mapping from onto itself, the characterizations are provided cf. [8, Theorem 2.1] in the following.
Suppose there exists a family of orthogonal projections indexed by a parameter in some index set such that for some functions and some the following conditions hold true for all : , for any with . Then satisfies the variational source condition (1.9) with and is a concave index function if .
2. Spectral cut-off projection
2.1. Settings of the cut-off approach
In line with the characterizations of variational source conditions, in this section we verify and improve the cut-off projection that has been postulated in [15, 18], using Assumptions (1.3), (1.4), (1.5), (1.6), (1.7). The nature of this approach is that one solves the problem in a finite dimensional subspace, which turns out to be a well-posed problem effectively controlled by the measurement error.
We denote by the spectral family of the positive operator defined in the backward problem and the function is called the spectral distribution function of . Thereby, with being a cut-off parameter that will be chosen appropriately, we introduce the spectral cut-off projection where denotes the characteristic function of the interval with . To establish the stable approximate problem of , we adapt the cut-off projection to both the nonlinearity and the final data . When doing so, we characterize the abstract Gevrey class for and as
equipped with the norm
Henceforward, for each we take into account the following approximate problem, denoted by ,
We define a mildly weak solution of (or a mild solution for short) to be a continuous mapping obeying the integral equation
(2.1) |
Observe that in (2.1) we actually obtain an integral equation of the form where is completely formulated by the right-hand side, mapping from onto itself. Therefore, the existence and uniqueness results for (2.1) can be done by the standard fixed-point argument, requiring that the number of fixed-point iterations must be larger than the stability magnitude usually involved in the approximate problem. Since these results are standard, we, for simplicity, refer the reader to the concrete reference [17] for the detailed notion of proof.
Observe again from (2.1) that we can define the cut-off operator for the solution by fixing . In particular, it is an orthogonal projection given by
(2.2) |
2.2. Verification of the cut-off approach: high-order Sobolev-Gevrey smoothness
From now on, we aim to verify a modified version of the spectral cut-off regularization in a high-order smoothness setting. As delved into the nonlinear case in [15], if we impose the Gevrey smoothness on for all , the verification of this approach is straightforward. We thereupon obtain the convergence for ; compared to the standard cut-off method which yields the convergence only for in the nonlinear case. This regularity assumption is very strong and it does not seem applicable as discussed in the analysis of the forward model (cf. Theorem 2), saying that the Gevrey smoothness can only be available for . It turns out that we need some modification of this cut-off projection in this paper. On the whole, we use the following scheme:
-
•
Since satisfies the Gevrey smoothness for , we keep solving the backward problem for by the projection constructed from (2.1).
-
•
Assume that . We find such that is an approximation of in .
The central point of this modification is that this time we use the Sobolev smoothness on in the neighborhood of to avoid the Gevrey smoothness on . This assumption is consistent with the fact that obtained in Theorem 2 and thus attainable by the inclusion . Note that the Sobolev smoothness imposed on both and in with is essential for the presence of the nonlinearity .
2.2.1. Case 1: independent of
Theorem 3.
Proof.
Here we provide proof of the solution smoothness (cf. Subsection 1.3) whenever for and . In this sense, we have
which implies that decays with the rate .
Concerning the degree of ill-posedness , we employ the equivalent formulation of the variational source condition (1.9):
Notice from (1.3) that the data measurement is not as smooth as the regularity assumption we imposed. Henceforward, for any given it follows from (2.1) that
(2.6) | ||||
where we have denoted by the corresponding final data of .
In (2.6), applying the globally Lipschitz continuity of and then multiplying the resulting estimate by the exponential weight we find that
With the aid of the Gronwall inequality, we get
yielding and that increases with the rate in .
Therefore, we conclude that the solution satisfies the variational source condition (1.9) with
(2.7) |
then these two terms in the infimum are equal for . With this, we take the logarithm on both sides and use the elementary inequality that for any to rule out the choice of . Thus, we can find some independent of such that
and plugging this into (2.7), we obtain the index function (2.4). On top of that, cf. [4] the error bound (2.5) itself holds for . ∎
As a byproduct of Theorem 3 and in accordance with the argument in [4], the minimizers of the Tikhonov functional (1.8) satisfy the convergence rate (2.5) if can be chosen such that , where denotes the subdifferential of . By this means, we compute that , indicating that as the measurement error tends to 0. In addition, we obtain the following conditional stability estimate.
Corollary 4.
Our modified scheme now brings into play its own feature: pointing out an approximation candidate of our solution . In fact, it is clear to see that (2.5) is not convergent when . Our scheme to approximate the initial density is very simple as we merely need to compute the “data” that have been solved through the standard spectral scheme . In the following, we not only show the existence of such , but also obtain a rigorous -dependent admissible set that contains it, directly proving the fact that as . Mathematically, one can establish an orthogonal projection and then mimic the way we gain Theorem 3 to deduce the rate of convergence. Since, again, this step is very trivial and somewhat self-contained by the help of the triangle inequality, our proof below follows the conventional way. Thus, the expression of the index function is clear through the derivation of the convergence rate.
Theorem 5.
Let . Suppose that for . Let for be the unique solution obtained from the projection in (2.2). Then there always exists a sufficiently small -dependent time such that
(2.8) |
Proof.
Using (2.5) and the triangle inequality, for any , we find the following estimate :
(2.9) | ||||
This upper bound can be done if we can find the infimum for some . This indicates that we need to solve the following algebraic problem:
expecting that is sufficiently small. Taking the logarithm on both sides of this equation and using the standard inequality for any , we have the following inequality:
Due to the fact that and , we deduce that
where we have denoted by . Notice that taking , the rationalizing technique gives the following limit:
and similarly,
Hence, it follows from (2.9) that the upper bound we gain would be of the form in (2.8). ∎
2.2.2. Case 2: dependent of
When depends on , our nonlinear spectral regularization may be no longer convergent as the boundedness of the regularized solution is not well-controlled; cf. (2.4). This means that the quantity now has to be dependent of , saying that , when getting involved in the scheme . This dependence impacts on the structure of the index function and further on the whole rate of convergence in Theorem 3.
From now on, for some constant and for we introduce the cut-off function of , denoted by , as follows:
(2.10) |
Following this way, we modify the regularization scheme (2.2) by
(2.11) |
and therefore, it enables us to derive the convergence rate under a suitable choice of . Note that our cut-off function (2.10) possesses the similar property in (1.6), i.e.
Theorem 6.
Proof.
Remark 7.
Based on the result obtained in Theorem 6, we remark the following:
-
•
As is well-known in continuous population models for single species, we suppose the nonlinearity in the form of
as a prominent example of the growth-and-predation rate for the spruce budworm which critically defoliated the balsam fir in Canada (cf. [14]). In this circumstance, it is easy to get and hence, we can choose that
working with the concrete assumption .
-
•
This result can be further extended to multiple-species cases. Indeed, we consider a time evolution of the concentration of chemical components or constituents (molecules, radicals, ions) in a reaction network (cf. e.g. [1]) which reads as
where and are the stoichiometric coefficients or molecularities. In a constructive manner, the mass action kinetic deterministic model of this reaction is governed by the following system of PDEs:
where is viewed as the concentration of the th component at time . In this regard, we obtain the vector-valued reaction-diffusion equation (1.1) in the form of by denoting the vector of concentrations and
with where and are the vectors of the stoichiometric coefficients. By this way Theorem 6 can be applied.
Theorem 8.
Proof.
In the same manner as in proof of Theorem 5, we prove the target estimate (2.15) by seeking the infimum . Solving the algebraic problem
we are led to the following inequality
Hereby, we find the admissible interval for , as follows:
where is recalled.
Therefore, it is evident to obtain the rate (2.15). We complete the proof of the theorem. ∎
3. Convergence of an iterative scheme
In this section, we reduce ourselves to the case that the nonlinearity does not degenerate, i.e. and there exist positive constants and such that
(3.1) |
Note that we now focus on solving the regularized solution in the open set since at we only need to compute the approximation at . Let and take . In this regard, we put
This setting allows us to seek a numerical solution for in the equivalent mesh-width in . The function is the semi-discrete solution of the nonlinear scheme (2.11) under scrutiny in the previous part. Starting from the projection with the cut-off function used in (2.11), the iterative scheme is designed by
(3.2) |
with the initial guesses and . In addition, we have denoted by for .
The presence of the so-called stabilization constant is to guarantee the convergence of the scheme, somehow hindered by the Lipschitz nonlinearity . In fact, we wish to designate an unconditional numerical scheme for the projection in the sense that the number of discretizations becomes free-to-choose by a suitable choice of . It is worth mentioning that the sequence is well-defined in the Sobolev space for each and thus the existence and uniqueness are self-contained by virtue of the linearity of the scheme. Note that the function is decreasing in the time argument because of for any , whilst it is transparently increasing in the argument .
Theorem 9.
Proof.
In view of the decomposition
we can find the upper bound in -norm of as follows:
where we have denoted by for .
At this stage, we remark that and therefore, it holds for a.e. . By the mean value theorem together with the fact that , we estimate that
By the choice of , we gain
Thus, we now enjoy the choice of in (3.3) to rule out that there exists independent of and such that
By induction, we obtain
(3.4) |
which enables us to state that the scheme (3.2) is bounded in for any and . Hence, we complete the proof of the theorem. ∎
Using the Banach-Alaoglu theorem, the uniform bound deduced in the proof of Theorem 9 indicates that we can extract a further subsequence (which we relabel with the same indexes if necessary) such that weakly in as . Furthermore, thanks to the Banach-Saks theorem we know that this subsequence also admits another subsequence such that the so-called Cesàro mean is strongly convergent to in . In this sense, we can write
(3.5) |
Define for . Our next step is to find the rate of convergence of the sequence acquired by (3.5). By this way, we not only prove that strongly in , but also show that is identically the semi-discrete solution of the nonlinear scheme (2.11).
Theorem 10.
Under the assumptions of Theorem 5, let for be the unique solution obtained from the projection in (2.11). Let be the solution of the iterative scheme (3.2) and let be the Cesàro mean of with respect to . Then for and there exists independent of and such that the following error bound holds
for sufficiently large. Moreover, for it holds
Proof.
Define . To gain the convergence rate, we compute the difference equation:
(3.6) | ||||
From now onward, we define . Following the same way we have done in the proof of Theorem 9, the function is expressed as
With the aid of the decomposition
the function can be bounded from above in the -norm by
where we have recalled that for .
Henceforward, we arrive at
by virtue of the fact already known that for a.e. under the choice of in (3.3). Hereby, choosing independent of and we can conclude that
(3.7) |
which, by mathematical induction, leads to
Eventually, by the back-substitution of the function this means that
(3.8) | ||||
which proves the fact that the sequence is Cauchy in . Consequently, there exists to which is strongly convergent as . In addition, it follows from (3.8) that when ,
(3.9) |
and thus, for sufficiently large we obtain the convergence of the source term, i.e. strongly in as , whenever is dependent of or not; see again the choice (2.12) to decide how big the iteration step needs to be.
Collectively, we have proved that is identically the semi-discrete solution of the nonlinear regularization (2.11) and further, it coincides the function derived from the weak convergence above. Now, it suffices to close the proof of the theorem by combining (3.6) and (3.7). Essentially, we have
Similar to (3.9), the Cesàro mean is strongly convergent to with the rate
Hence, we complete the proof of the theorem. ∎
Remark 12.
When is independent of , the assumption (3.1) can also be found in some examples, which also aids the applicability of the global Lipschitz case in Subsection 2.2. Observe what have been enlisted in Subsection 1.2. It is immediate to see that the Michaelis–Menten law ( in the de Pillis-Radunskaya law) with for gives
4. Discussions
We have studied a nonlinear spectral regularization to solve a semi-linear backward parabolic equation. The scheme significantly modifies the cut-off method developed in [15, 18, 8] so that it not only fits the nonlinear context under consideration, but also handles certain smoothness of the solution to the forward model in an appropriate manner. In this fashion, our proposed method is convergent in a Hölder-type rate for , decreasing backwards in time, and in a logarithmic-type rate for . It is worth mentioning that the strong convergence obtained in may allow us to gain the convergence of the regularized solution on the boundary with the same rates by the standard trace theorem.
We have also studied the convergence of an iterative method for this nonlinear scheme. To gain the strong convergence, this approximation works with the non-degeneracy of , which is a certainly stronger condition than those met in the analysis of the nonlinear scheme. Essentially, we see that the property of the nonlinearity plays a pretty much important role in deciding the convergence of the numerical scheme, as postulated in Theorems 9 and 10. This also points out the most difficult issue in solving inverse problems for nonlinear PDEs; compared to the linear cases investigated so far. One may think that the presence of Theorem 9 seems unnecessary (and so is the largeness of the stabilization constant taken in (3.3)) since it is clear that the strong convergence of the numerical scheme has already been obtained in Theorem 10. Nevertheless, it can be understood that we have depicted a general procedure to verify the convergence of numerical regularization schemes in the future topics. In fact, such boundedness (as the stability anlysis) obtained in Theorem 9 orientates towards the strong convergence of the Cesàro mean. In some sense, this unravels the possibility that the strong convergence of the numerical sequence is not obtainable, generally hindered by the property of . The choice of can also be very helpful because the discretization as well as the number of iterations become more effectively economical. In the near future, we wish to understand deeper numerical issues caught in particularly complex networks as presented in Remark 7.
The results of this paper can initiate the convergence analysis of the other classes of nonlinear backward PDEs using the strategy of verifying variational source conditions. One can also attempt to achieve the strong convergence result in the Besov spaces for regularization of the present backward model in the unbounded domain as it is in agreement with the well-posedness of the forward problem (see e.g. [13]). Observe that although the variational source condition theory does not require the fact that the ill-posed operator admits the Fréchet derivative, it is self-contained in this framework. Thus, this time we are allowed to not only derive the variational source condition from the spectral source condition, but also apply the iteration-based regularized Gauß-Newton method. The convergence analysis of this method for the nonlinear backward PDEs should also be considered in the forthcoming works.
Acknowledgments
The author thanks Prof. Dr. Mohammad Kazemi (Charlotte, USA) for his support of the author’s research career.
References
- [1] P. Érdi and J. Tóth. Mathematical Models of Chemical Reactions: Theory and Applications of Deterministic and Stochastic Models. Nonlinear Science. Princeton University Press, 1989.
- [2] A. B. Ferrari and E. S. Titi. Gevrey regularity for nonlinear analytic parabolic equations. Communications in Partial Differential Equations, 23(1–2):1–16, 1998.
- [3] J. Flemming, B. Hofmann, and P. Mathé. Sharp converse results for the regularization error using distance functions. Inverse Problems, 27(2):025006, 2011.
- [4] M. Grasmair. Generalized Bregman distances and convergence rates for non-convex regularization methods. Inverse Problems, 26(11):115014, 2010.
- [5] D. N. Hào, N. V. Duc, and N. V. Thang. Backward semi-linear parabolic equations with time-dependent coefficients and local Lipschitz source. Inverse Problems, 34(5):055010, 2018.
- [6] B. Hofmann, B. Kaltenbacher, C. Pöschl, and O. Scherzer. A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators. Inverse Problems, 23(3):987–1010, 2007.
- [7] T. Hohage and F. Weidling. Verification of a variational source condition for acoustic inverse medium scattering problems. Inverse Problems, 31(7):075006, 2015.
- [8] T. Hohage and F. Weidling. Characterizations of variational source conditions, converse results, and maxisets of spectral regularization methods. SIAM Journal on Numerical Analysis, 55(2):598–620, 2017.
- [9] T. Hohage and F. Werner. Convergence rates for inverse problems with impulsive noise. SIAM Journal on Numerical Analysis, 52(3):1203–1221, 2014.
- [10] R. Jaroudi, G. Baravdish, B. T. Johansson, and F. Åström. Numerical reconstruction of brain tumours. Inverse Problems in Science and Engineering, pages 1–21, 2018.
- [11] B. Kaltenbacher, A. Neubauer, and O. Scherzer. Iterative Regularization Methods for Nonlinear Ill-Posed Problems. Radon Series on Computational and Applied Mathematics. Berlin, Boston: De Gruyter, 2008.
- [12] C. König, F. Werner, and T. Hohage. Convergence rates for exponentially ill-posed inverse problems with impulsive noise. SIAM Journal on Numerical Analysis, 54(1):341–360, 2016.
- [13] C. Miao and B. Zhang. The Cauchy problem for semilinear parabolic equations in Besov spaces. Houston Journal of Mathematics, 30(3):829–878, 2004.
- [14] J. D. Murray. Continuous Population Models for Single Species. In Interdisciplinary Applied Mathematics, volume 17, pages 1–43. Springer, New York, 1993.
- [15] P. T. Nam. An approximate solution for nonlinear backward parabolic equations. Journal of Mathematical Analysis and Applications, 367(2):337–349, 2010.
- [16] O. Scherzer, M. Grasmair, H. Grossauer, M. Haltmeier, and F. Lenzen. Variational Methods in Imaging. Applied Mathematical Sciences. Springer, New York, 2008.
- [17] N. H. Tuan, V. V. Au, V. A. Khoa, and D. Lesnic. Identification of the population density of a species model with nonlocal diffusion and nonlinear reaction. Inverse Problems, 33(5):055019, 2017.
- [18] N. H. Tuan, L. D. Thang, V. A. Khoa, and T. Tran. On an inverse boundary value problem of a nonlinear elliptic equation in three dimensions. Journal of Mathematical Analysis and Applications, 426(2):1232–1261, 2015.