Modeling One Dimensional Two-Cell Model with Tumor Interaction Using Krylov Subspace Methods

Abstract

A brain tumor occurs when abnormal cells grow, sometimes very rapidly, into an abnormal mass of tissue. The tumor can infect normal tissue, so there is an interaction between healthy and infected cell. The aim of this paper is to propose some efficient and accurate numerical methods for the computational solution of one-dimensional continuous basic models for the growth and control of brain tumors. After computing the analytical solution, we construct approximations of the solution to the problem using a standard second order finite difference method for space discretization and the Crank-Nicolson method for time discretization. Then, we investigate the convergence behavior of Conjugate gradient and generalized minimum residual as Krylov subspace methods to solve the tridiagonal toeplitz matrix system derived.

Share and Cite:

Alqahtani, I. and Alhazmi, S. (2023) Modeling One Dimensional Two-Cell Model with Tumor Interaction Using Krylov Subspace Methods. Applied Mathematics, 14, 21-34. doi: 10.4236/am.2023.141002.

1. Introduction

The biological models involving partial differential equations (PDEs) are back to the work of K. Pearson and J. Blakeman in the early 1900s, [1]. In the 1930s others, including R. A. Fisher, applied PDEs to the spatial spread of genes and of diseases, [2] [3]. Population dynamics is a branch of mathematics and ecology that looks at population variations, taking into account the influence of the interactions between populations, [4]. It is necessary that the evolution is continuous in time and Mathematics has a rich history of studying such systems, for example, that is to say governed by differential equations and by the data of an initial state. Mathematical models contain evolutionary partial differential equations (PDEs) arise in diverse domains such as image processing, fluid flow, and computer vision, mechanical systems, relativity, earth sciences, and mathematical finance. The biological invasion is a complicated phenomenon that can be caused by various sources, both natural and unintended, [5]. Like all tumors, the biological and clinical aspects of gliomas are complex and the details of their spatiotemporal growth are still not well understood, [6]. Let u ˜ ( x ˜ , t ˜ ) be the number of cells at a position x ˜ and time t ˜ . We take the basic model, in dimensional form, as a conservation equation [7]:

u ˜ t ( x ˜ , t ˜ ) = ( d u ˜ ) + ρ u ˜ + T u ˜ (1)

ρ represents the net rate of growth of cells including proliferation and death (or loss), T is a matrix representing transfer between sub-populations and d is the diffusion coefficient of cells in brain tissue. The theoretical models, referred to above, considered the brain tissue to be homogeneous so the diffusion and growth rates of the tumor cells are taken to be constant throughout the brain. We consider zero flux boundary conditions on the anatomic boundaries of the brain and the ventricles. So, if D is the brain domain on which the Equation (1) is to be solved, the boundary conditions are n d u ˜ where n is the unit normal to the boundary D of D. With the geometric complexity of an anatomically accurate brain it is clearly a very difficult analytical problem and a nontrivial numerical problem, even in two dimensions. For simplicity, we limit our study in this paper to the one dimensional problem. In [8], the authors present an extension to Swanson’s reaction diffusion model to include the effects of radiation therapy. In our case, we are motivated to study numerical models that can be used to solve all reaction diffusion equation that describe the propagation of tumor. They inherit traits from the parent tumor and are therefore they capable of vascularize and create new metastases. The cancer is then generalized and finished by threatening the functioning of many vital organs of the patient, so there is a big relationship between growth of tumor cells and biological invasion. The question about modeling cancer tumor growth has led many researchers into extensive studies in this area. This problem has not only fascinated medical and biological researcher, but also applied mathematicians. There have been many techniques developed that can be used to study the evolution and treatment response of the tumor. The tumor growth or decay is considered as a function of time. Moreover, the scientists add a spatial variable to the evolution of the tumor, so that the spread of time will be a function that depends not only on time but also a spatial variable. So, we denote by u ( x , t ) the concentration of tumor cells at position x and time t, then the simulations on growth or decay of tumor cells with time can be studied to understand the phenomena. Since, there are many interactions between sub-populations, so one can look to the existence of two clonal sub-populations u and v within a tumor with mutational transfer. In general case, a clone is a group of identical cells that share a common ancestry, meaning they are produced from a single organism, for more details see [9]. This will help scientists to think for examples where cancer treatment whit medicine is used to kill cancer cells. The existence of two sub-populations u and v within a tumor with mutational transfer needs to be rigorously studied with a focus on the dominance of one sub-population over another. Her initial goal was to simulate and produce a qualitative behavior of the unknown function. Numerical simulation and analytic results of this simpler model will be compared. The plan of the manuscript is the following. Section 2, we describe the model problem that will be solved. In section 3, we present a strategy to compute the analytical solution. Section 4, develops a numerical scheme to obtain a numerical solution that can compared to exact solution. Section 5 study the subpopulation dominates the tumor composition. Finally, we conclude.

