Well-Posedness and a Finite Difference Approximation for a Mathematical Model of HPV-Induced Cervical Cancer

Abstract

We present a first-order finite difference scheme for approximating solutions of a mathematical model of cervical cancer induced by the human papillomavirus (HPV), which consists of four nonlinear partial differential equations and a nonlinear first-order ordinary differential equation. The scheme is analyzed and used to provide an existence-uniqueness result. Numerical simulations are performed in order to demonstrate the first-order rate of convergence. A sensitivity analysis was done in order to compare the effects of two drug types, those that increase the death rate of HPV-infected cells, and those that increase the death rate of the precancerous cell population. The model predicts that treatments that affect the precancerous cell population by directly increasing the corresponding death rate are far more effective than those that increase the death rate of HPV-infected cells.

Share and Cite:

Ma, B. and Thibodeaux, J. (2023) Well-Posedness and a Finite Difference Approximation for a Mathematical Model of HPV-Induced Cervical Cancer. Applied Mathematics, 14, 151-172. doi: 10.4236/am.2023.143009.

1. Introduction

Human pappilomavirus (HPV) is one of the most widespread sexually transmitted diseases worldwide. New infections in the United States alone are estimated to be between 1 and 5.5 million per year [1] . Over 200 types have been genetically distinguished.

In females, the virus targets basal epithelial cells in the cervix. With prolonged exposure, these infections can lead to the development of precancerous cells and, without treatment, cancerous cells [2] . Of the over 200 distinguished gentotypes, HPV types 16, 18, 31, and 45 are considered to be high-risk for inducing cervical cancer after prolonged infection.

Mathematical modeling techniques have been used to investigate the dynamics of cervical cancer, both from epidemiological [3] [4] [5] [6] and cellular [2] [7] [8] [9] [10] viewpoints. Our work here is in the latter context. The initial studies of within-host HPV infection leading to cervical cancer described the dynamics with systems of ordinary differential equations [2] [8] [10] . The models included the dynamics of the susceptible epithelial cells, infected cells, precancerous cells, cancerous cells, and viral particles. In [7] , the authors modified the previous models to incorporate the age of each of the cell types previously mentioned. This results in a more extensive description of the biological processes, with the added cost of a more complicated model. Taking the age of cells into account yields a model of a system of four first-order, nonlinear, partial differential equations and an ordinary differential equation. More recently, Sari et al. [9] proposed a modification of the model in [7] that eliminates the ordinary differential equation describing the viral population.

Systems of first-order partial differential equations have been applied to a wide range of biological processes, including algal growth, amphibian population growth, erythropoiesis, and fungal propagation [11] [12] [13] [14] [15] . The mathematical approaches to analyzing those systems have been just as varied. In some cases, such as in [7] [9] , stability analysis can be successfully applied to investigate the long-term behavior of solutions. If more knowledge of transient solution behavior or sensitivity analysis is desired, then numerical methods provide a useful tool.

Finite element methods, integrating along characteristics, upper-lower solution techniques, and finite difference schemes have all been successfully applied to various systems of first-order partial differential equations [11] [14] [16] [17] [18] . In this work, we follow the ideas presented in [18] , which were successfully applied to the nonlinear size-structured population model in [16] . The approach yields a simple first-order finite difference scheme that can first be used to provide existence-uniqueness results, and then can be implemented to approximate solutions of the model.

The paper is organized as follows. In Section 2, we define the various components of the model and the paraments that affect their behavior. In Section 3, we define weak solutions of the model and provide conditions on parameters that are required for the results that are presented in later sections. We also define the finite difference scheme in detail and the notation that will be used throughout the paper. In Section 4, we will provide the results necessary to establish an existence-uniqueness result. In Section 5, we present the main theoretical results of this work. Namely, the construction of sequences of functions that converge to the unique weak solution of the model. To our knowledge, this is the first well-posedness result for the model. In Section 6, we numerically analyze the finite difference scheme itself and show that it indeed provides first-order accuracy. In Section 7, we explore the model’s sensitivity to certain parameters that are associated with currently available drug treatments. Finally, in Section 8 we will make some concluding remarks.

2. The Model

The model that is the focus of this work was developed in [7] and takes the form of a system of four first-order partial differential equations and an ordinary differential equation. The model describes the population densities of the susceptible cell ( S ( a , t ) ), infected cell ( I ( a , t ) ), precancerous cell ( P ( a , t ) ), and cancerous cell ( C ( a , t ) ) populations, as well as the number of HPV viral particles ( V ( t ) ), at time t and age a. The total populations of the susceptible, infected, precancerous, and cancerous cell types at time t are denoted by N S ( t ) = 0 a d S ( a , t ) d a , N I ( t ) = 0 a d I ( a , t ) d a , N P ( t ) = 0 a d P ( a , t ) d a , and N C ( t ) = 0 a d C ( a , t ) d a , respectively, where a d is the maximum lifespan of the cells. We denote their respective death rates by d s , d i , d p , and d c . The infection of healthy cells by free virus particles is modeled by the mass action term α V ( t ) S ( a , t ) . Infected cells are partially moved into the precancerous cell population, modeled by the term δ I ( t ) . The rate at which precancerous cells move into the cancerous cell population is modeled dynamically with the bounded function μ ( N P ) = θ N P ( t ) 1 + κ N P ( t ) , although the theoretical results we provide in this work are valid for any continuously differentiable function μ with 0 < μ 1 . The viral population is modeled by means of an ordinary differential equation. It is assumed that there is a constant production of viral particles, at a rate of Λ . There is a density-dependent death rate d v ( V ) . Since the total population of infected cells dies at a rate of d i N I ( t ) , it is assumed that viral particles are produced at a rate proportional to this rate, with a constant of proportionality n. Non-cancerous cells are assumed to have a reproductive age range of [ a r , a q ] , while that of cancerous cells is [ a c , a l ] . The reproductive age range of cancer cells is shifted relative to that of the noncancerous cells [7] , and so it is assumed that a c < a r and a l < a q . Noncancerous cells are assumed to have a birth rate of β 0 , while cancerous cells have a birth rate of β c . Finally, the initial cell densities are given by S ( a , 0 ) = S 0 ( a ) , I ( a , 0 ) = I 0 ( a ) , P ( a , 0 ) = P 0 ( a ) , and C ( a ,0 ) = C 0 ( a ) , and the initial viral load is V ( 0 ) = V 0 .

These definitions and assumptions lead to the following model:

S ( a , t ) t + S ( a , t ) a = ( d s + α V ( t ) ) S ( a , t ) , 0 < t < T , 0 < a < a d , I ( a , t ) t + I ( a , t ) a = ( d i + δ ) I ( a , t ) + α V ( t ) S ( a , t ) , 0 < t < T , 0 < a < a d , P ( a , t ) t + P ( a , t ) a = d p P ( a , t ) + δ I ( a , t ) μ ( N p ) P ( a , t ) , 0 < t < T , 0 < a < a d , C ( a , t ) t + C ( a , t ) a = d c C ( a , t ) + μ ( N p ) P ( a , t ) , 0 < t < T , 0 < a < a d , d V ( t ) d t = Λ d v ( V ) V ( t ) + n d i 0 a d I ( a , t ) d a , 0 < t < T ,

S ( 0 , t ) = β 0 a r a q S ( a , t ) d a , 0 < t < T , I ( 0 , t ) = β 0 a r a q I ( a , t ) d a , 0 < t < T , P ( 0 , t ) = β 0 a r a q P ( a , t ) d a , 0 < t < T , C ( 0 , t ) = β c a c a l C ( a , t ) d a , 0 < t < T ,

