
Citation: Frédérique Clément, Béatrice Laroche, Frédérique Robin. Analysis and numerical simulation of an inverse problem for a structured cell population dynamics model[J]. Mathematical Biosciences and Engineering, 2019, 16(4): 3018-3046. doi: 10.3934/mbe.2019150
[1] | Maher Alwuthaynani, Raluca Eftimie, Dumitru Trucu . Inverse problem approaches for mutation laws in heterogeneous tumours with local and nonlocal dynamics. Mathematical Biosciences and Engineering, 2022, 19(4): 3720-3747. doi: 10.3934/mbe.2022171 |
[2] | Asma Alshehri, John Ford, Rachel Leander . The impact of maturation time distributions on the structure and growth of cellular populations. Mathematical Biosciences and Engineering, 2020, 17(2): 1855-1888. doi: 10.3934/mbe.2020098 |
[3] | Eminugroho Ratna Sari, Fajar Adi-Kusumo, Lina Aryati . Mathematical analysis of a SIPC age-structured model of cervical cancer. Mathematical Biosciences and Engineering, 2022, 19(6): 6013-6039. doi: 10.3934/mbe.2022281 |
[4] | Sunwoo Hwang, Seongwon Lee, Hyung Ju Hwang . Neural network approach to data-driven estimation of chemotactic sensitivity in the Keller-Segel model. Mathematical Biosciences and Engineering, 2021, 18(6): 8524-8534. doi: 10.3934/mbe.2021421 |
[5] | Jacek Banasiak, Aleksandra Falkiewicz . A singular limit for an age structured mutation problem. Mathematical Biosciences and Engineering, 2017, 14(1): 17-30. doi: 10.3934/mbe.2017002 |
[6] | Blaise Faugeras, Olivier Maury . An advection-diffusion-reaction size-structured fish population dynamics model combined with a statistical parameter estimation procedure: Application to the Indian Ocean skipjack tuna fishery. Mathematical Biosciences and Engineering, 2005, 2(4): 719-741. doi: 10.3934/mbe.2005.2.719 |
[7] | Francisco Julian Ariza-Hernandez, Juan Carlos Najera-Tinoco, Martin Patricio Arciga-Alejandre, Eduardo Castañeda-Saucedo, Jorge Sanchez-Ortiz . Bayesian inverse problem for a fractional diffusion model of cell migration. Mathematical Biosciences and Engineering, 2024, 21(4): 5826-5837. doi: 10.3934/mbe.2024257 |
[8] | H.Thomas Banks, Shuhua Hu . Nonlinear stochastic Markov processes and modeling uncertainty in populations. Mathematical Biosciences and Engineering, 2012, 9(1): 1-25. doi: 10.3934/mbe.2012.9.1 |
[9] | H. Thomas Banks, W. Clayton Thompson, Cristina Peligero, Sandra Giest, Jordi Argilaguet, Andreas Meyerhans . A division-dependent compartmental model for computing cell numbers in CFSE-based lymphocyte proliferation assays. Mathematical Biosciences and Engineering, 2012, 9(4): 699-736. doi: 10.3934/mbe.2012.9.699 |
[10] | Karl Peter Hadeler . Structured populations with diffusion in state space. Mathematical Biosciences and Engineering, 2010, 7(1): 37-49. doi: 10.3934/mbe.2010.7.37 |
Cell dynamics are classically investigated in the framework of structured populations, and especially of the McKendrick–VonFoerster model. The direct problem associated with the initial and extended formulations of this model has caught most of the attention, both on the theoretical ground (well-posedness, e.g. [1,2]) and numerical ground (numerical approximation of the solutions, e.g. [3,4,5]). The inverse problems, intending to recover model functions, such as the death or division rate, from observable model outputs, have been much less studied [6,7,8,9,10], although they have a particular interest in a cell dynamics context, where a priori information on these rates are often quite poor.
In this work, we study and illustrate the well-posedness of a multiscale inverse problem (IP), defined from a multi-type version of the linear, age-structured formulation of the McKendrick–VonFoerster model, in the specific situation where cell death can only occur at the time of mitosis.
This problem has been initially motivated by a developmental biology issue, namely folliculogenesis, the process of growth and maturation of ovarian follicles. During the first development stages, the growth of ovarian follicles is mainly driven by the proliferation of the somatic cells surrounding the oocyte (egg cell), which progressively builds up several concentric cell layers. In this specific application [11], the cell type corresponds to the layer index, and the cell division rate is type-dependent. At the time of mitosis, cells are likely to move to the next layer (unidirectional motion), and the (layer-dependent) migration rate can be seen as the equivalent of a mitosis-induced death rate in the lower layer. As a consequence, the birth rate (boundary condition at birth with age a=0) combines an intrinsic contribution from division and an extrinsic contribution from migration.
Beyond folliculogenesis, such a multi-type formulation can be applied to other cell processes with either spatially oriented development (e.g. cortical neurogenesis) or commitment to a cell lineage or fate (e.g., hematopoiesis).
The multiscale character of the IP ensues from the fact that the observable data (total cell number on each layer) are available on the macroscopic scale and used to recover the microscopic functions entering the system of interconnected McKendrick–VonFoerster PDEs. More specifically, we consider here the problem of recovering the age-dependent division rates, and constant migration rates ruling the cell density in age on each layer, from the knowledge of the total cell number (zero-order moment of the density) on every layers.
In [11], we have tackled the simplified case of constant (yet layer-dependent) division rates. In this work, we extend the study to the case of compactly supported (lattice) division rates, in order to stick to a realistic interpretation of the division rate as a distribution of intermitotic times; age is reset to zero at birth, there can be a minimal age compatible with division, and cells can become quiescent beyond a maximal age. We consider initial conditions corresponding either to a synchronized (Dirac mass) or non-synchronized cell population (Dirac comb or continuous function) on the first layer (all other layers are empty). If the well-posedness of the PDEs (1.1) for a L1 initial condition has been widely studied in the last decades (see for instance, [1,2]), the case of Dirac measure initial conditions has been investigated only recently. For instance, in [12,13], the authors have introduced the notion of measure solutions for the conservative renewal equation.
In the single layer (not multi-type) case, similar multiscale IP problems, dealing with an age-dependent reproduction rate have been studied [6,8]. In [6], in the case of a strictly positive, reproduction-independent death rate resulting in an almost sure death before a maximal age L, the authors have shown, from the characteristic curves, that the birth rate (boundary condition) verifies a Volterra integral equation of the second kind, and then used the Fredholm alternative to further recover the reproduction rate.In [8], starting from the cumulative formulation (renewal equation), and assuming a non-lattice reproduction rate, the authors have studied both the case of reproduction-dependent and reproduction-independent death rate to recover the reproduction and death rates. In the reproduction-dependent (mitosis-dependent) case (see Theorem 4.3), using the Laplace transform, the authors have shown the IP well-posedness for an initial population synchronized at age 0 (Dirac mass). If, in addition, the total cell number can be expressed as a series of exponential functions, the IP well-posedness is also obtained for a non-synchronized initial population represented by a measure with support on [0,1] and no atom at 1.
Also, single-scale IP problems, where observation are available at the microscopic level, have been investigated in a similar age-structured framework [7,14,15] or in the size-structured framework [16,17,18]. In the semigroup framework, the problem of recovering the death rate from the knowledge of both the age distribution at two different time points and the reproduction rate is studied in [7]. A similar problem is considered in [15] from the observation of a truncated age distribution at any time. Finally, in a steady state configuration, given a rather mesoscopic observation, the distribution of intermitotic times, one can recover the mitosis-dependent death rate [14] from the eigenvalue problem, following the methodological principle introduced in [16,17,18].
This paper is organized as follows. In section 1, we present the direct problem (multi-type McKendrick–VonFoerster). Inspired from the single layer case [2], we propose a formal solution based on the characteristic curves, and use them to design a numerical scheme, as performed in [4]. We check our numerical scheme using the mass conservation property. In Section 2, using a Fredholm integral equation, we show the well-posedness of the IP in the single layer case, when considering a continuous non-synchronized initial condition. Because of the mitosis-dependent death rate, the Fredholm alternative cannot be applied, and we use a constructive approach to obtain the lattice division rate from the knowledge of both the total cell number and a continuous (non-synchronized) initial condition. Then, we take advantage of the unidirectional motion and decompose the Jth layer model into J submodels, each corresponding to the single layer model with an additional extrinsic term in the boundary condition. We again derive a Fredholm integral equation for each submodel and deduce the well-posedness of the multi-type inverse problem. In section 3, we show the well-posedness of the IP in the single layer case, when considering Dirac masses as initial conditions. After constructing a solution from the characteristic lines, we still obtain a Fredholm integral equation. In each situation, we illustrate numerically our theoretical results. We conclude the paper by a Conclusion/Discussion section. Complements on the numerical scheme construction and the proofs can be found in the Appendix.
We recall the age and layer structured cell population model considered in [11]. Let J∈N∗. The cell population is represented by a population density function ρ:=(ρ(j)(t,a))j∈[[1,J]]∈L1(R+)J, where ρ(j) is the cell age density in layer j at time t such that ρ verifies, for all j∈[[1,J]], for all t∈(0,+∞),
{∂tρ(j)(t,a)+∂aρ(j)(t,a)=−bj(a)ρ(j)(t,a),a∈(0,∞),ρ(j)(t,a=0)=2(1−p(j−1)S)∫+∞0bj−1(a)ρ(j−1)(t,a)(t,a)da+2p(j)S∫+∞0bj(a)ρ(j)(t,a)da,ρ(j)(0,a)=ψj(a),a∈(0,+∞), | (1.1) |
where bj are the division rate functions, and ψ=(ψj)j∈[[1,J]] is the initial density such that for all j∈[[1,J]], ψj∈Cc(R+). For all j∈[[1,J]], the parameter p(j)S is the probability that a cell taken randomly among both daughter cells, remains on its mother layer j. For all j∈[[1,J−1]], we take p(j)S∈(0,1). On the last layer, p(J)S∈(0,1]. A natural choice in the multi-layer case is to consider p(J)S=1 as in [11]. The division rate on each layer has a classical probabilistic interpretation [1,6,8,14]: the probability that a cell born on the j-th layer has not yet divided at age α is
exp(−∫α0bj(s)ds). |
It follows that if ∫+∞0bj(s)ds=+∞, the cell divides almost surely, and conversely, if ∫+∞0bj(s)ds<+∞, a cell may never divide and become quiescent. This will happen in particular if bj is a bounded, compactly supported function. We investigate the inverse problem associated with the model (1.1):
Definition 1.1.
(IP) Given the initial condition ψ, the probability p(J)S and the functions
m(t):=(mj(t))j∈[[1,J]] with mj(t):=∫+∞0ρ(j)(t,a)da, | (1.2) |
defined for all t∈[0,T), with T>0, determine the functions bj and the probabilities p(j)S, for all j∈[[1,J−1]], such that the direct problem (1.1) is satisfied on [0,T).
The model is completed with a set of hypotheses on the division rate and initial conditions, formulated below.
Hypothesis 1.1. For all j∈[[1,J]], the division rates bj are non-negative compactly supported functions: bj∈Cc((Aminj,Amaxj)), where Aminj,Amaxj∈R+∪{0}∪{+∞}, such that Aminj<Amaxj.
For the single layer case, note that this hypothesis is more general than the one used either in [8] where the division rate function is supposed to be non-lattice or, in the steady state approach [14] where Amax1=+∞.
Motivated by the biological process studied in [11], we consider that the system starts with all the layers empty, except the first one. We consider different types of initial conditions: either Dirac measures corresponding to a fully or partially synchronized population, or a continuous function corresponding to a non-synchronized population. In case of a continuous initial condition, we assume that the following hypotheses are verified.
Hypothesis 1.2. For all j∈[[2,J]] and for all a∈(0,+∞), we have ψj(a)=0 and ψ1∈Cc((aψmin,aψmax)), with aψmin,aψmax∈R+ such that aψmin<aψmax.
If the initial condition is a Dirac measure or Dirac Comb, we assume that:
Hypothesis 1.3. For all j∈[[2,J]] and for all a∈(0,+∞), we have ψj(a)=0. In addition, we suppose that there exist two sequences of N+1 positive numbers, with N∈N, a=(ai)i∈[[0,N]]∈RN+∪{0} and Ψ=(Ψi)i∈[[0,N]]∈RN+ such that
aψmax:=a0>a1>...>aN=:aψmin. | (1.3) |
Then, we define the initial condition on the first layer, for all a≥0, by
ψ1(a):=N∑i=0Ψiδai(a). | (1.4) |
Finally, to show the well-posedness of the inverse problem (IP), we will need two additional hypotheses on the bj functions.
Hypothesis 1.4. For all j∈[[1,J]], the division rates bj are analytic on their support sets.
Hypothesis 1.5. The first division time on Layer 1 is larger than the age of the eldest cells at initial time: Amin1≥aψmax
Hypothesis 1.1 is quite natural from the biological viewpoint, whereas Hypotheses 4 and 5 are purely technical, yet easily fulfilled.
We follow the same approach as in [6,7] and first solve the direct problem (1.1).
Even if an explicit solution of the PDEs (1.1) cannot be obtained, one classical way to solve the direct problem when dealing with continuous initial conditions, is to use the method of characteristics [2,1]. We integrate the PDEs (1.1) along the characteristics lines a=a0+t and t=t0+t, where a0 and t0 are nonnegative constants. We get for all j∈[[1,J]] and for all a∈(0,+∞),
ρ(j)(t,a)={ψj(a−t)e−∫aa−tbj(s)ds,a≥tρ(j)(t−a,0)e−∫a0bj(s)ds,a≤t. | (1.5) |
Hence, we obtain an expression for each ρ(j), for j∈[[1,J]], that depends on the initial density ψj, the division rate bj, and the boundary condition ρ(j).
To close system (1.5), we need to get an explicit expression for the boundary condition. When J=1, the boundary condition, classically called the birth rate, is solution of a renewal equation [8]. In our context, we can retrieve a similar renewal equation verified by the boundary condition:
ρ(j)(t,0)=hj(t)+2p(j)S(∫t0ρ(j)(t−a,0)bj(a)e−∫a0bj(s)dsda+∫+∞tψj(a−t,0)bj(a)e−∫aa−tbj(s)dsda), |
with hj(t):=2(1−p(j−1)S)∫+∞0bj−1(a)ρ(j−1)(t,a)da.
This equation is the deterministic counterpart of the renewal equation obtained from a stochastic equivalent model introduced in [11].
Figure 1 illustrates the characteristic lines obtained from expression (1.5) with J=3. Note that since all layers except the first are empty at initial time, a delay is needed for cells to enter the second and third layers.
In this subsection, we propose a numerical scheme for the direct problem (1.1). The main numerical difficulty associated with the hyperbolic PDEs (1.1) is the assessment of the boundary condition, which has been dealt with by several numerical methods, based either on the method of characteristics [3,19,4], escalator boxcar train [5] or finite volume method [11]. Given that our problem possibly involves a non-continuous initial condition (ψ1), and lattice division rates, the method of characteristics is the most suitable one. In particular, the characteristics-based scheme ensures mass conservation during the transport phase by preventing numerical diffusion when a<Ajmin. In addition, we will see later that this approach helps designing a numerical scheme for solving the inverse problem (IP).
To obtain a discretized solution of the PDEs (1.1), we write the conservative law for a vector function ˜ρ=(˜ρ(j))j∈[[1,J]], defined as: for all j∈[[1,J]], t∈(0,+∞) and a∈(0,+∞),
˜ρ(j)(t,a):=ρ(j)(t,a)exp(−∫a0bj(s)ds). | (1.6) |
From the PDEs (1.1), we obtain directly that, for all t∈(0,+∞) and a∈(0,+∞),
∂t˜ρ(j)(t,a)+∂a˜ρ(j)(t,a)=0. | (1.7) |
We now have all the elements to design a numerical scheme.
First, we introduce the notations for the discretized solutions associated with the PDEs (1.1) over the time interval [0,T]. We discretize both the age and time intervals with the same size step: Δ=Δt=Δa, in order to be able to follow the characteristics. Let M be an integer such that M≥⌊aψmax+TΔ⌋. We introduce the age grid points an=nΔ, n=0,...,M and the time grid points tk=kΔ, k=0,...,⌊TΔ⌋. We refer to the grid point an by the subscript n and to the time grid point tk by the subscript k. Let Ujk,n be a numerical approximation to ρ(j)(tk,an). We have the following numerical algorithm whose local truncation error is O(Δ), (see details in the Appendix):
Ujk+1,n=Ujk,n−1exp(−∫anan−1bj(s)ds), | (1.8) |
Ujk+1,0=2(1−p(j−1)S)⌊Aj−1maxΔ⌋−1∑n=⌊Aj−1minΔ⌋(1−e−∫nΔ(n−1)Δbj−1(s)ds)Uj−1k,n+2p(j)S⌊AjmaxΔ⌋−1∑n=⌊AjminΔ⌋(1−e−∫nΔ(n−1)Δbj(s)ds)Ujk,n. | (1.9) |
The reader can refer to [4] for a detailed proof of convergence in the single layer case. In the several layer case, the term corresponding to the intrinsic contribution could be dealt with in a similar way as in the single layer case, yet one should also control the order of the extrinsic term, which is beyond of the scope of this paper.
Remark 1.1 (Mass conservation property). When J=1 and p(1)S=12, we can observe that the mass conservation property is verified in the sense that
M∑n=0U1k+1,n=M∑n=0U1k,n. |
In this section, we analyse the inverse problem (IP) enunciated in Definition 1.1 starting with the simplest case of a single layer and considering a compactly supported function as initial condition. We then extend our results to the general case of several layers.
In all this subsection, we fix J=1 and consequently, to simplify notations, we drop the index layer so that for instance ρ(1) becomes ρ. We thus consider the following PDE, identical to the PDEs (1.1) with J=1:
{∂tρ(t,a)+∂aρ(t,a)=−b(a)ρ(t,a),a∈(0,∞),ρ(t,a=0)=2pS∫+∞0b(a)ρ(t,a)da,ρ(0,a)=ψ(a),a∈(0,+∞), | (2.1) |
Note that when pS=1, PDE (2.1) is the renewal equation. When pS<1, PDE (2.1) is similar to a McKendrick–VonFoerster equation in which the birth rate would be 2ps times the death rate. We recall that according to the definition of (IP), pS=p(1)S(=p(J)S) is assumed to be known while the division rate b is unknown.
We first show that the identification problem (IP) is equivalent to an inhomogeneous Fredholm integral equation.
Theorem 2.1. Under Hypotheses 1.1 and 1.2, and supposing that pS≠12, we define f(t):=−12pS−1m1(t)+2pS2pS−1m1(0). Then, we have for all t∈[0,Amin]
f(t)=∫aψmaxaψminψ(a)e−∫a+tab(s)dsda. | (2.2) |
Before starting the proof of Theorem 2.1, we will need the following lemma:
Lemma 2.1. Under the same hypotheses as Theorem 2.1, we have for all t∈[0,Amin],
m′1(t)=2pS−12pSρ(t,0) | (2.3) |
Proof. Since both ψ and b are compactly supported, the total number of cells m1(t)=∫+∞0ρ(t,a)da can be decomposed as the sum of the initial cells that have not yet divided and the cells born since time t=Amin−aψmax:
m1(t)=∫aψmax+taψmin+tρ(t,a)da⏟initial cells+∫min(Amin−aψmin+t,0)0ρ(t,a)da⏟cells born since time t=Amin−aψmax. | (2.4) |
Using two changes of variables, the translation s=a−aψmin−t and the homothetic transformation s=aAmin−aψmin+t, we can prove formula (2.3). Note that in the general case, corresponding here to Amin=aψmin=0 and Amax=aψmax=+∞, such changes of variables are not needed to obtain formula (2.3). The detailed proof is exposed in the Appendix.
We can now proceed to the proof of Theorem 2.1.
Proof of Theorem 2.1. To simplify the proof, we do not use expression (2.4) and instead, we write the total number of cells m1 (eq. (1.2)) as the sum of the number of the remaining cells that have not divided yet and the cells born since time t>0, according to the formal solution of ρ (1.5):
m1(t)=∫t0ρ(t−a,0)e−∫a0b(s)dsda⏟new born cells+∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda⏟remaining mother cells. |
We apply Lemma 2.1, for all t≥0 and we obtain
m1(t)=2pS2pS−1∫t0m′1(t−a)e−∫a0b(s)dsda+∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda. |
We suppose that t≤Amin. Hence, the only cells that can divide are the cells present at initial time (mother cells). The newborn daughter cells have not yet had the time to divide (there are no grand-daughter cells). For all t∈[0,Amin],
m1(t)=2pS2pS−1∫t0m′1(t−a)da+∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda=2pS2pS−1(m1(t)−m1(0))+∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda. |
Since
∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda=∫aψmax0ψ(a)e−∫a+tab(s)dsda=∫aψmaxaψminψ(a)e−∫a+tab(s)dsda, |
the definition of f leads to the inhomogeneous Freholm integral equation (2.2).
Remark 2.1. Note that Theorem 2.1 is defined on the time interval [0,Amin]. During this interval, only the mother cells coming from the initial condition are dividing. Hence, we can extend this result to the time interval [0,2Amin−aψmax] if Amin≥aψmax.
Remark 2.2 (Self-renewal case). Note that, if pS=12, the identification problem is not well-posed so that alternative observation data should be used. Indeed, the total number of cells is constant along time whereas the solution of the inverse problem is based on changes in this number.
Usually, the inhomogeneous Fredholm integral equation, which is a particular case of the Volterra integral equation, is studied in the case where the kernel is known. Here, we rather consider the inverse problem of reconstructing the kernel from function f and initial condition ψ.
Theorem 2.2. Under Hypotheses 1, 2, 4 and 5, the problem (IP) is well-posed.
Proof. Applying Hypothesis 1.5 to the Fredholm integral equation (2.2), we first deduce that, for all t∈[0,Amin],
f(t)=∫Rψ(a)exp(−∫a+tAminb(s)ds)da. |
Then, using the change of variables u=a+t, we obtain that
f(t)=∫Rψ(a−t)exp(−∫aAminb(s)ds)da. | (2.5) |
We can recognize a convolution product. However, since relation (2.5) is verified only for t∈[0,Amin], we cannot use the Laplace transform directly to separate function ψ from the age-dependent function a→exp(−∫aAminb(s)ds). We rather introduce the truncated functions ˜f and ˜b such that:
˜f(t)=f(t)1[0,Amin)(t)+f(Amin)1[Amin,+∞)(t) and ˜b(a)=b(a)1[0,Amin+aψmax](a). | (2.6) |
In other words, function ˜f coincides with function f on the interval [0,Amin], and function ˜b coincides with function b on the interval [0,Amin+aψmax]. Hence, we deduce from relations (2.5) and (2.6) that for all t≥0,
˜f(t)=∫Rψ(a−t)exp(−∫aAmin˜b(s)ds)da. | (2.7) |
Since f, ψ and g(a):=exp(−∫aAmin˜b(s)ds) are constant beyond a given time/age, their associated Laplace transforms exist for all p>0, so that we can apply a Laplace transform to relation (2.7), and deduce that, for all p>0,
F[˜f](p)=F[˜ψ](p)F[g](p), | (2.8) |
where F[˜f] is the Laplace transform associated with function f. From relation (2.8), we deduce the uniqueness of the Laplace transform of function g. From the injectivity property of the Laplace transform, we deduce the uniqueness of function g. From the bijectivity property of function g, we then deduce the uniqueness of function ˜b. Finally, from the uniqueness of function b on the interval [0,Amin+aψmax], we deduce from Hypothesis 1.4 the uniqueness of function b on the whole interval R+.
Remark 2.3. The results of Theorem 2.2 can be extended to non-analytic b functions by piecewise reconstruction of b on its whole support (Amin,Amax). From the proof of Theorem 2.2, we have the uniqueness of b on the interval [0,Amin+aψmax]. Then, from the knowledge of b on the interval [0,Amin+aψmax] and remembering that the first newborn cells, born at time 2Amin−aψmax (see Remark 2.1) start to divide at time t=3Amin−aψmax, one can derive a Fredholm integral equation for t∈[0,3Amin−aψmax], following the proof of Theorem 2.1, hence deduce the uniqueness of b on the interval [0,2Amin+aψmax]. Repeating this operation as many times as needed, we finally obtain the uniqueness of function b on its whole support.
While Theorem 2.2 ensures the uniqueness of function b, it does not provide us with a tractable analytic formula to reconstruct it. This issue is addressed in the next paragraph.
We finish the study of the inverse problem (IP) for the single layer case by proposing a numerical procedure to retrieve the division rate b from the total number of cells.
We assume that the initial condition ψ can be discretized using a time sequence tk=kΔ and we aim to compute the b(kΔ) values.
The procedure is based on the fact that we use the same size step Δ for both the age and time grids. Let the initial sequence Ψ=(Ψi)i∈[[imin,imax]] where imin=⌊aψminΔ⌋ and imax=⌊aψmaxΔ⌋.
Between t=0 and t=Amin−aψmax, cells are aging, hence PDE (2.1) is a pure transport equation. Then, at time t=Amin−aψmax, the first division happens for cells that have reached age Amin.
We fix the initial values of vector b:=(bk)k∈[[0,N]] to zero. Each observation of the total number of cells at time tk will be used to refresh one by one the value of vector b from left to right.
Using the numerical scheme (expressions (1.8) and (1.9)), we define the mass difference at time tk by:
μk:=m(tk)−Δimax+k∑n=0Uk,n. | (2.9) |
At time tk, all the bn for n∈[[0,imax+k−1]] have been refreshed at time tk−1, while the remaining values for indexes n∈[[imax+k,N]] are still zero. At this time tk, the change in the mass difference can only come from the eldest cells indexed by imax+k. Hence, if μk=0, the eldest cells have not divided yet between tk−1 and tk. Otherwise, if μk≠0, a division has occurred. We recall the reader that pS is the probability that at least one daughter cell remains on Layer 1. If pS<12, this division results in a negative mass difference, otherwise, if pS>12, it results in a positive mass difference.
To compute the bimax+k, we use the mass difference definition (2.9) and the numerical scheme to write the mass balance conservation law:
m(tk)=Δimax+k−1∑n=0Uk,n⏟ remaining cells+ΔUk−1,imax+k−1e−Δbimax+k+2pSΔ(1−e−Δbimax+k)Uk−1,imax+k−1⏟dividing eldest cells. | (2.10) |
Since at time tk, bimax+k is zero before refreshing, we have from the numerical scheme (1.8) that Uk−1,imax+k−1=Uk,imax+k. Let ˜u:=Uk−1,imax+k−1. From the conservation law (2.10) and the μk definition (2.9), we deduce
μk=−ΔUk,imax+k+Δ(2pS−1)(1−e−Δbimax+k)˜u⇒bimax+k=−log(1−xk)Δ, | (2.11) |
with
xk:=μkΔ(2pS−1)˜u. |
These steps can be summarized by the following pseudo-code:
![]() |
We illustrate this method in Figure 3 and in additional figures in the Appendix. Note that some instabilities appear in the case of the piecewise constant function (orange line) which may be due to its non-smooth character. We also performed a study on the sampling rate Δ (which appears to be in our case also the age size step) to get practical insight into the numerical convergence (stability) of the reconstruction of the estimated function with respect to Δ (see Figure 7b in the Appendix).
We now consider the inverse problem (IP) with two layers (J = 2). We recall the reader that, in this case, we aim to determine all the division rates bj, j∈[[1,J]] and the probability p(j)S, j∈[[1,J−1]] knowing the probability p(J)S on Layer J, the initial condition ψ and the mean cell number of each layer mj, j∈[[1,J]].
Theorem 2.3. Under the same hypotheses as Theorem 2.2, the inverse problem (IP) is well-posed for J=2.
To prove Theorem 2.3, we take advantages of the unidirectional motion of the model (1.1) and split the proof in two parts: the uniqueness of parameter p(1)S and function b1 (contribution of Layer 1), and the uniqueness of function b2 (contribution of Layer 2).
We start by the analysis of the first layer and get the following lemma:
Lemma 2.2 Under the same hypotheses as Theorem 2.3, function b1 and parameter p(1)S verifying the inverse problem (IP) depend only on the total number of cells on Layer 1, m1, and Layer 2, m2, where m1 and m2 are defined by equation (1.2).
Proof. The first cells coming from the initial condition ψ1 enter Layer 2 at time S1:=Amin1−aψmax and start to divide at time S2:=Amin2+S1. Layer 2 is empty between t=0 and t=S1. From t=S1 to t=S2, the cells start to enter Layer 2 and are only aging. Hence, the cell density function on Layer 2, ρ(2), solution of the PDEs (1.1), verifies a transport equation with a source term at the boundary condition: for all t∈[0,S2],
{∂tρ(2)(t,a)+∂aρ(2)(t,a)=0,a∈(0,∞),ρ(2)(t,0)=2p(1)S∫+∞0b1(a)ρ(1)(t,a)da. |
We first show that b1 depends only on m1 and m2. We consider the sum of the cells on the two layers: ρ=ρ(1)+ρ(2) and deduce from the PDEs (1.1) that
∂tρ(t,a)+∂aρ(t,a)=−b1ρ(1)(t,a). | (2.12) |
Since the b1 function is non-zero on the interval (Amin1,Amax1), and the density function ρ(2)(t,⋅) is non-zero on the interval [0,t−S1] for all t∈(S1,S2), we deduce that (Amin1,Amax2)∩[0,t−S1]=∅ when t<S1+Amin1. Hence, we can write using expression (2.12) that, for all t∈(S1,min(S1+Amin1,S2)), ∂tρ(t,a)+∂aρ(t,a)=−b1ρ(t,a) and deduce that ρ is solution of the PDE:
{∂tρ(t,a)+∂aρ(t,a)=−b1(a)ρ(t,a),t∈(0,min(S1+Amin1,S2)),a∈(0,∞),ρ(t,0)=2∫+∞0b1(a)ρ(t,a)da,ρ(0,a)=ψ(a),a∈(0,+∞), |
Since this PDE is the same as PDE (2.1), we apply Theorem 2.2 and deduce the uniqueness of b1.
We turn now to the uniqueness of parameter p(1)S. Taking the derivative of both m1 and m2, for all t∈[0,S2], we obtain that:
m′1(t)=(2p(1)S−1)∫+∞0b1(a)ρ1(t,a)da,m′2(t)=2(1−p(1)S)∫+∞0b1(a)ρ1(t,a)da |
As there exists at least one t∈[0,S2] such that ∫+∞0b1(a)ρ(1)(t,a)da≠0, we deduce, first,
m′1(t)2(1−p(1)S)=m′2(t)(2p(1)S−1), |
and then the uniqueness of p(1)S. This ends the proof.
Inverse problem of an age structured population system with source term in the boundary condition To show the uniqueness of function b2, we first study the following inverse problem.
Let η∈L1(R+), solution of the PDE
{∂tη(t,a)+∂aη(t,a)=−b(a)η(t,a),t∈(0,∞),a∈(0,∞),η(t,0)=g(t)+2∫+∞0b(a)η(t,a)da,η(0,a)=ψ(a), | (2.13) |
with g a differentiable function on R+ supposed to be known and ψ∈Cc((aψmin,aψmax)). We also suppose that b∈Cc((Amin,Amax)) (Hypothesis 1.1).
We investigate the inverse problem associated with the model (2.13):
~IP Given the initial condition ψ, the function ˜m(t):=∫+∞0η(t,a)da and the function g, both defined for all t∈[0,T), with T>0, determine function b such that the direct problem (2.13) is satisfied on [0,T).
In the same way as in sub-section 2.1, we can show that the inverse problem ~IP can be reformulated as a Fredholm integral equation
Lemma 2.3. Under Hypothesis 1.1 and supposing that ψ∈Cc((aψmin,aψmax)), we define f2(t):=−˜m(t)+2˜m(0)+∫t0g(a)da. Then, we have for all t∈[0,Amin]
f2(t)=∫aψmaxaψminψ(a)e−∫a+tab(s)dsda. | (2.14) |
Proof. In the same way as for the proof of Theorem 2.3, we can write that
˜m(t)=∫t0η(t−a,0)e−∫a0b(s)dsda⏟new born cells+∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda⏟remaining mother cells. | (2.15) |
To obtain a relation between the boundary condition η(t,0) on the one hand and, ˜m(t) and g(t) on the other hand, for all t≥0, we follow the same approach as in Lemma 2.3 and get
˜m(t)=∫aψmax+taψmin+tρ(t,a)da⏟initial cells+∫t0ρ(t,a)da⏟cells born . | (2.16) |
Note that here the cells born are both coming from the source term g and the division rate b. Using the changes of variables s=a−aψmin+t and s=at, we obtain that :
˜m′(t)=−∫+∞0b(a)ρ(t,a)da+ρ(t,0)=−ρ(t,0)−g(t)2+ρ(t,0)⇒ρ(t,0)=2˜m′(t)−g(t). |
If g is lattice, before using the changes of variables, the interval (0,t) needs to be split in as many sub-intervals as necessary, so that the function is non-lattice.
Combining the expression of ˜m′ with expression (2.15) and using that b∈Cc((Amin,Amax)), we deduce that, for all t∈[0,Amin],
˜m(t)=2[˜m(t)]t0−∫t0g(a)da+∫t+aψmaxtψ(a−t)e−∫aa−tb(s)dsda. | (2.17) |
We finally deduce expression (2.14) from expression (2.17).
Hence, since ψ is a compactly supported function, we deduce the well-posedness of the inverse problem ~IP from the application of Theorem 2.2 with the suitable hypotheses.
We can now proceed to the proof of Theorem 2.3.
Proof of Theorem 2.3. The uniqueness of function b1 and parameter p(1)S is a consequence of Lemma 2.2. We now prove the uniqueness of function b2. Between t=S2 and t=S3:=Amin2+S2, in the same way as in the single layer case, only cells born from Layer 1 mother cells can divide.
Let g(t):=2(1−p(1)S)∫+∞0b1(a)ρ1(t,a)=2p(1)S−12p(1)Sm′1(t), according to Lemma 2.1. Since p(1)S is known by definition of our inverse problem (IP), we deduce that g is entirely known. Then, for all t∈(S2,S3), ρ(2) verifies
{∂tρ(2)(t,a)+∂aρ(2)(t,a)=−b2ρ(2)(t,a),a∈(0,∞),ρ(2)(t,0)=g(t)+2∫+∞0b2(a)ρ(2)(t,a)da,ρ(2)(S2,a)=2(1−p(1)S)∫+∞0b1(s)ρ1(S2−a,s)ds, |
Since this model is equivalent to PDE (2.13) (by performing a time translation t−S2), we can apply Lemma 2.3 and deduce that, for all t∈(S2,S3),
f2(t)=∫aψmaxaψminρ(2)(S2,a)e−∫a+tab2(s)dsda, |
where f2(t)=−m2(t)+2m2(0)+∫t0g(a)da=−m2(t)+2m2(0)+2p(1)S−12p(1)S(m1(t)−m1(0). Here, the support of the initial condition ρ(2)(S2,a) is (0,Amin2), so that Hypothesis 1.5 is verified. Applying Theorem 2.2, we deduce that b2 is unique. This ends the proof.
Using the unidirectional motion again, we can extend Theorem 2.3 to the case of more than two layers, N≥2.
Remark 2.4 (Self-renewal case). If we consider the case when the first layer is self-renewing (m1 is constant), then since m1(t)=ˉm1 implies that p(1)S=12, we can nevertheless recover function b2 (and p(1)S) using Theorem 2.3.
We turn now to the case of Dirac mass as initial condition. We suppose that the results proposed in [13,12] for the renewal equation (pS=12 and b non-lattice and bounded after a given age a∗) can be extended to our case (pS∈(0,1] and lattice function b). We also admit that the characteristic formula (1.5) is verified for the measure solutions μt∈M(R+), the set of signed Borel measures on R+: for all t≥0, for all a≥0,
μt(a)=1[0,t](a)μt−a(0)exp(−∫a0b(u)du)+1[t,+∞)(a)ψ(a−t)exp(−∫aa−tb(u)du),μt(0)=2pS∫R+b(a)dμt(a), | (3.1) |
in the sense that, for all h∈Cc(R+),
∫R+h(a)dμt(a)=∫t0μt−a(0)exp(−∫a0b(u)du)h(a)da+∫+∞texp(−∫aa−tb(u)du)h(a)dψ(a−t). | (3.2) |
In the same way as for the continuous initial condition case, we derive the following equation, which is the formal analog of the Fredholm integral equation in Theorem 2.1.
Theorem 3.1. Under Hypothesis 1.1, and supposing that ψ∈M([aψmin,aψmax]) and pS≠12, we define f(t):=−12pS−1m1(t)+2pS2pS−1m1(0). Then, we have for all t∈[0,Amin]
f(t)=∫aψmaxaψminexp(−∫a+tab(s)ds)dψ(a). | (3.3) |
Proof. Taking h(a)=b(a) in relation (3.2), we deduce from formula (3.1) that for all t≥0,
μt(0)=2pS[∫t0b(a)μt−a(0)exp(−∫a0b(u)du)da+∫+∞tb(a)exp(−∫aa−tb(u)du)dψ(a−t)]. |
Then, since t∈[0,Amin], we deduce from Hypothesis 1.1 that
μt(0)=2pS∫+∞tb(a)exp(−∫aa−tb(u)du)dψ(a−t)=2pS∫+∞0b(s+t)exp(−∫s+tsb(u)du)dψ(s), | (3.4) |
with the change of variables s=a−t. Then, using relation (3.4) in (3.2), we obtain that for all h∈Cc(R+),
∫R+h(a)dμt(a)=2pS∫t0[∫+∞0b(s+t−a)exp(−∫s+t−asb(u)du)dψ(s)]exp(−∫a0b(u)du)h(a)da+∫+∞texp(−∫aa−tb(u)du)h(a)dψ(a−t). | (3.5) |
Taking h(a)=1[0,aψmax+Amin](a), we deduce from relation (3.5) that:
m(t)=2pS∫t0[∫+∞0b(s+t−a)exp(−∫s+t−asb(u)du)dψ(s)]exp(−∫a0b(u)du)da+∫+∞texp(−∫aa−tb(u)du)dψ(a−t). | (3.6) |
Since t∈[0,Amin], we have
∫t0[∫+∞0b(s+t−a)exp(−∫s+t−asb(u)du)dψ(s)]exp(−∫a0b(u)du)da=∫t0[∫+∞0b(s+t−a)exp(−∫s+t−asb(u)du)dψ(s)]da. |
Then, applying first Fubini theorem then an integration by part, we deduce:
∫t0[∫+∞0b(s+t−a)exp(−∫s+t−asb(u)du)dψ(s)]da=∫+∞0(1−exp(−∫s+tsb(u)du))dψ(s). | (3.7) |
Using relation (3.7) in (3.6), we deduce that
m(t)=2pS∫R+dψ(s)−(2pS−1)∫R+exp(−∫s+tsb(u)du)dψ(s) |
and conclude.
Synchronized population We consider a synchronized population ψ(a)=ψ0δa0(a) (N=1 in the definition of ψ (1.4)).
Corollary 3.1 (Synchronized population). Under Hypotheses 1.1 and 1.3, we have, for all t∈[0,Amin],
b(a0+t)=−f′(t)f(t). | (3.8) |
Proof. Applying Theorem 3.1 with ψ(a)=ψ0δa0(a), we obtain for all t∈[0,Amin],
ψ0e−∫a0+ta0b(s)ds=f(t). |
Then, taking the logarithm function and taking the derivative with respect to time, we obtain formula (3.8).
Corollary (3.1) is illustrated in Figure 4 for different b functions. Between t=0 and t=4, the reconstructed b values in the three presented cases are identical to the expected ones. However, we can note that after t=4, the reconstructed b values are no more consistent with the expected ones, which can be explained by the fact that formula (3.8) is verified only for t∈[0,Amin].
If Amin+a0≥Amax and pS is known, we deduce the uniqueness of the b function from Corollary (3.1). In addition, we have an explicit formula to retrieve b from the observation m1 and the parameter pS, as illustrated in Figure 5. On the contrary, if Amin+a0<Amax, the b function can only be partially reconstructed on [0,Amin+a0). In that case, the uniqueness is a consequence of the additional Hypothesis 1.4.
Note that if Hypothesis 1.5 is not verified, i.e. a0>Amin, the b function can only be partially reconstructed as illustrated in Figure 5.
Discrete non-synchronized population We now consider a Dirac comb as initial condition: ψ(a)=N∑i=0Ψiδai(a) with N≥2.
Corollary 3.2 (Discrete non-synchronized population). Under Hypotheses 1.1, 1.3, 1.4 and 1.5, the problem (IP) is well-posed.
Proof. To prove the uniqueness of the b function considering that the f function is known for all t, we proceed by induction and first prove that, for all k≥0,
f(k)(t)=ϕk(t)Q(t)+R(k)(t) | (3.9) |
with the series of functions ϕk defined as
ϕk+1(t)=ϕ′k(t)−b(a0+t)ϕk(t),ϕ0(t)=1, | (3.10) |
where Q(t):=Ψ0exp(−∫a0+tAminb(s)ds) and R(t):=∑Ni=1Ψiexp(−∫ai+tAminb(s)ds).
For k=0, we apply Theorem 3.1 and obtain that, for all t∈[0,Amin],
f(t)=N∑i=0Ψiexp(−∫ai+taib(s)ds)=N∑i=0Ψiexp(−∫ai+tAminb(s)ds)=Q(t)+R(t). | (3.11) |
Then, assuming that (3.9) is true up to rank k, we compute the time derivative of (3.9), so that for all t∈[0,Amin]
f(k+1)(t)=ϕ′k(t)Q(t)+ϕk(t)Q′(t)+R(k+1)(t)=ϕk+1(t)Q(t)+R(k+1)(t), |
since Q′(t)=−b(a0+t)Q(t) and ϕk satisfies (3.10). This ends the induction.
We can now turn to the well-posedness of the inverse problem (IP).
From Hypothesis 1.5, we deduce that Amin>ai for all i∈[[1,N]]. Let us consider the positive time τ:=Amin−a1. Then, as b∈Cc((Amin,Amax)) (Hypothesis 1.1), we obtain that, for all k>0,
R(k)(τ)=0. | (3.12) |
Then, from expression (3.11), we get
f(τ)=ψ0exp(−∫a0+τAminb(s)ds)+N∑i=1Ψi | (3.13) |
hence Q(τ)=f(τ)−∑Ni=1Ψi. Combining this with (3.12) and (3.11), we deduce that, for all k≥0,
ϕk(τ)=f(k)(τ)f(τ)−∑Ni=1Ψi. | (3.14) |
We thus deduce that, for all k≥0, ϕk(τ) depends only on the f function and the initial condition ψ. From the recurrence relation (3.10), we have that ϕk depends on the k−1 first derivatives of b. Hence, we deal with an invertible triangular system since the diagonal coefficients are equal to one, and we deduce the uniqueness of b(k)(a0+τ) for each k≥0. We then deduce the uniqueness of b on its whole support, from Hypothesis 1.4.
Using Corollary 3.2, we can extend the results of Theorem 2.3 to the case of Dirac measures initial conditions.
In this paper, we have analyzed an inverse problem associated with a multi-type version of the McKendrick–VonFoerster model, and consisting of retrieving the division rate functions bj, and the probability of motion p(j)S, for j∈[[1,J−1]], from the knowledge on the total cell numbers on each layer. We chose to deal with compactly supported division rates, which account for both a recovery time after birth (Amin) and a quiescent state beyond a given age (Amax), and we have considered both synchronized or non-synchronized initial populations on the first layer, and supposed that all other layers are empty at initial time. If no division has occurred at the initial time (Amin−aψmax≥0), the entire division rate can be reconstructed. This condition is encountered in the literature, see e.g. [15]. For continuous initial conditions, we have shown the well-posedness of the inverse problem, first in the single layer case (see Theorem 2.2), and then in the several layer case (see Theorem 2.3), after introducing a sequence of nested submodels with an additional source term due to migration in the boundary condition. Then, we show the same result in the single layer case for a discrete initial condition (Corollary 3.1); we assume that the PDE (2.1) admits a measure solution, and construct this solution from the characteristic lines. Proving these latter assumptions is beyond the scope of this article and remains as an interesting open problem.
In the self-renewal case (p(j)S=12) for a layer j, the bj function cannot be retrieved from the current observation (Remark 2.2), even if the migration proportion parameters can be (Remark 2.4). We speculate that supplying additional observation such as the age-weighted distribution (∫∞0aρ(j)(t,a)da) could help to recover the identification property. In the cumulative formulation framework and suitable hypotheses, there is no particular difficulty with this case (see Theorem 4.3, [8]).
Instead of the total cell number, we could consider microscopic observation. In [7], the authors have shown, using a semi-group approach for the non-renewal version of the McKendrick–VonFoerster equation, that the death rate can be determined from observation of the age distribution at two time points including the initial time. Since, according to Lemma 2.1, there is a link between the net birth function ρ(t,0) and the total number of cells m1, we expect to be able to obtain similar results.
We would like to thank Marie Postel and Peipei Shang for useful discussions. All authors declare no conflicts of interest in this paper.
Numerical scheme
Proof. Let j∈[[1,J]]. From the transport equation (1.7) and applying an Euler explicit scheme for the differential operators ∂a and ∂t, we have, for all k>0,
˜ρ(j)(tk+1,an)−˜ρ(j)(tk,an)Δ+˜ρ(j)(tk,an+1)−˜ρ(j)(tk,an)Δ+O(Δ)=0. |
We deduce first that
˜ρ(j)(tk+1,an)≈˜ρ(j)(tk,an−1). |
Then, applying the ˜ρ(j) definition, we deduce the relation for Ujk,n (1.8). We now tackle the boundary condition. Taking advantage of the unidirectional motion, we proceed by recurrence starting with layer 1:
ρ(1)(t,0)=2p(1)S∫A1maxA1minb1(a)ρ(1)(t,a)da. |
Since b1(a)ρ(1)(t,a)=−∂tρ(1)(t,a)−∂aρ(1)(t,a), we deduce that
ρ(1)(t,0)=−2p(1)S∫A1maxA1min∂tρ(1)(t,a)da+2p(1)Sρ(1)(t,(A1min)+)−2p(1)Sρ(1)(t,(A1max)−). | (4.1) |
Applying an Euler implicit scheme to the differential operator ∂t, we obtain
ρ(1)(tk+1,0)=2p(1)Sρ(1)(tk+1,(A1min)+)−2p(1)Sρ(j)(tk+1,(A1max)−)−2p(1)S∫A1maxA1min(ρ(1)(tk+1,a)−ρ(1)(tk,a)Δ)da+O(Δ). | (4.2) |
We discretize the integral using a classical left rectangle rule where the integral ∫ak+1akg(a)da is approximated by (ak+1−ak)g(ak), and obtain the following formula:
∫A1maxA1minρ(1)(tk+1,a)da=Δ⌊A1maxΔ⌋−1∑n=⌊A1minΔ⌋ρ(1)(tk+1,an)+O(Δ2). | (4.3) |
Combining expressions (4.2) and (4.3), we deduce that
ρ(1)(tk+1,0)=2p(1)Sρ(1)(tk+1,Ajmin)−2p(1)Sρ(1)(tk+1,A1max)−2p(1)S⌊A1maxΔ⌋−1∑n=⌊A1minΔ⌋(ρ(1)(tk+1,an)−ρ(1)(tk,an))+O(Δ). |
We define U1n,0 as follow
U1k+1,0=2p(1)SU1k+1,⌊A1minΔ⌋−2p(1)SU1k+1,⌊A1maxΔ⌋−2p(1)S⌊A1maxΔ⌋−1∑n=⌊A1minΔ⌋(U1k+1,n−U1k,n)=−2p(1)S⌊A1maxΔ⌋∑n=⌊A1minΔ⌋+1U1k+1,n+2p(1)S⌊A1maxΔ⌋−1∑n=⌊A1minΔ⌋U1k,n. |
Using U1k+1,n definition (1.8), we deduce that
U1k+1,0=2p(1)S⌊A1maxΔ⌋−1∑n=⌊A1minΔ⌋(1−e−∫nΔ(n−1)Δb1(s)ds)U1n,k. |
We now consider the case j>1:
ρ(j)(t,0)=2(1−p(j−1)S)∫Aj−1maxAj−1minbj−1(a)ρ(j−1)(t,a)da+2p(j)S∫AjmaxAjminbj(a)ρ(j)(t,a)da. |
We use the same approach to discretize the two integrals in the right-hand side of the equation above and obtain expression (1.9).
Complement of proofs
Proof of Lemma 2.1. Taking the derivative of expression (2.4), we obtain
m′1(t)=ddt∫aψmax+taψmin+tρ(t,a)da+ddt∫min(0,Amin−aψmax+t)0ρ(t,a)da. | (4.4) |
Since the boundaries of the two right hand-side terms of expression (4.4) depend on time, changes of variables are required to proceed to the derivation.
We first start by the term corresponding to the remaining cells. Applying the change of variables s=a−aψmin−t, we deduce that, for all t≥0,
ddt∫aψmax+taψmin+tρ(t,a)da=ddt∫aψmax−aψmin0ρ(t,s+aψmin+t)ds=∫aψmax−aψmin0[∂tρ(t,s+aψmin+t)+∂aρ(t,s+aψmin+t)]ds=∫aψmax+taψmin+t∂tρ(t,a)da+[ρ(t,a)]aψmax+taψmin+t, | (4.5) |
applying first the chain rule then the reverse change of variables a=s+aψmin+t.
We turn now to the term representing the cells born since time t=Amin−aψmax. For all t>Amin−aψmax, we apply the change of variables a=s(Amin−aψmax+t) and obtain,
∫Amin−aψmax+t0ρ(t,a)da=(Amin−aψmax)∫10ρ(t,s(Amin−aψmax+t))ds. |
Taking the derivative of this expression and using the chain rule, we obtain:
ddt∫Amin−aψmax+t0ρ(t,a)da=∫10ρ(t,s(Amin−aψmax+t))ds+(Amin−aψmax+t)∫10[∂tρ(t,s(Amin−aψmax+t))+s∂aρ(t,s(Amin−aψmax+t))]ds. | (4.6) |
Using an integration by part, we first deduce that
(Amin−aψmax+t)∫10s∂aρ(t,s(Amin−aψmax+t))ds=[sρ(t,s(Amin−aψmax+t))]10−∫10ρ(t,s(Amin−aψmax+t))ds. | (4.7) |
Combining expressions (4.6) and (4.7), we deduce that
ddt∫Amin−aψmax+t0ρ(t,a)da=(Amin−aψmax+t)∫10∂tρ(t,s(Amin−aψmax+t))ds+ρ(t,Amin−aψmax+t)=∫Amin−aψmax+t0∂tρ(t,a)da+ρ(t,Amin−aψmax+t), | (4.8) |
using the reverse change of variables s=aaψmax+t.
Finally, combining expressions (4.5) and (4.8), we deduce, for all t>Amin−aψmax,
m′1(t)=∫aψmax+taψmin+t∂tρ(t,a)da+[ρ(t,a)]aψmax+taψmin+t+∫Amin−aψmax+t0∂tρ(t,a)da+ρ(t,Amin−aψmax+t). | (4.9) |
From PDEs (1.1), we can write that
∫aψmax+taψmin+t∂tρ(t,a)da=−∫aψmax+taψmin+tb(a)ρ(t,a)da−[ρ(t,a)]aψmax+taψmin+t | (4.10) |
and
∫Amin−aψmax+t0∂tρ(t,a)da=−∫Amin−aψmax+t0b(a)ρ(t,a)da−[ρ(t,a)]Amin−aψmax+t0. | (4.11) |
Using expressions (4.10) and (4.11), we deduce from expression (4.9), that for all t>Amin−aψmax,
m′1(t)=−∫+∞0b(a)ρ(t,a)da+ρ(t,0)=2pS−12pSρ(t,0). | (4.12) |
We complete the proof by considering the case when t∈[0,Amin−aψmax]. In that case, no division has occurred, hence for all t∈[0,Amin−aψmax], ρ(t,0)=∫min(0,Amin−aψmax+t)0ρ(t,a)da=0. In the same way as previously, we obtain that for all t∈[0,Amin−aψmax],
m′1(t)=−∫aψmax+taψmin+tb(a)ρ(t,a)da=0=2pS−12pSρ(t,0), | (4.13) |
since the intersection of the support of b, (Amin,Amax), and the interval [aψmin+t,aψmax+t] is empty when t∈[0,Amin−aψmax]. This ends the proof.
Complementary illustrations of Algorithm 1
We observe that the numerical convergence rate is faster, in both the L∞ and L2 relative error norms, in the case of a polynomial b function, as well as in the L2 norm in the case of a bump function, compared to the other cases. The convergence pattern differs according to the norm both in the bump and piecewise constant cases. A plateau is reached for relatively high values of Δ in the case of a bump function and L∞ norm.
[1] | M. E. Gurtin and R. C. MacCamy, Non-linear age-dependent population dynamics, Arch. Ration. Mech. Anal., 54(1974): 281–300. |
[2] | B. L. Keyfitz and N. Keyfitz, The McKendrick partial differential equation and its uses in epidemiology and population study, Math. Comput. Model., 26(1997): 1–9. |
[3] | L. M. Abia, O. Angulo and J. C. López-Marcos, Age-structured population models and their numerical solution, Ecol. Modell., 188(2005):112–136. |
[4] | C. Chiu, Nonlinear age-dependent models for prediction of population growth, Math. Biosci., 99(1990): 119–133. |
[5] | A. M. de Roos, Numerical methods for structured population models: the escalator boxcar train, Numer. Methods Partial. Differ. Equ., 4(1988): 173–195. |
[6] | W. Rundell, Determining the birth function for an age structured population, Math. Popul. Stud., 1(1989): 377–395. |
[7] | W. Rundell, Determining the death rate for an age-structured population from census data, SIAM J. Appl. Math., 53(1993): 1731–1746. |
[8] | M. Gyllenberg, A. Osipov, and L. Pivrinta, The inverse problem of linear age-structured population dynamics, J. Evol. Equ., 2(2002): 223–239. |
[9] | A. J. Lotka, The structure of a growing population, Hum. Biol., 3(1931): 459–493. |
[10] | A. J. Lotka, On an integral equation in population analysis, Ann. Math. Stat., 10(1939): 144–161. |
[11] | F. Clément, F. Robin and R. Yvinec, Analysis and calibration of a linear model for structured cell populations with unidirectional motion : Application to the morphogenesis of ovarian follicles, SIAM J. Appl. Math., 79(2019): 207–229. |
[12] | P. Gabriel, Measure solutions to the conservative renewal equation. ESAIM Proc. Surveys, 62(2018): 68–78. |
[13] | P. Gwiazda, T. Lorenz and A. Marciniak-Czochra, A nonlinear structured population model: Lipschitz continuity of measure-valued solutions with respect to model ingredients, J. Differ. Equ., 248(2010): 2703–2735. |
[14] | P. Gabriel, S. P. Garbett, V. Quaranta et al., The contribution of age structure to cell population responses to targeted therapeutics, J. Theor. Biol., 311(2012): 19–27. |
[15] | A. Perasso and U. Razafison, Identifiability problem for recovering the mortality rate in an agestructured population dynamics model, Inverse Probl. Sci. Eng., 24(2016): 711–728. |
[16] | B. Perthame and J. P. Zubelli, On the inverse problem for a size-structured population model. Inverse Problems, 23(2007): 1037. |
[17] | M. Doumic, B. Perthame and J. P. Zubelli, Numerical solution of an inverse problem in sizestructured population dynamics, Inverse Problems, 25(2009): 045008. |
[18] | T. Bourgeron, M. Doumic and M. Escobedo, Estimating the division rate of the growthfragmentation equation with a self-similar kernel, Inverse Problems, 30(2014): 025007. |
[19] | M. Iannelli, T. Kostova and F. Augusto Milner, A fourthorder method for numerical integration of age and sizestructured population models, Numer. Methods Partial. Differ. Equ., 25(2009): 918–930. |
1. | Алексей Юрьевич Щеглов, Aleksei Yur'evich Shcheglov, Святослав Викторович Нетесов, Svyatoslav Viktorovich Netesov, О восстановлении функциональных коэффициентов в модели динамики квазистабильной популяции, 2022, 34, 0234-0879, 85, 10.20948/mm-2022-03-05 | |
2. | A. Yu. Shcheglov, S. V. Netessov, The Reconstruction of Functional Coefficients for a Quasi-Stable Population Dynamics’ Model, 2022, 14, 2070-0482, 808, 10.1134/S207004822205012X | |
3. | Jacques Demongeot, Quentin Griette, Yvon Maday, Pierre Magal, A Kermack–McKendrick model with age of infection starting from a single or multiple cohorts of infected patients, 2023, 479, 1364-5021, 10.1098/rspa.2022.0381 | |
4. | Ivanna Andrusyak, Oksana Brodyak, Petro Pukach, Myroslava Vovk, Mathematical Modeling of Cell Growth via Inverse Problem and Computational Approach, 2024, 12, 2079-3197, 26, 10.3390/computation12020026 | |
5. | A. Yu. Shcheglov, S. V. Netessov, On Recovering Two Parameters in the Quasilinear Model of Population Dynamics with Age Structuring, 2025, 1046-283X, 10.1007/s10598-024-09606-8 |