2. Problem Setting and Definition

Assume there are two clonal sub-populations within a tumor with mutational transfer. We assume one population has a high growth and low diffusion coefficient while the second population has a low growth rate and high diffusion coefficient; there are different other scenarios we could take. In the model here we do not view the second cell population as a mutation but rather a cell line in its own right. In the following, we describe such a model. The sub-populations are not independent but are connected by mutational events transferring cancer between different cells. A fairly general but basic model to account for population polyclonality is presented in the case of two cell populations:

u ˜ t ˜ ( x ˜ , t ˜ ) = d 1 2 u ˜ x ˜ 2 ( x ˜ , t ˜ ) + ( ρ 1 ω ) u ˜ ( x ˜ , t ˜ )

v ˜ t ˜ ( x ˜ , t ˜ ) = d 2 2 v ˜ x ˜ 2 ( x ˜ , t ˜ ) + ρ 2 v ˜ ( x ˜ , t ˜ ) + ω v ˜ ( x ˜ , t ˜ )

u ˜ ( x ˜ , 0 ) = f ( x ˜ )

v ˜ ( x ˜ , 0 ) = g ( x ˜ ) , x ˜

with u ˜ the more grow rapidly population and v ˜ the more rapidly diffusing population, d 2 > d 1 with ρ 1 > ρ 2 . Moreover, we assume u ˜ cells are the only tumor cells initially present, that f ( x ) > 0 and g ( x ) = 0 , with some small probability, ω ρ 1 , u cells mutate to form v ˜ cells. Initially, we suppose there is a source of u ˜ tumor cells that have mutated from healthy cells and can multiply rapidly then the neighboring normal cells thereby starting to form a tumor. We can consider of ω as a measure of the probability of u ˜ tumor cells mutating to become the rapidly diffusing tumor cell population v ˜ .

We first non-dimensionalise the spatially heterogeneous model, which as usual, also decreases the number of effective parameters in the system, and get some idea of the relative importance of various terms.

x = ρ 1 d 1 x ˜ , t = ρ 1 t ˜ , β = ρ 2 ρ 1 ( 0 , 1 ) , α = ω ρ 1 , μ = d 2 d 1

We define the new function

u ( x , t ) = d 1 ρ 1 u ¯ u ˜ ( ρ 1 d 1 x ˜ , ρ 1 t ˜ ) (2)

v ( x , t ) = d 1 ρ 1 u ¯ v ˜ ( ρ 1 d 1 x ˜ , ρ 1 t ˜ ) (3)

where u ¯ represents the initial number of tumor cells in the brain at model time t ˜ = 0 .

Let us take the initial source of u tumor cells to be u ( x , 0 ) = δ ( x ) and v ( x , 0 ) = 0 . Where δ ( x ) is the delta function is referred to the Dirac delta function [10].

Therefore, we solve the following problem

u t ( x , t ) = 2 u x 2 ( x , t ) + ( 1 α ) u ( x , t ) (4)

v t ( x , t ) = μ 2 v x 2 ( x , t ) + β v ( x , t ) + α u ( x , t )

u ( x , 0 ) = δ ( x ) ,

v ( x , 0 ) = 0 , x