S ( a , 0 ) = S 0 ( a ) , 0 < a < a d , I ( a , 0 ) = I 0 ( a ) , 0 < a < a d , P ( a , 0 ) = P 0 ( a ) , 0 < a < a d , C ( a , 0 ) = C 0 ( a ) , 0 < a < a d , V ( 0 ) = V 0 (2.1)

An uncommon aspect of this model is that the integrals in the boundary conditions are not over the entire interval [ 0, a d ] . This presents difficulties in both the implementation of the finite difference scheme and the proofs that will follow in later sections.

Remark 2.1 While the work in [9] proposes a modified model that eliminates the ordinary differential equation in (2.1), the ideas of the forthcoming numerical scheme can be adapted for such a case. Hence, we preform the analysis on the model proposed in [7] .

3. A Finite Difference Scheme

Let c be a sufficiently large positive constant. Throughout the discussion we impose the following regularity conditions on our model parameters in (2.1).

1) The function d v : [ 0, ) [ 0, ) is continuous.

2) The function μ : [ 0, ) [ 0, ) is continuous and satisfies 0 < μ ( x ) 1 for all x in [ 0, ) .

3) The parameters V 0 , d s , d i , d p , α , δ , n , a l , a c , a r , a q , β 0 , β c are nonnegative constants.

4) The initial conditions S 0 ( a ) , I 0 ( a ) , P 0 ( a ) , C 0 ( a ) are nonnegative with

S 0 B V ( 0, a d ) , I 0 B V ( 0, a d ) , P 0 B V ( 0, a d ) , C 0 B V ( 0, a d ) c

Now we give the definition of a weak solution to problem (2.1) as follows: A 5-tuple ( S , I , P , C , V ) ( B V ( ( 0, a d ) × ( 0, T ) ) , B V ( ( 0, a d ) × ( 0, T ) ) , B V ( ( 0, a d ) × ( 0, T ) ) , B V ( ( 0, a d ) × ( 0, T ) ) , C [ 0, T ] ) is called a weak solution to the problem (2.1) if it satisfies:

0 a d S ( ν , t ) ζ 1 ( ν , t ) d ν = 0 a d S 0 ( ν ) ζ 1 ( ν , 0 ) d ν 0 t S ( a d , τ ) ζ 1 ( a d , τ ) d τ + β 0 0 t ( a r a q S ( a , τ ) d a ) ζ 1 ( 0 , τ ) d τ + 0 t 0 a d ( ζ 1 τ ( ν , τ ) + ζ 1 ν ( ν , τ ) ) S ( ν , τ ) d ν d τ 0 t 0 a d ( d s + α V ( τ ) ) S ( ν , τ ) ζ 1 ( ν , τ ) d ν d τ ,

0 a d I ( ν , t ) ζ 2 ( ν , t ) d ν = 0 a d I 0 ( ν ) ζ 2 ( ν , 0 ) d ν 0 t I ( a d , τ ) ζ 2 ( a d , τ ) d τ + β 0 0 t ( a r a q I ( a , τ ) d a ) ζ 2 ( 0 , τ ) d τ + 0 t 0 a d ( ζ 2 τ ( ν , τ ) + ζ 2 ν ( ν , τ ) ) I ( ν , τ ) d ν d τ + 0 t 0 a d ( ( d i + δ ) I ( ν , τ ) + α V ( t ) S ( ν , τ ) ) ζ 2 ( ν , τ ) d ν d τ ,

0 a d P ( ν , t ) ζ 3 ( ν , t ) d ν = 0 a d P 0 ( ν ) ζ 3 ( ν , 0 ) d ν 0 t P ( a d , τ ) ζ 3 ( a d , τ ) d τ + β 0 0 t ( a r a q P ( a , τ ) d a ) ζ 3 ( 0 , τ ) d τ + 0 t 0 a d ( ζ 3 τ ( ν , τ ) + ζ 3 ν ( ν , τ ) ) P ( ν , τ ) d ν d τ + 0 t 0 a d ( d p P ( ν , τ ) + δ I ( ν , τ ) μ ( N p ) P ( ν , τ ) ) ζ 3 ( ν , τ ) d ν d τ ,

0 a d C ( ν , t ) ζ 4 ( ν , t ) d ν = 0 a d C 0 ( ν ) ζ 4 ( ν , 0 ) d ν 0 t C ( a d , τ ) ζ 4 ( a d , τ ) d τ + β c 0 t ( a r a q C ( a , τ ) d a ) ζ 4 ( 0 , τ ) d τ + 0 t 0 a d ( ζ 4 τ ( ν , τ ) + ζ 4 ν ( ν , τ ) ) C ( ν , τ ) d ν d τ + 0 t 0 a d ( d c C ( ν , τ ) + μ ( N p ) P ( ν , τ ) ) ζ 4 ( ν , τ ) d ν d τ ,

V ( t ) = V 0 + 0 t ( Λ d v ( V ) V ( τ ) + n d i 0 a d I ( a , τ ) d a ) d τ ,

for each t ( 0, T ) , every test function ζ i C 1 ( [ 0 , a d ] × [ 0 , T ] ) , i = 1 , 2 , 3 , 4 . Here, S ( a d , τ ) = lim ν a d S ( ν , τ ) , I ( a d , τ ) = lim ν a d I ( ν , τ ) , P ( a d , τ ) = lim ν a d P ( ν , τ ) , and C ( a d , τ ) = lim ν a d C ( ν , τ ) . First, we divide the intervals [ 0, a d ] and [ 0, T ] into m and K subintervals, respectively, and use the following notation throughout the paper: Δ a = a d / m , and Δ t = T / K denote the age and time mesh sizes, respectively. The mesh points are given by: a j = j Δ a , j = 0 , 1 , , m and t k = k Δ t , k = 0 , 1 , , K . We denote by S j k , I j k , P j k , and C j k , the finite difference approximations of S ( a j , t k ) , I ( a j , t k ) , P ( a j , t k ) , and C ( a j , t k ) , respectively. Further, we denote V ( t k ) by V k , μ ( N P ( t k ) ) by μ P k , and d v ( V k ) by d v k . We approximate the total cell populations with

N X k = l = 1 m X l k Δ a ,

where X = S , I , P , C . Since the parameters a r , a q , a c and a l will not generally coincide with our mesh points, we define the following:

j r + = min { j | a j > a r } , j q = max { j | a j < a q } , j c + = min { j | a j > a c } , j l = max { j | a j < a l } .

The total variation, l 1 norm, and l norm are defined as

T V ( u k ) = j = 0 m 1 | u j + 1 k u j k | ,

u k 1 = j = 1 m | u j k | , u k = max 0 j m | u j k | ,

respectively. The first-order scheme that will be considered here is given by:

S j k + 1 S j k Δ t + S j k S j 1 k Δ a = ( d s + α V k ) S j k + 1 , 1 j m , 0 k K 1 I j k + 1 I j k Δ t + I j k I j 1 k Δ a = ( d i + δ ) I j k + 1 + α V k S j k + 1 , 1 j m , 0 k K 1 P j k + 1 P j k Δ t + P j k P j 1 k Δ a = d p P j k + 1 + δ I j k + 1 μ P k P j k + 1 , 1 j m , 0 k K 1 C j k + 1 C j k Δ t + C j k C j 1 k Δ a = d c C j k + 1 + μ P k P j k + 1 , 1 j m , 0 k K 1 V k + 1 V k Δ t = Λ d v k V k + 1 + n d i N I k , 0 k K 1. (3.1)