The two cell populations, u ( x , t ) and v ( x , t ) were obtained by the numerical integration of the model system. With this model the parameters are the diffusion coefficient, d 1 , d 2 , the two growth rates ρ 1 and ρ 2 of the first and second cell populations respectively. The total density of cancerous cells, c ( x , t ) = u ( x , t ) + v ( x , t ) was obtained by the numerical solution.

3. Analytical Solution

Since, we deal with a linear PDEs, defined in an infinite spatial domain. In 1, we give the analytical solution of (4).

Proposition 1. The solution of (4) is given by

u ( x , t ) = e ( 4 α + 4 ) t 2 x 2 4 t 1 4 π t

v ( x , t ) = α e μ ( 1 α ) β μ 1 t 4 ( 1 α β ) ( μ 1 ) ( e 1 α β μ 1 x v 1 ( x , t ) + e 1 α β μ 1 x v 2 ( x , t ) )

where

v 1 ( x , t ) = erfc ( 2 α β + 1 μ 1 t x 4 t ) erfc ( 2 α β + 1 μ 1 μ t x 4 μ t ) (5)

v 2 ( x , t ) = erfc ( 2 α β + 1 μ 1 t + x 4 t ) erfc ( 2 α β + 1 μ 1 μ t + x 4 μ t ) (6)

with μ > 1 , 1 α β > 0 and erfc is the complementary error function.

Proof. The equation

t u ( x , t ) = 2 x 2 u ( x , t ) + ( 1 α ) u ( x , t ) , < x < (7)

is a second order linear partial differential equation that can be solved using the initial data u ( x , 0 ) = δ ( x ) . We use a Fourier transform in the spatial variable x to solve this equation.

Starting with Equation (7), we take Fourier transforms (with respect the space variable x) of both sides, we arrive to

t u ^ ( k , t ) = ( 1 α k 2 ) u ^ ( k , t ) (8)

The initial condition gives u ^ ( k , 0 ) = δ ( x ) ^ = 1 .

Thus the solution is

u ^ ( k , t ) = e ( 1 α k 2 ) t = e ( 1 α ) t e k 2 t (9)

Now, to retrieve u ( x , t ) , we have to take the inverse Fourier transform of both sides. Using that the inverse Fourier of Gaussian function us given by g ( x , t ) = π t e x 2 4 t this lead to

u ( x , t ) = 1 4 π t e ( 1 α ) t x 2 4 t

Since, u ( x , t ) is obtained, now we can solve the second partial differential equation to find v. More precisely, we solve

t v ( x , t ) = μ 2 x 2 v ( x , t ) + β v ( x , t ) + α u ( x , t ) (10)

v ( x ,0 ) = 0, x

Once, again we use the Fourier transform in the spatial variable x to solve this equation, we have

t ^ v ( x , t ) = μ 2 x 2 v ( x , t ) ^ + β v ( x , t ) ^ + α u ( x , t ) ^

This leads to

t V ( w , t ) = μ ( i w ) 2 V ( w , t ) + β V ( w , t ) + α U ( w , t ) (11)

t V ( w , t ) = ( β μ w 2 ) V ( w , t ) + α U ( w , t ) (12)

where V ( w , t ) = v ( x , t ) ^ , and U ( w , t ) = u ( x , t ) ^ .

Using that

U ( w , t ) = e ( 1 α w 2 ) t

then we arrive to

t V ( w , t ) = ( β μ w 2 ) V ( w , t ) + α e ( 1 α w 2 ) t

Thus, one again we obtain a first order non-homogeneous ODE in t. Since, v ( x , 0 ) = 0 then V ( w , 0 ) = 0 . Thus, we have a solve

t V ( w , t ) = ( β μ w 2 ) V ( w , t ) + α e ( 1 α w 2 ) t (13)

V ( w , 0 ) = 0 (14)

Using integration factor methods, we get

V ( w , t ) = α e ( β μ w 2 ) t 0 t e ( β μ w 2 ) s e ( 1 α w 2 ) s d s

Therefore, we arrive to

V ( w , t ) = α e ( 1 α w 2 ) t e ( β μ w 2 ) t 1 α β + w 2 ( μ 1 ) = α ( e ( 1 α w 2 ) t e ( β μ w 2 ) t ) 1 1 α β + w 2 ( μ 1 ) (15)

Now, to retrieve v ( x , t ) , we have to take the inverse Fourier transform of both sides. Therefore,

v ( x , t ) = F 1 ( V ( w , t ) )

The right-hand side of Equation (15) becomes a product of Fourier transforms. Using the convolution theorem properties we have:

v ( x , t ) = α F 1 { e ( 1 α w 2 ) t e ( β μ w 2 ) t } F 1 { 1 1 α β + w 2 ( μ 1 ) }

v ( x , t ) = α ( F 1 { e ( 1 α w 2 ) t } F 1 { e ( β μ w 2 ) t } ) F 1 { 1 1 α β + w 2 ( μ 1 ) }

v ( x , t ) = α ( e ( 1 α ) t F 1 { e w 2 t } e β t F 1 { e μ w 2 t } ) F 1 { 1 1 α β + w 2 ( μ 1 ) }

v ( x , t ) = α ( e ( 1 α ) t 1 4 π t e x 2 4 t e β t 1 4 π μ t e x 2 4 μ t ) F 1 { 1 1 α β + w 2 ( μ 1 ) }

A straightforward calculus gives

F 1 { 1 1 α β + w 2 ( μ 1 ) } = 1 μ 1 1 2 θ e θ | x | , θ 2 = 1 α β μ 1 (16)

So, we arrive to

v ( x , t ) = α e ( 1 α ) t 1 4 π t e x 2 4 t 1 μ 1 1 2 θ e θ | x | α e β t 1 4 π μ t e x 2 4 μ t 1 μ 1 1 2 θ e θ | x |

v ( x , t ) = α 2 ( μ 1 ) θ 1 4 π t e ( 1 α ) t + e ( x ς ) 2 4 t e θ | ς | d ς α 2 ( μ 1 ) θ 1 4 π μ t e β t + e ( x ς ) 2 4 μ t e θ | ς | d ς

So, it is enough to compute the integral + e ( x ς ) 2 4 t e θ | ς | d ς . A straightforward calculus give

+ e ( x ς ) 2 4 t e θ | ς | d ς = π t e θ 2 t ( e θ x erfc ( x + 2 t θ 2 t ) + e θ x erfc ( 2 t θ x 2 t ) )

Thus, substituting t by μ t we get

+ e ( x ς ) 2 4 μ t e θ | ς | d ς = π μ t e θ 2 μ t ( e θ x erfc ( x + 2 t μ θ 2 μ t ) + e θ x erfc ( x + 2 t μ θ 2 μ t ) )

Finally, collecting the above pieces we conclude that

v ( x , t ) = α e μ ( 1 α ) β μ 1 t 4 ( 1 α β ) ( μ 1 ) ( e 1 α β μ 1 x v 1 ( x , t ) + e 1 α β μ 1 x v 2 ( x , t ) ) (17)

with

v 1 ( x , t ) = erfc ( 2 θ t x 4 t ) erfc ( 2 θ μ t x 4 μ t )

v 2 ( x , t ) = erfc ( 2 θ t + x 4 t ) erfc ( 2 θ μ t + x 4 μ t )

Hence, the request result.

Note that Maple is unable solve the system symbolically. The first PDE has only the unknown u, so we solve it for u, then, we substitute the result in the second PDE, and solve that for v. Using this the following MAPLE lines, once again the analytical solution can be derived.

4. Numerical Simulation

If we hope to solve a PDEs on a computer, we can only do so in an approximate sense, since a computer can only deal with a finite amount of data. The strategy of turning a continuous equation into a finite-dimensional equation suitable for solving on a computer is referred to as discretizing an equation. The most popular being finite differences, finite elements and finite volume discretizations. A common point to these approaches is that at the end, the partial differential equation is converted into a set of linear equations or possible nonlinear equations, that can be solved using different schemes. We will focus in our study on finite difference method.

4.1. Finite Difference Approximations

Since numerical simulation using MATLAB only understands finite domains, we will compute a numerical solution in the one space interval ( a , a ) where a is large positive number. Considering the space domain an interval ( a , a ) , a > 0 . The computational domain will be ( x , t ) ( a , a ) × ( 0, T ) . The computational domain is discretised into a uniform mesh.