The boundary conditions are computed as follows:

S 0 k + 1 = β 0 ( S ( a j r + , t k + 1 ) ( a j r + a r ) + j = j r + j q S ( a j , t k + 1 ) Δ a + S ( a j q , t k + 1 ) ( a q a j q ) ) , 0 k K 1 I 0 k + 1 = β 0 ( I ( a j r + , t k + 1 ) ( a j r + a r ) + j = j r + j q I ( a j , t k + 1 ) Δ a + I ( a j q , t k + 1 ) ( a q a j q ) ) , 0 k K 1 P 0 k + 1 = β 0 ( P ( a j r + , t k + 1 ) ( a j r + a r ) + j = j r + j q P ( a j , t k + 1 ) Δ a + P ( a j q , t k + 1 ) ( a q a j q ) ) , 0 k K 1 C 0 k + 1 = β c ( C ( a j c + , t k + 1 ) ( a j c + a c ) + j = j c + j l C ( a j , t k + 1 ) Δ a + C ( a j l , t k + 1 ) ( a l a j l ) ) , 0 k K 1. (3.2)

The initial conditions for p and m are computed as follows:

S i 0 = S 0 ( a j ) , I i 0 = I 0 ( a j ) , P i 0 = P 0 ( a j ) , C i 0 = C 0 ( a j ) , j = 0 , , m

Equation (3.1) is more conveniently used in the following form:

S j k + 1 = S j k ( 1 Δ t Δ a ) + Δ t Δ a S j 1 k 1 + Δ t ( d s + α V k ) , 1 j m , 0 k K 1 I j k + 1 = I j k ( 1 Δ t Δ a ) + Δ t Δ a I j 1 k + Δ t α V k S j k + 1 1 + Δ t ( d i + δ ) , 1 j m , 0 k K 1 P j k + 1 = P j k ( 1 Δ t Δ a ) + Δ t Δ a P j 1 k + Δ t δ I j k + 1 1 + Δ t ( d p + μ P k ) , 1 j m , 0 k K 1

C j k + 1 = C j k ( 1 Δ t Δ a ) + Δ t Δ a C j 1 k + Δ t μ P k P j k + 1 1 + Δ t d c , 1 j m , 0 k K 1 V k + 1 = V k + Δ t ( Λ + n d i N I k ) 1 + Δ t d v k , 0 k K 1 (3.3)

It is clear from the assumptions on the initial conditions and Equation (3.3) that the numerical solutions will remain nonnegative as long as Δ t Δ a < 1 .

4. Estimates for the Finite Difference Approximations

The lemma below shows that the numerical approximations are bounded in the l 1 norm.

Lemma 4.1 There exists a positive constant M 1 , independent of Δ a and Δ t , such that

S k 1 + I k 1 + P k 1 + C k 1 + | V k | M 1 ,

for k = 0 , 1 , , K .

Proof. Multiply the first four equations of (3.1) on both sides by Δ t and Δ a and sum over j = 1 , 2 , , m

S k + 1 1 S k 1 + S m k Δ t S 0 k Δ t = ( d s + α V k ) S k + 1 1 Δ t , I k + 1 1 I k 1 + I m k Δ t I 0 k Δ t = ( d i + δ ) I k + 1 1 Δ t + α V k S k + 1 1 Δ t , P k + 1 1 P k 1 + P m k Δ t P 0 k Δ t = d p P k + 1 1 Δ t + δ I k + 1 1 Δ t μ p k P k + 1 1 Δ t , C k + 1 1 C k 1 + C m k Δ t C 0 k Δ t = d c C k + 1 1 Δ t + μ p k P k + 1 1 Δ t (4.1)

Multiply the fifth equation of (3.1) on both sides by Δ t

V k + 1 V k = Λ Δ t d v k V k + 1 Δ t + n d i I k 1 Δ t (4.2)

Adding up the five equations in (4.1) and (4.2) we have

( 1 + d s Δ t ) S k + 1 1 + ( 1 + d i Δ t ) I k + 1 1 + ( 1 + d p Δ t ) P k + 1 1 + ( 1 + d c Δ t ) C k + 1 1 + ( 1 + d v k Δ t ) | V k + 1 | = S k 1 + ( 1 + n d i Δ t ) I k 1 + P k 1 + C k 1 + | V k | + ( S 0 k + I 0 k + P 0 k + C 0 k + Λ ) Δ t ( S m k + I m k + P m k + C m k ) Δ t

From the boundary condition, we have

S 0 k β 0 S k 1 , I 0 k β 0 I k 1 , P 0 k β 0 P k 1 , C 0 k β c C k 1

Therefore,

( 1 + d s Δ t ) S k + 1 1 + ( 1 + d i Δ t ) I k + 1 1 + ( 1 + d p Δ t ) P k + 1 1 + ( 1 + d c Δ t ) C k + 1 1 + ( 1 + d v k Δ t ) | V k + 1 | ( 1 + β 0 Δ t ) ( S k 1 + P k 1 ) + ( 1 + β c Δ t ) C k 1 + ( 1 + β 0 Δ t + n d i Δ t ) I k 1 + | V k | + Λ Δ t

Let C ˜ = max { β 0 + n d i , β c } . Then

S k + 1 1 + I k + 1 1 + P k + 1 1 + C k + 1 1 + | V k + 1 | ( 1 + C ˜ Δ t ) ( S k 1 + I k 1 + P k 1 + C k 1 + | V k | ) + Λ Δ t ,

which implies the result.

Next we establish a bound on the infinity norm of the numerical approximations.

Lemma 4.2 There exists a positive constant M 2 , independent of Δ a and Δ t , such that

S k + I k + P k + C k M 2 ,

for k = 0 , 1 , , K .

Proof. If S k + 1 = S 0 k + 1 , then

S k + 1 β 0 S k + 1 1 β 0 M 1 .

If S k + 1 is not obtained on the boundary, then there exists a j 0 with 1 j 0 m such that S k + 1 = S j 0 k + 1 .

From the first equation of (3.1)

S j 0 k + 1 = S j 0 k Δ t Δ a ( S j 0 k S j 0 1 k ) ( d s + α V k ) S j 0 k + 1 Δ t ,

That is,

S j 0 k + 1 [ 1 + ( d s + α V k ) Δ t ] = S j 0 k ( 1 Δ t Δ a ) + S j 0 1 k Δ t Δ a .

Thus,

S k + 1 S k .

This implies that S k + 1 is bounded since S 0 is bounded. Similarly, if I k + 1 = I 0 k + 1 , then

I k + 1 β 0 I k + 1 1 β 0 M 1 .

If I k + 1 is not obtained on the boundary, then there exists a j 0 with 1 j 0 m such that I k + 1 = I j 0 k + 1 .

From the second equation of (3.1)

I j 0 k + 1 = I j 0 k Δ t Δ a ( I j 0 k I j 0 1 k ) ( d i + δ ) I j 0 k + 1 Δ t + α V k S j 0 k + 1 Δ t .

Therefore,

( 1 + ( d i + δ ) Δ t ) I k + 1 I k + α V k S k + 1 Δ t .

I k + 1 I k + α M 1 S k + 1 Δ t .

Similarly, if P k + 1 = P 0 k + 1 , then

P k + 1 β 0 P k + 1 1 β 0 M 1 .

If P k + 1 is not obtained on the boundary, then there exists a j 0 with 1 j 0 m such that P k + 1 = P j 0 k + 1 .

From the third equation of (3.1)

P j 0 k + 1 ( 1 + Δ t ( d p + μ P k ) ) = ( 1 Δ t Δ a ) P j 0 k + Δ t Δ a P j 0 1 k + δ I j 0 k + 1 Δ t .

Therefore,

P k + 1 P k + δ I k + 1 Δ t .

Similarly, if C k + 1 = C 0 k + 1 , then

C k + 1 β c C k + 1 1 β c M 1 .

If C k + 1 is not obtained on the boundary, then there exists a j 0 with 1 j 0 m such that C k + 1 = C j 0 k + 1 .

From the third equation of (3.1)

C j 0 k + 1 ( 1 + d c Δ t ) = ( 1 Δ t Δ a ) C j 0 k + Δ t Δ a C j 0 1 k + μ p k P j 0 k + 1 Δ t .

Therefore,

C k + 1 C k + μ p k P k + 1 Δ t C k + P k + 1 Δ t .

In the next lemma we show that the difference approximations are of bounded total variation.

Lemma 4.3 There exists a positive constant M 3 , independent of Δ a and Δ t , such that

T V ( S k ) + T V ( I k ) + T V ( P k ) + T V ( C k ) M 3

for k = 0 , 1 , , K .

Proof. From the first equation of (3.2) we have

S j k + 1 = S j k ( 1 Δ t Δ a ) + Δ t Δ a S j 1 k 1 + Δ t ( d s + α V k ) S j k + 1 ( 1 + Δ t ( d s + α V k ) ) = S j k ( 1 Δ t Δ a ) + Δ t Δ a S j 1 k

Thus,

S j + 1 k + 1 ( 1 + Δ t ( d s + α V k ) ) = S j + 1 k ( 1 Δ t Δ a ) + Δ t Δ a S j k

Subtracting the above two equations and summing over j = 1 , 2 , , m 1 :

j = 1 m 1 ( S j + 1 k + 1 S j k + 1 ) ( 1 + Δ t ( d s + α V k ) ) = j = 1 m 1 ( S j + 1 k S j k ) ( 1 Δ t Δ a ) + j = 1 m 1 ( S j k S j 1 k ) Δ t Δ a

By the first equation of (3.2):

S 1 k + 1 ( 1 + Δ t ( d s + α V k ) ) = S 1 k ( 1 Δ t Δ a ) + Δ t Δ a S 0 k

Combining:

T V ( S k + 1 ) ( 1 + Δ t ( d s + α V k ) ) = ( | S 1 k + 1 S 0 k + 1 | + j = 1 m 1 | S j + 1 k + 1 S j k + 1 | ) ( 1 + Δ t ( d s + α V k ) )

Here,

| S 1 k + 1 S 0 k + 1 | ( 1 + Δ t ( d s + α V k ) ) = | S 1 k ( 1 Δ t Δ a ) + Δ t Δ a S 0 k S 0 k + 1 ( 1 + Δ t ( d s + α V k ) ) | = | Δ t Δ a ( S 0 k S 1 k ) + S 1 k S 0 k + 1 S 0 k + 1 Δ t ( d s + α V k ) | = | ( 1 Δ t Δ a ) ( S 1 k S 0 k ) ( S 0 k + 1 S 0 k ) S 0 k + 1 Δ t ( d s + α V k ) |

From the boundary condition,