The finite difference grid points (or nodes) are given by

x i = a + i h , i = 0 , 1 , , N , h = 2 a N ,

t j = j Δ t , j = 0 , 1 , , N t , δ t = T N t .

Let u i , j (resp v i , j ) be an approximation to u ( x i , y j ) (resp. v ( x i , y j ) ).

The implicit scheme Crank-Nicolson difference equations of our problem are:

u j n + 1 = u j n + λ 2 ( u j + 1 n 2 u j n + u j 1 n ) + λ 2 ( u j + 1 n + 1 2 u j n + 1 + u j 1 n + 1 ) + δ t ( 1 α ) u j n

v j n + 1 = v j n + λ μ 2 ( v j + 1 n 2 v j n + v j 1 n ) + λ μ 2 ( v j + 1 n + 1 2 v j n + 1 + v j 1 n + 1 ) + δ t β v j n + δ t α u j n

where λ = δ t h 2 . In order, to get the solution we add initial conditions: u i 0 = δ ( x i ) and v i 0 = 0 . The solution vanishes at infinity, so we will use zero boundary conditions at x = ± a . Rearranging the equation, the Crank-Nicolson has the more convenient and condensed symbolic representation (matrix form):

( 2 I λ A ) U n + 1 = ( ( 2 + 2 δ t ( 1 α ) ) I + λ A ) U n + F n + 1 , n = 0 , , N t 1. (18)

where

F n + 1 = λ [ u 0 n + 1 + u 0 n , 0 , , 0 , u N n + 1 + u N n ] T N 1

U n + 1 = [ u 1 n + 1 , u 2 n + 1 , , u N 1 n + 1 ] T N 1 .

and A is the one-dimensional Laplacian discretization. It is assumed that the boundary values and initial condition are known.

Similarly, we have for n = 0 , , N t 1 :

( 2 I λ μ A ) V n + 1 = ( ( 2 + 2 δ t β ) I + λ μ A ) V n + 2 δ t α U n + G n + 1 (19)

where

G n + 1 = λ μ [ v 0 n + 1 + v 0 n , 0 , , 0 , v N n + 1 + v N n ] T N 1

V n + 1 = [ v 1 n + 1 , v 2 n + 1 , , v N 1 n + 1 ] T N 1 .

For n = 0 , , N t 1 , we have

U n + 1 = ( 2 I λ A ) 1 { ( ( 2 + 2 δ t ( 1 α ) ) I + λ A ) U n + F n + 1 } , (20)

V n + 1 = ( 2 I λ μ A ) 1 { ( ( 2 + 2 δ t β ) I + λ μ A ) V n + 2 δ t α U n + G n + 1 } .

So, once the initial condition and boundary conditions are known we can compute using Equation (20) all values at any future time. Moreover, the matrices 2 I λ A , and 2 I μ λ A are tridiagonal and diagonally dominant, so invertible.

4.2. Krylov Subspace Iteration

We present iterative methods for solving linear algebraic equation based on Krylov subspaces. We use conjugate gradient (CG) method developed by Hestenes and Stiefel in 1950s for symmetric and positive definite matrix and the GMRES method for general non symmetric matrix systems [11]. We fixed the parameter α = 0.5 , β = 0.1 and μ = 10 , for a first step, we use Gauss Elimination or LU decomposition to solve the system of algebraic equation, the behavior of u u + v and v u + v and u + v is depicted in Figure 1. The Conjugate Gradient method, the Generalized Minimal Residual method are widely used to solve a linear system. The choice of a method depends on 2 I λ A symmetry property and or definiteness. Using Conjugate gradient method the solution is obtained and it has the similar behavior as GMRES, see Figure 2. CG is preferable choice in many cases of symmetric-positive-definite matrix because it requires less storage and theoretical bound on convergence rate for CG is double of that GMRES, Figure 3. Moreover, 3 shows the transition of dominance from the rapidly growing u population to the rapidly diffusing v population. The initial tumor consisted of only u cells, for large time the v subpopulation can dominate depending on the value of the mutation probability parameter α. Once again, we observe that the diffusion is more important to glioma growth and invasion then proliferation. The transition of dominance can be interpreted as follows: the total tumor cell population volume is dominated at later times by the second, more aggressive, tumor subpopulation v or v dominates at a single point or neighborhood of points, say, near the center of the tumor, but does not necessarily fill the volume. Figure 4, shows the three dimensional behavior of u u + v and v u + v . In the simulations, the tumor area increases up to the beginning of the first chemotherapy. As expected, the decrease in the tumor area is larger for a higher value of the effect of the first chemotherapy. The value of the parameters, as well as the initial data of the tumor, are thus critical for determining the spatia-temporal variation of the tumor. There is clearly a maximum value for the tumor area,

(a) (b) (c) (d)

Figure 1. Parameters: α = 0.5 , μ = 10 , and β = 0.1 , solution behavior u u + v and v u + v at different times. (a) Transition of dominance from u to v at t = 50 (s); (b) Transition of dominance from u to v at t = 5 (s); (c) Transition of dominance from u to v at t = 1 (s); (d) Transition of dominance from u to v at t = 0.2 (s).

which is the brain area without the ventricles. An important implication of this solution is that for certain values of α, we see that the initially nonexistent subpopulation v can eventually dominate the growth of the tumor. In our simulation, the different values are fixed so that there is an interaction between two cells, the most significant conditions will be fixed later.

5. Invasion of Tumor Propagation

5.1. Transition of Dominance at a Fixed Location

To see if the subpopulation v dominates the tumor composition at a given location,

(a) (b) (c) (d)

Figure 2. Transition of dominance from u to v at different times with α = 0.5 , μ = 10 , and β = 0.1 . (a) Transition of dominance from u to v at t = 0.2 (s); (b) Transition of dominance from u to v at t = 1 (s); (c) Transition of dominance from u to v at t = 5 (s); (d) Transition of dominance from u to v at t = 50 (s).

Figure 3. Log10 of absolute error versus time using GMRES and CG schemes.

(a)(b)

Figure 4. Three dimensional behavior of u u + v and of v u + v . (a) Matlab surf of u u + v ; (b) Matlab surf of v u + v .

for example at the center of the tumor x = 0 , one can consider the ratio of the two sub-populations v ( x , t ) u ( x , t ) . Two different periods can be viewed. The first, for small t, the ratio v ( x , t ) u ( x , t ) < 1 since u is initially the only population present. Whereas, for large t, using MAPLE expansion series ( v ( x , t ) u ( x , t ) , t= infinity, 2) to compute the asymptotic expansion of v ( x , t ) u ( x , t ) with respect to the variable t (as t approaches infinity), we get

v ( x , t ) u ( x , t ) = α 1 α β + 1 2 α ( 1 μ ) ( 1 α β ) 2 1 t + O ( 1 t 2 )

Thus, we deduce that for large time v ( x , t ) u ( x , t ) α 1 α β , therefore the condition for the diffuse population v dominance is β > 1 2 α . To estimate the time at which the transition of dominance occurs we solve for t the equation u / v = 1 we obtain t * = 1 2 α ( 1 μ ) ( 1 α β ) ( 1 2 α β ) . The time of transition of dominance t * does depend on μ and is positive if the condition of dominance is established. If μ lager than one, the diffusion v cells is important than the u cells and the time dominance is large. Anyway, if the parameters α and β satisfy the dominance condition, the time to this transition is short if the diffusion coefficients are nearly equivalent, that is μ ~ 1 .

5.2. Transition of Dominance in Volume

We consider the case in which we can determine the entire tumor and find the proportion of the tumor volume occupied by u and v cells individually. In the present case, transition of dominance arises if the volume occupied by v cells surpass that occupied by u cells. Integrating the solution u and v over , we can find the temporal behavior of the tumor cell subpopulation volumes. Considering U ( t ) (resp. V ( t ) ) to be the volume of the tumor occupied by u (resp. v) cells, i.e. U ( t ) = u ( x , t ) d x , V ( t ) = v ( x , t ) d x . Using the system of PDEs verified by u and v, we obtain