| S 0 k + 1 S 0 k | = β 0 | ( S ( a j r + , t k + 1 ) ( a j r + a r ) + j = j r + j q S j k + 1 Δ a + S ( a j q , t k + 1 ) ( a q a j q ) ) ( S ( a j r + , t k ) ( a j r + a r ) + j = j r + j q S j k Δ a + S ( a j q , t k ) ( a q a j q ) ) | = β 0 | ( S ( a j r + , t k + 1 ) S ( a j r + , t k ) ) ( a j r + a r ) + j = j r + j q ( S j k + 1 S j k ) Δ a + ( S ( a j q , t k + 1 S ( a j q , t k ) ( a q a j q ) |

β 0 ( | S ( a j r + , t k + 1 ) S ( a j r + , t k ) | ( a j r + a r ) + j = j r + j q | S j k + 1 S j k | Δ a + | S ( a j q , t k + 1 ) S ( a j q , t k ) | ( a q a j q ) ) β 0 j = 1 m | S j k + 1 S j k | Δ a

From the first equation in (3.1),

( S j k + 1 S j k ) Δ a = ( S j k S j 1 k ) Δ t ( d s + α V k ) S j k + 1 Δ t Δ a

Thus,

| S 0 k + 1 S 0 k | β 0 j = 1 m | S j k + 1 S j k | Δ a β 0 j = 1 m | S j k S j 1 k | Δ t + β 0 j = 1 m ( d s + α V k ) S j k + 1 Δ t Δ a β 0 T V ( S k ) Δ t + β 0 ( d s + α M 2 ) S k + 1 1 Δ t

Therefore,

T V ( S k + 1 ) T V ( S k + 1 ) ( 1 + Δ t ( d s + α V k ) ) = ( | S 1 k + 1 S 0 k + 1 | + j = 1 m 1 | S j + 1 k + 1 S j k + 1 | ) ( 1 + Δ t ( d s + α V k ) ) ( 1 Δ t Δ a ) T V ( S k ) + S 0 k + 1 Δ t ( d s + α V k ) + | S 0 k + 1 S 0 k | + T V ( S k ) Δ t Δ a

T V ( S k ) + β 0 S k + 1 1 Δ t ( d s + α M 2 ) + β 0 T V ( S k ) Δ t + β 0 ( d s + α M 2 ) S k + 1 1 Δ t = ( 1 + β 0 Δ t ) T V ( S k ) + ( β 0 S k + 1 1 ( d s + α M 2 ) + β 0 ( d s + α M 2 ) S k + 1 1 ) Δ t

Similarly,

j = 1 m 1 ( I j + 1 k + 1 I j k + 1 ) ( 1 + Δ t ( d i + δ ) ) = j = 1 m 1 ( I j + 1 k I j k ) ( 1 Δ t Δ a ) + Δ t Δ a j = 1 m 1 ( I j k I j 1 k ) + Δ t α V k j = 1 m 1 ( S j + 1 k + 1 S j k + 1 )

| I 1 k + 1 I 0 k + 1 | ( 1 + Δ t ( d i + δ ) ) ( 1 Δ t Δ a ) | I 1 k I 0 k | + | I 0 k + 1 I 0 k | + Δ t α V k S 1 k + 1 ( 1 Δ t Δ a ) | I 1 k I 0 k | + β 0 j = 1 m | I j k + 1 I j k | Δ a + Δ t α V k S 1 k + 1

( 1 Δ t Δ a ) | I 1 k I 0 k | + β 0 ( j = 1 m | I j k I j 1 k | Δ t + j = 1 m ( d i + δ ) I j k + 1 Δ a Δ t + j = 1 m α V k S j k + 1 Δ a Δ t ) + Δ t α V k S 1 k + 1 ( 1 Δ t Δ a ) | I 1 k I 0 k | + β 0 ( T V ( I k ) Δ t + ( d i + δ ) I k + 1 1 Δ t + α V k S k + 1 1 Δ t ) + Δ t α V k S 1 k + 1

Therefore,

T V ( I k + 1 ) T V ( I k + 1 ) ( 1 + Δ t ( d i + δ ) ) = ( | I 1 k + 1 I 0 k + 1 | + j = 1 m 1 | I j + 1 k + 1 I j k + 1 | ) ( 1 + Δ t ( d i + δ ) ) ( 1 + β 0 Δ t ) T V ( I k ) + Δ t ( α V k T V ( S k + 1 ) + β 0 ( d i + δ ) I k + 1 1 + α V k S k + 1 1 + α V k S k + 1 )

Similarly, by the third equation of (3.1) and (3.3),

j = 1 m 1 | P j + 1 k + 1 P j k + 1 | ( 1 + Δ t ( d p + μ p k ) ) ( 1 Δ t Δ a ) j = 1 m 1 | P j + 1 k P j k | + Δ t Δ a j = 1 m 1 | P j k P j 1 k | + Δ t δ j = 1 m 1 | I j + 1 k + 1 I j k + 1 |

and

| P 1 k + 1 P 0 k + 1 | ( 1 + Δ t ( d p + μ p k ) ) = | ( 1 Δ t Δ a ) ( P 1 k P 0 k ) ( P 0 k + 1 P 0 k ) P 0 k + 1 Δ t ( d p + μ p k ) | ( 1 Δ t Δ a ) | P 1 k P 0 k | + β 0 j = 1 m | P j k + 1 P j k | Δ a + P 0 k + 1 Δ t ( d p + μ p k ) ( 1 Δ t Δ a ) | P 1 k P 0 k | + β 0 Δ t ( T V ( P k ) + ( d p + μ p k ) P k + 1 1 + δ I k + 1 1 ) + P 0 k + 1 Δ t ( d p + μ p k )

Therefore,

T V ( P k + 1 ) T V ( P k + 1 ) ( 1 + Δ t ( d p + μ p k ) ) = j = 1 m 1 | P j + 1 k P j k | ( 1 + Δ t ( d p + μ p k ) ) + | P 1 k + 1 P 0 k + 1 | ( 1 + Δ t ( d p + μ p k ) ) ( 1 + β 0 Δ t ) T V ( P k ) + Δ t ( δ T V ( I k + 1 ) + P k + 1 ( d p + μ p k ) + β 0 ( d p + μ p k ) P k + 1 1 + β 0 δ I k + 1 1 )

Similarly, by the fourth equation of (3.1) and (3.3),

j = 1 m 1 | C j + 1 k + 1 C j k + 1 | ( 1 + Δ t d c ) ( 1 Δ t Δ a ) j = 1 m 1 | C j + 1 k C j k | + Δ t Δ a j = 1 m 1 | C j k C j 1 k | + Δ t μ p k j = 1 m 1 | P j + 1 k + 1 P j k + 1 |

and

| C 1 k + 1 C 0 k + 1 | ( 1 + Δ t d c ) = | ( 1 Δ t Δ a ) ( C 1 k C 0 k ) ( C 0 k + 1 C 0 k ) C 0 k + 1 Δ t d c + Δ t μ p k P 1 k + 1 | ( 1 Δ t Δ a ) | C 1 k C 0 k | + | C 0 k + 1 C 0 k | + Δ t ( d c C k + 1 + μ p k P k + 1 ) ( 1 Δ t Δ a ) | C 1 k C 0 k | + β c i = 1 m | C j k + 1 C j k | Δ a + Δ t ( d c C k + 1 + μ p k P k + 1 ) ( 1 Δ t Δ a ) | C 1 k C 0 k | + β c Δ t ( T V ( C k ) + d c C k + 1 1 + μ p k P k + 1 1 ) + Δ t ( d c C k + 1 + μ p k P k + 1 )

Therefore,

T V ( C k + 1 ) T V ( C k + 1 ) ( 1 + Δ t d c ) = j = 1 m 1 | C j + 1 k C j k | ( 1 + Δ t d c ) + | C 1 k + 1 C 0 k + 1 | ( 1 + Δ t d c ) ( 1 + β c Δ t ) T V ( C k ) + Δ t ( μ p k T V ( P k + 1 ) + β c ( T V ( C k ) + d c C k + 1 1 + μ p k P k + 1 1 ) + d c C k + 1 + μ p k P k + 1 )

The next lemma shows the numerical approximations satisfy an l 1 Lipschitz-type condition in t.

Lemma 4.4 There exists M 4 > 0 , independent of Δ a and Δ t , such that for any integers N 2 > N 1 0 , the following estimates hold:

j = 1 m | S j N 2 S j N 1 Δ t | Δ a M 4 ( N 2 N 1 ) , j = 1 m | I j N 2 I j N 1 Δ t | Δ a M 4 ( N 2 N 1 ) , j = 1 m | P j N 2 P j N 1 Δ t | Δ a M 4 ( N 2 N 1 ) , j = 1 m | C j N 2 C j N 1 Δ t | Δ a M 4 ( N 2 N 1 ) ,

Proof. From the first equation of (3.1),

j = 1 m | S j k + 1 S j k Δ t | Δ a T V ( S k ) + ( d s + α V k ) S k + 1 1 M ¯ 1

for some positive constant M ¯ 1 . Hence,

j = 1 m | S j N 2 S j N 1 Δ t | Δ a k = N 1 N 2 1 j = 1 m | S j k + 1 S j k Δ t | Δ a M ¯ 1 ( N 2 N 1 )

Similarly, there exist positive integers M ¯ 2 , M ¯ 3 , M ¯ 4 such that

j = 1 m | I j N 2 I j N 1 Δ t | Δ a k = N 1 N 2 1 j = 1 m | I j k + 1 I j k Δ t | Δ a ( T V ( I k ) + ( d i + δ ) I k + 1 1 + α V k S k + 1 1 ) ( N 2 N 1 ) M ¯ 2 ( N 2 N 1 ) ,

j = 1 m | P j N 2 P j N 1 Δ t | Δ a k = N 1 N 2 1 j = 1 m | P j k + 1 P j k Δ t | Δ a ( T V ( P k ) + ( d p + μ p k ) P k + 1 1 + δ I k + 1 1 ) ( N 2 N 1 ) M ¯ 3 ( N 2 N 1 ) ,

and

j = 1 m | C j N 2 C j N 1 Δ t | Δ a k = N 1 N 2 1 j = 1 m | C j k + 1 C j k Δ t | Δ a ( T V ( C k ) + d c C k + 1 1 + μ p k P k + 1 1 ) ( N 2 N 1 ) M ¯ 4 ( N 2 N 1 ) .

Set M 4 = max i = 1 , 2 , 3 , 4 { M ¯ i } and the results follow.

5. Convergence of the Difference Scheme and Existence of a Unique Weak Solution

Following similar notation as in [18] [19] , we define a family of functions { U 1 ( Δ a , Δ t ) } , { U 2 ( Δ a , Δ t ) } , { U 3 ( Δ a , Δ t ) } , and { U 4 ( Δ a , Δ t ) } by

U 1 ( Δ a , Δ t ) ( a , t ) = S i k , U 2 ( Δ a , Δ t ) ( a , t ) = I j k , U 3 ( Δ a , Δ t ) ( a , t ) = P j k , U 4 ( Δ a , Δ t ) ( a , t ) = C j k ,

and V Δ t ( t ) = V k 1 + V k V k 1 Δ t ( t t k 1 ) , for a [ a j 1 , a j ) , t [ t k 1 , t k ) , j = 1 , , m , k = 1 , , K . Then by Lemmas 4.1 - 4.4, the each of the functions { U 1 ( Δ a , Δ t ) } , { U 2 ( Δ a , Δ t ) } , { U 3 ( Δ a , Δ t ) } , { U 4 ( Δ a , Δ t ) } is compact in the topology of L 1 ( ( 0, a d ) × ( 0, T ) ) . Also, { V Δ t } is compact in the topology of C [ 0, T ] .

Theorem 5.1 There exists a subsequence of functions { U 1 ( Δ a r , Δ t r ) } { U 1 ( Δ a , Δ t ) } , { U 2 ( Δ a r , Δ t r ) } { U 2 ( Δ a , Δ t ) } , { U 3 ( Δ a r , Δ t r ) } { U 3 ( Δ a , Δ t ) } , { U 4 ( Δ a r , Δ t r ) } { U 4 ( Δ a , Δ t ) } , and { V Δ t r } { V Δ t } , which converge to functions S ( a , t ) , I ( a , t ) , P ( a , t ) , C ( a , t ) B V ( [ 0, a d ] × [ 0, T ] ) , and V ( t ) C [ 0, T ] , respectively, in the sense that for all t > 0

0 a d | U 1 ( Δ a r , Δ t r ) ( a , t ) S ( a , t ) | d a 0,

0 a d | U 2 ( Δ a r , Δ t r ) ( a , t ) I ( a , t ) | d a 0

0 a d | U 3 ( Δ a r , Δ t r ) ( a , t ) P ( a , t ) | d a 0,

0 a d | U 4 ( Δ a r , Δ t r ) ( a , t ) C ( a , t ) | d a 0,

0 T 0 a d | U 1 ( Δ a r , Δ t r ) ( a , t ) S ( a , t ) | d a d t 0 ,

0 T 0 a d | U 2 ( Δ a r , Δ t r ) ( a , t ) I ( a , t ) | d a d t 0 ,

0 T 0 a d | U 3 ( Δ a r , Δ t r ) ( a , t ) P ( a , t ) | d a d t 0 ,

0 T 0 a d | U 4 ( Δ a r , Δ t r ) ( a , t ) C ( a , t ) | d a d t 0 ,

max t [ 0, T ] | V Δ t r ( t ) V ( t ) | 0,

as r (i.e., Δ a r , Δ t r 0 ). Furthermore, there exist constants M 5 (depending on S 0 B V [ 0, a d ] , I 0 B V [ 0, a d ] , P 0 B V [ 0, a d ] , and C 0 B V [ 0, a d ] ) such that the limit function satisfy S B V ( [ 0, a d ] × [ 0, T ] ) M 5 , V B V ( [ 0, a d ] × [ 0, T ] ) M 5 , P B V ( [ 0, a d ] × [ 0, T ] ) M 5 , C B V ( [ 0, a d ] × [ 0, T ] ) M 5 , and V C [ 0, T ] M 5 .

Proof. The results for S ( a , t ) , I ( a , t ) , P ( a , t ) , and C ( a , t ) follow from the proof of Lemma 16.7 on P. 276 in [18] . The results for V ( t ) follows from Theorem I.28 (Ascoli’s Theorem) in [20] .

We show in the next theorem that the set of limit functions { S ( a , t ) , I ( a , t ) , P ( a , t ) , C ( a , t ) , V ( t ) } constructed by the finite difference scheme is a weak solution to problem (2.1).

Theorem 5.2 The set of limit functions { S ( a , t ) , I ( a , t ) , P ( a , t ) , C ( a , t ) , V ( t ) } defined in Theorem 5.1 is a weak solution of problem (2.1) and satisfies

S ( , t ) 1 + I ( , t ) 1 + P ( , t ) 1 + C ( , t ) 1 + | V ( t ) | M 1 ,

and

S L ( ( 0, a d ) × ( 0, T ) ) + I L ( ( 0, a d ) × ( 0, T ) ) + P L ( ( 0, a d ) × ( 0, T ) ) + C L ( ( 0, a d ) × ( 0, T ) ) + V c [ 0, T ] M 1 + M 2 .

Proof. Let ζ i C 1 ( [ 0, a d ] × [ 0, T ] ) for i = 1 , 2 , 3 , 4 . Denote the finite difference approximations ζ i ( ν j , t k ) by ( ζ i ) j k . Multiplying the first equation of the finite difference scheme (3.1) by ( ζ 1 ) j k + 1 and rearranging some of the terms, we obtain

S j k + 1 ( ζ 1 ) j k + 1 S j k ( ζ 1 ) j k = S j k ( ( ζ 1 ) j k + 1 ( ζ 1 ) j k ) Δ t Δ a ( ( ζ 1 ) j k + 1 S j k ( ζ 1 ) j 1 k + 1 S j 1 k ) + Δ t Δ a S j 1 k ( ( ζ 1 ) j k + 1 ( ζ 1 ) j 1 k + 1 ) ( d s + α V k ) S j k + 1 ( ζ 1 ) j k + 1 Δ t

Multiplying the above equation by Δ a , summing over j = 1 , 2 , , m , k = 0 , 1 , , K 1 , and using the boundary condition we have

j = 1 m ( S j K ( ζ 1 ) j K S j 0 ( ζ 1 ) j 0 ) Δ a = k = 0 K 1 j = 1 m ( S j k ( ( ζ 1 ) j k + 1 ( ζ 1 ) j k ) Δ a ( d s + α V k ) S j k + 1 ( ζ 1 ) j k + 1 Δ a Δ t ) k = 0 K 1 S m k ( ζ 1 ) m k + 1 Δ t + k = 0 K 1 ( ζ 1 ) 0 k + 1 β 0 ( S ( a j r + , t k ) ( a j r + a r ) + j = j r + j q S j k Δ a + S ( a j q , t k ) ( a q a j q ) ) Δ t + k = 0 K 1 j = 1 m S j 1 k ( ( ζ 1 ) j k + 1 ( ζ 1 ) j 1 k + 1 ) Δ t , (5.1)

Similarly,

j = 1 m ( I j K ( ζ 2 ) j K I j 0 ( ζ 2 ) j 0 ) Δ a = k = 0 K 1 j = 1 m ( I j k ( ( ζ 2 ) j k + 1 ( ζ 2 ) j k ) Δ a + I j 1 k ( ( ζ 2 ) j k + 1 ( ζ 2 ) j 1 k + 1 ) ) Δ t k = 0 K 1 I m k ( ζ 2 ) m k + 1 Δ t + k = 0 K 1 ( ζ 2 ) 0 k + 1 β 0 ( I ( a j r + , t k ) ( a j r + a r ) + j = j r + j q I j k Δ a + I ( a j q , t k ) ( a q a j q ) ) Δ t + k = 0 K 1 j = 1 m ( ( d i + δ ) I j k + 1 + α V k S j k + 1 ) ( ζ 2 ) j k + 1 Δ a Δ t , (5.2)

j = 1 m ( P j K ( ζ 3 ) j K P j 0 ( ζ 3 ) j 0 ) Δ a = k = 0 K 1 j = 1 m ( P j k ( ( ζ 3 ) j k + 1 ( ζ 3 ) j k ) Δ a + P j 1 k ( ( ζ 3 ) j k + 1 ( ζ 3 ) j 1 k + 1 ) ) Δ t k = 0 K 1 P m k ( ζ 3 ) m k + 1 Δ t + k = 0 K 1 ( ζ 3 ) 0 k + 1 β 0 ( P ( a j r + , t k ) ( a j r + a r ) + j = j r + j q P j k Δ a + P ( a j q , t k ) ( a q a j q ) ) Δ t + k = 0 K 1 j = 1 m ( d p P j k + 1 + δ I j k + 1 μ P k P j k + 1 ) ( ζ 3 ) j k + 1 Δ a Δ t , (5.3)

and

j = 1 m ( C j K ( ζ 4 ) j K C j 0 ( ζ 4 ) j 0 ) Δ a = k = 0 K 1 j = 1 m ( C j k ( ( ζ 4 ) j k + 1 ( ζ 4 ) j k ) Δ a + C j 1 k ( ( ζ 4 ) j k + 1 ( ζ 4 ) j 1 k + 1 ) ) Δ t k = 0 K 1 C m k ( ζ 4 ) m k + 1 Δ t + k = 0 K 1 ( ζ 4 ) 0 k + 1 β c ( C ( a j r + , t k ) ( a j r + a r ) + j = j r + j q C j k Δ a + C ( a j q , t k ) ( a q a j q ) ) Δ t + k = 0 K 1 j = 1 m ( d c C j k + 1 + μ P k P j k + 1 ) ( ζ 4 ) j k + 1 Δ a Δ t . (5.4)

Using the above fact and following a similar argument to that used in the proof of Lemma 16.9 on page 280 of [18] , it can be shown that the limit of the difference approximations in Theorem 5.1 is a weak solution to the problem (2.1) by letting m , K . The bounds are obtained by taking the limit in the bounds of the difference approximations in Lemmas 4.1 and 4.2.

Remark 1 Uniqueness of the weak solution to the model (2.1) follows from similar arguments to those used in [13] . Thus, from Theorems 5.1 and 5.2 and the uniqueness of the weak solution, we have that the finite difference approximation (3.1) converges to the unique weak solution of system (2.1) in the sense given in Theorem 5.1.

6. Numerical Results

In order to check our code and confirm first order convergence, we chose a set of functions as an exact solution set and then added terms in order to ensure that they did indeed form a solution. To be more precise, we chose the solution set (6.1) and substituted it into (6.2) and then solved for the forcing functions f i , i = 1 , 2 , , 5 .

S ( a , t ) = e a + t , I ( a , t ) = e a t , P ( a , t ) = e a t 2 C ( a , t ) = e 2 a t , V ( t ) = e t (6.1)

S ( a , t ) t + S ( a , t ) a = ( d s + α V ( t ) ) S ( a , t ) + f 1 ( a , t ) , 0 < t < T , 0 < a < a d , I ( a , t ) t + I ( a , t ) a = ( d i + δ ) I ( a , t ) + α V ( t ) S ( a , t ) + f 2 ( a , t ) , 0 < t < T , 0 < a < a d , P ( a , t ) t + P ( a , t ) a = d p P ( a , t ) + δ I ( a , t ) μ ( N p ) P ( a , t ) + f 3 ( a , t ) , 0 < t < T , 0 < a < a d ,

C ( a , t ) t + C ( a , t ) a = d c C ( a , t ) + μ ( N p ) P ( a , t ) + f 4 ( a , t ) , 0 < t < T , 0 < a < a d , d V ( t ) d t = Λ d v ( V ) V ( t ) + n d i 0 a d I ( a , t ) d a + f 5 ( a , t ) , 0 < t < T , (6.2)

It is easily verified that this results in

f 1 ( a , t ) = e a + t ( 2 + d s ) + α e a f 2 ( a , t ) = e a t ( d i + δ ) α e a f 3 ( a , t ) = e a t 2 [ 1 2 t + d p + μ ( N p ( t ) ) ] δ e a t f 4 ( a , t ) = e 2 a t ( 1 + d c ) μ ( N p ( t ) ) e a t 2 f 5 ( a , t ) = e t ( d v ( V ( t ) ) 1 ) Λ n d i N i ( t ) , (6.3)

where

N p ( t ) = 0 a d P ( a , t ) d a = e a d t 2 e t 2

and

N i ( t ) = 0 a d I ( a , t ) d a = e a d t e t .

Upon inspecting the boundary conditions, we see that once a r , a q , a c , and a l are chosen, the parameters β 0 and β c must satisfy

β 0 = 1 e a q e a r and β c = 2 e 2 a l e 2 a c . (6.4)

The parameter values, except for β 0 and β c , were taken from [7] and are given in Table 1. The values of β 0 and β c that are implied by (6.4) are also provided there.

We ran five simulations, with the step sizes Δ t and Δ a being halved each time. Once simulations were done, we calculated the following error

N s N s Δ t = max 0 j m | N s ( t j ) N s Δ t ( j ) | ,

where N s Δ t ( j ) is the numerical approximation of N s at t j with step size Δ t . This error was also calculated for the other components of the model, i.e., N i , N p , N c , and V. Finally, we calculated log2 of the ratios of consecutive errors in order to determine the order of accuracy. The results in Table 2 and Table 3 demonstrate that the method is achieving first-order accuracy.

7. Simulations of Treatment

In this section we present numerical simulations of treatment with specific drugs. We follow the approach taken in [2] , but present more details. As we are interested in arresting the further development of unchecked levels of cancerous and precancerous cells, we chose the parameter values for case (iv) in [7] . Since the precancerous and cancerous cell populations grow without bound in this case, the model’s behavior corresponds to dysplasia and the onset of metastasis. The base parameters are given in Table 4.

Table 1. Parameter values for error simulations.

Table 2. Convergence of the first-order method.

Table 3. Convergence of the first-order method.

Table 4. Parameter values for error simulations.

The initial conditions used were S 0 ( a ) = 2 exp a , V 0 = 0 , I 0 ( a ) = P 0 ( a ) = C 0 ( a ) = 0 .

One approach to treatment would be to increase the death rate ( d i ) of HPV-infected cells, thereby indirectly reducing the potential precancerous cell population. There are antiviral treatments such as Cidovofir that could facilitate this outcome, as noted in [2] [21] [22] . In order to numerically experiment with this scenario, we performed a simulation with the parameters given in Table 4, and then compared it to simulations in which this parameter is increase by 10%, 25%, and 50%. The results of these simulations are presented in Figure 1.

For this parameter set, the model is not particularly sensitive to the parameter d i . Indeed, an increase in the parameter d i by 50% does not reduce the precancerous and cancerous cell counts by 50%.

Another approach to treatment would be to increase the death rate of precancerous cells ( d p ). It was noted in [2] that the drugs 5-fluorouracil and bleomycin have shown success in this respect [23] . After experimenting with the parameter d p , we found that the model was quite sensitive to this parameter. Small percent changes cause large changes in model input. We settled on presenting the output resulting from the increasing d p by 3%, 5%, and 10%. The results are shown in Figure 2.

According to the model, this approach is vastly more efficient than the one of increasing the death rate of HPV-infected cells. Treatments of this type appear to have the ability to reduce unbounded precancerous and cancerous cell populations to stable ones that are more easily controlled.

There are, of course, other parameters in the model with which one can experiment. Here we have decided to focus on the two that can be affected by drugs which are currently available.

Figure 1. Model sensitivity to the parameter d i .

Figure 2. Model sensitivity to the parameter d p .

8. Conclusions

In this work, we have expanded on previous mathematical analyses of HPV-induced cervical cancer [2] [7] [8] [9] . We present a more general model in the sense that the transition rate μ of precancerous cells to cancerous cells can be any continuously differentiable function that satisfies 0 < μ 1 . We also allow for any initial conditions that are of bounded variation on the domain [ 0, a d ] .

After presenting a first-order finite difference scheme for approximating solutions, we use said schemed to provide an existence-uniqueness result for the generalized model. Further, we provide numerical evidence that our numerical scheme is indeed of first-order.

Once the numerical scheme was implemented, we utilized it along with ideas from [2] [7] in order to examine treatment strategies that can be implemented with existing medications. More specifically, we examined the model’s sensitivity to increasing the death rates of HPV-infected cells ( d i ) and precancerous cells ( d p ). Of those two approaches, the model predicts that using drugs that increase the death rate of precancerous cells is the far more efficient treatment.

Further work on this subject may include applying our numerical scheme to the recently developed model in [9] .

Conflicts of Interest

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

References

[1] Burd, E.M. (2003) Human Papillomavirus and Cerivcal Cancer. Clinical Microbiology Reviews, 16, 1-17.
https://doi.org/10.1128/CMR.16.1.1-17.2003
[2] Asih, T.S.N., Lenhart, S., Wise, S., Aryati, L., Adi-Kusumo, F., Hardianti, M.S. and Forde, J. (2016) The Dynamics of HPV Infection and Cervical Cancer Cells. Bulletin of Mathematical Biology, 78, 4-20.
https://doi.org/10.1007/s11538-015-0124-2
[3] Barnabas, R.V., Laukkanen, P., Koskela, P., Kontula, O., Lehtinen, M. and Garnett, G.P. (2006) Epidemiology of HPV 16 and Cervical Cancer in Finlandand the Potential Impact of Vaccination: Mathematical Modelling and Analyses. PLOS Medicine, 3, e138.
https://doi.org/10.1371/journal.pmed.0030138
[4] Baussano, I., Ronco, G., Segnan, N., French, K., Vineis, P. and Garnett, G.P. (2010) HPV-16 Infection and Cervical Cancer: Modeling the Influence of Duration of Infection and Precancerous Lesions. Epidemics, 2, 21-28.
https://doi.org/10.1016/j.epidem.2010.02.002
[5] Brown, V.L. and Jane White, K.A. (2011) The Role of Optimal Control in Assessing the Most Cost-Effective Implementation of a Vaccination Programme: HPV as a Case Study. Mathematical Biosciences, 231, 126-134.
https://doi.org/10.1016/j.mbs.2011.02.009
[6] Lee, S.L. and Tameru, A.M. (2012) A Mathematical Model of Human Papillomavirus (HPV) in the United States and Its Impact on Cervical Cancer. Journal of Cancer, 3, 262-268.
https://doi.org/10.7150/jca.4161
[7] Akimeko, V.V. and Adi-Kusumo, F. (2021) Stability Analysis of an Age-Structured Model of Cervical Cancer Cells and HPV Dynamics. Mathematical Biosciences and Engineering, 18, 6155-6177.
https://doi.org/10.3934/mbe.2021308
[8] Aryati, L., Noor-Asih, T.S., Adi-Kusumo, F. and Hardianti, M.S. (2018) Global Stability of the Disease Free Equilibrium in a Cervical Cancer Model: A Chance to Recover. Far East Journal of Mathematical Sciences, 103, 1535-1546.
https://doi.org/10.17654/MS103101535
[9] Sari, E.R., Adi-Kusumo, F. and Aryati, L. (2022) Mathematical Analysis of a SIPC Age-Structured Model of Cervical Cancer. Mathematical Biosciences and Engineering, 19, 6013-6039.
https://doi.org/10.3934/mbe.2022281
[10] Woodman, C.B.J., Collins, S.I. and Young, L.S. (2007) The Natural History of Cervical HPV Infection: Unresolved Issues. Nature Reviews Cancer, 7, 11-22.
https://doi.org/10.1038/nrc2050
[11] Ackleh, A.S. and Deng, K. (2003) On a First-Order Hyperbolic Coagulation Model, Mathematical Methods in the Applied Sciences, 26, 703-715.
https://doi.org/10.1002/mma.395
[12] Ackleh, A.S., Deng, K. and Huang, Q. (2010) Existence-Uniqueness Results and Difference Approximations for an Amphibian Juvenile-Adult Model. Contemporary Mathematics, 513, 1-23.
[13] Ackleh, A.S., Deng, K., Ito, K. and Thibodeaux, J.J. (2006) A Structured Erythropoiesis Model with Nonlinear Cell Maturation Velocity and Hormone Decay Rate. Mathematical Biosciences, 204, 21-48.
https://doi.org/10.1016/j.mbs.2006.08.004
[14] Banks, H.T., Cole, C.E., Schlosser, P.M. and Tran, H.T. (2004) Modeling and Optimal Regulation of Erythropoiesis Subject to Benzene Intoxication. Mathematical Biosciences & Engineering, 1, 15-48.
https://doi.org/10.3934/mbe.2004.1.15
[15] Edelstein, L. (1982) The Propagation of Fungal Colonies: A Model for Tissue Growth. Journal of Theoretical Biology, 98, 679-701.
https://doi.org/10.1016/0022-5193(82)90146-1
[16] Ackleh, A.S. and Ito, K. (1997) An Implicit Finite Difference Scheme for the Nonlinear Size-Structured Population Model. Numerical Functional Analysis and Optimization, 18, 865-884.
https://doi.org/10.1080/01630569708816798
[17] Angulo, O. and López-Marcos, J.C. (2004) Numerical Integration of Fully Nonlinear Size-Structured Population Models. Applied Numerical Mathematics, 50, 291-327.
https://doi.org/10.1016/j.apnum.2004.01.007
[18] Smoller, J. (1994) Shock Waves and Reaction-Diffusion Equations. Springer-Verlag, New York.
https://doi.org/10.1007/978-1-4612-0873-0
[19] Crandall, M.G. and Majda, A. (1980) Monotone Difference Approximations for Scalar Conservation Laws. Mathematics of Computation, 34, 1-21.
https://doi.org/10.1090/S0025-5718-1980-0551288-3
[20] Reed, M. and Simon, B. (1980) Methods of Modern Mathematical Physis I: Functional Analysis. Academic Press, New York.
[21] Abdulkarim, B., Sabri, S., Deutsch, E., Chagraoui, H., Maggiorella, L., Thierry, J., Eschwege, F., Vainchenker, W., Chouaïb, S. and Bourhis, J. (2002) Antiviral Agent Cidofovir Restores P53 Function and Enhances the Radiosensitivity in HPV-Associated Cancers. Oncogene, 21, 2334-2346.
https://doi.org/10.1038/sj.onc.1205006
[22] Hostetler, K.Y., Rought, S., Aldern, K.A., Trahan, J., Beadle, J.R. and Corbeil, J. (2006) Enhanced Antiproliferative Effects of Alkoxyakyl Esters of Cidofovir in Human Cervical Cancer Cells in Vitro. Molecular Cancer Therapeutics, 5, 156-159.
https://doi.org/10.1158/1535-7163.MCT-05-0200
[23] Smoke, T. and Smoking, I. (2004) IARC Mongraphs on the Evaluation of Carcinogenic Risk to Humans. IARC Press, Lyon.

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.