( U ( t ) V ( t ) ) = ( 1 α 0 β α ) ( U ( t ) V ( t ) )

( U ( 0 ) V ( 0 ) ) = ( 1 0 )

Solving the system we obtain U ( t ) = e ( 1 α ) t , V ( t ) = α e ( 1 α ) t e β t 1 α β . Now, we can deduce the transition of dominance in the volume occurs if the ratio V / U = 1 , this leads to

t = 1 1 α β ln ( α 2 α + β 1 )

where 1 2 α < β < 1 α . Certainly, it’s obvious that there are values of α and β for which transition of dominance at a point happen and that of volume does not. This can be interpreted as a failure for accurate tumor biopsies. This, let us to conclude that studying a small portion of tissue extracted from the center of a tumor will not necessarily prove the actual total tumor composition.

6. Conclusion

The analytical solution of a coupled system of PDEs is determined using Fourier transform and convolution product. Finite difference method is applied to transform the continuous problem to a system of algebraic equations. An implicit scheme is proposed, more precisely Crank-Nicolson method leads to a special structure system that solved using Krylov subspace. The numerical solution is compared to the analytical solution. Numerical iterative Krylov subspace methods; GMRES and CG are used to solve the implicit linear system. The behavior of tumor propagation over time is studied using different parameters. Finally, a set of numerical experiments confirms the theoretical findings. The transmission of tumor and dominance is developed, and under some condition, the transition of dominance at a point happen and that of volume does not. Considering the results obtained in this paper, we plan in the future to tackle the multi-cell model with tumor Polyclonality in two-dimensional space domain.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Clairambault, J. (2013) Partial Differential Equation (PDE), Models. In: Dubitzky, W., Wolkenhauer, O., Cho, K.H. and Yokota, H., Eds, Encyclopedia of Systems Biology, Springer, New York.
https://doi.org/10.1007/978-1-4419-9863-7_694
[2] Fisher, R.A. (1937) The Wave of Advance of Advantageous Genes. Annals of Eugenics (London), 7, 355-369.
https://doi.org/10.1111/j.1469-1809.1937.tb02153.x
[3] Tang, S. and Weber, R.O. (1991) Numerical Study of Fisher’s Equation by a Petrov-Galerkin Finite Element Method. Journal of the Australian Mathematical Society, 33, 27-38.
https://doi.org/10.1017/S0334270000008602
[4] Gurtin, M.E. and MacCamy, R.C. (1977) On the Diffusion of Biological Populations. Mathematical Biosciences, 33, 35-49.
https://doi.org/10.1016/0025-5564(77)90062-1
[5] Lowry, E., Rollinson, E.J., et al. (2012) Biological Invasions: A Field Synopsis, Systematic Review, and Database of the Literature. Ecology and Evolution, 3, 182-196.
https://doi.org/10.1016/0025-5564(77)90062-1
[6] Watkins, S. and Sontheimer, H. (2012) Unique Biology of Gliomas: Challenges and Opportunities. Trends in Neurosciences, 35, 546-556.
https://doi.org/10.1016/j.tins.2012.05.001
[7] Murray, J.D. (1970) On the Gunn Effect and Other Physical Examples of Perturbed Conservation Equations. Journal of Fluid Mechanics, 44, 315-346.
https://doi.org/10.1017/S0022112070001854
[8] Rockne, R., Alvord, E.C., Rockhill Jr, J.K. and Swanson, K.R. (2009) A Mathematical Model for Brain Tumor Response to Radiation Therapy. Journal of Mathematical Biology, 58, 561-578.
https://doi.org/10.1007/s00285-008-0219-6
[9] Cook, R.E. (1983) Clonal Plant Populations. American Scientist, 71, 244-253.
[10] Buttkus, B. (2000) The Dirac Delta Function and Its Fourier Transform. Spectral Analysis and Filter Theory in Applied Geophysics, Springer, Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-57016-2
[11] Saad, Y. (2003) Iterative Methods for Sparse Linear Systems.
https://www-users.cse.umn.edu/~saad/IterMethBook_2ndEd.pdf

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.