Return to Article Details An Ushijima-type analysis for the numerical blow-up of a fractional reaction-diffusion equation

An Ushijima-Type Analysis for the Numerical Blow-up of a Fractional Reaction-Diffusion EquationThanks: Université Nangui Abrogoua, Abidjan, Côte d’Ivoire, e-mail: yekreben@gmail.com (Corresponding author), ORCID: 0009-0008-7508-3644 [Uncaptioned image].Thanks: Université Nangui Abrogoua, Abidjan, Côte d’Ivoire, e-mail: kra.amaniyeh@gmail.com, ORCID: 0009-0007-4693-2814 [Uncaptioned image].Thanks: Université Nangui Abrogoua, Abidjan, Côte d’Ivoire, e-mail: halimanachid@yahoo.fr, ORCID: 0000-0003-1244-8139 [Uncaptioned image].

Yékré Benjamin-Dieudonné , Kra Amani N’da Rodrigue and Halima Nachid
Date: December 30, 2025; accepted: April 15, 2026; published online: May 05, 2026.
Abstract.

This paper studies the blow-up phenomenon for a nonlinear reaction-diffusion equation with a Caputo fractional time derivative. Our work has two main parts. First, we prove that the solution of the semi-discretized system blows up in a finite time Th if the initial data is large enough. Second, we analyze the full discretization using the explicit L1 scheme. By introducing a discrete weighted functional and comparing it to an auxiliary sequence, we show that the numerical solution also blows up in finite time, provided we use an adaptive time-stepping strategy. The main contribution of this work is to show that our lemmas provide the necessary tools to apply Ushijima’s theoretical framework to this class of fractional problems. This builds a bridge between Ushijima’s theory and non-local fractional schemes. We can then conclude that the numerical blow-up time converges to the semi-discrete one, which validates the ability of the scheme to capture the singularity dynamics.

Key words and phrases: 
Fractional reaction-diffusion equation, Numerical blow-up, L1 scheme, Ushijima framework, blow-up time convergence, Caputo derivative, adaptive time-stepping.
2020 Mathematics Subject Classification
26A33, 35R11, 35B44, 65M06, 65M12, 65M15

1. Introduction

The numerical capture of finite-time blow-up in nonlinear reaction-diffusion equations is a major challenge in modern numerical analysis. The problem is not only to show that the numerical solution grows to infinity, but to ensure that the numerical blow-up time converges to the continuous one. For classical parabolic equations, this is well understood. However, time-fractional derivatives of Caputo type change the situation: they introduce a non-local memory effect that makes standard analysis methods difficult to use.

Following the work of Ushijima [22], a strict methodology was created to prove the convergence of blow-up time for local parabolic equations. More recently, Wang et al. [24] studied the L1 scheme for fractional ordinary differential equations (FODE). However, there is still a gap for fractional partial differential equations (FPDE), where we must manage both the temporal non-locality and the spatial diffusion operator. The Ushijima framework was not designed for memory operators, and the approach by Wang does not include the complex interactions caused by the Laplacian.

This work aims to fill this gap by studying the following fractional reaction-diffusion equation (S):

(1) {DβtC⁢u⁢(x,t)=D⁢ux⁢x⁢(x,t)+up⁢(x,t),for ⁢(x,t)∈(0,1)×(0,T],u⁡(x,0)=u0⁢(x),for ⁢x∈[0,1],u⁡(0,t)=u⁡(1,t)=0,for ⁢t∈(0,T],

where β∈(0,1) and p>1. Our study focuses on solving three main difficulties:

First, we establish the blow-up proof for the semi-discretized system. The challenge is to maintain positivity and growth while considering both the discrete Laplacian and the Caputo memory. We solve this by using a fractional extremum principle combined with weighted functionals.

Second, we deal with the complexity of the full discretization using the explicit L1 scheme. Managing non-locality on an adaptive time mesh which is necessary to approach the singularity makes the analysis of memory weights very difficult. Our solution is based on constructing an auxiliary comparison sequence and using a discrete Jensen inequality. This guarantees the existence of numerical blow-up where standard uniform mesh analysis often fails.

Finally, and this is our most important contribution, we demonstrate that this numerical blow-up satisfies the critical condition A0 of the Ushijima framework. Unlike previous studies that only observe the blow-up, we build an original theoretical bridge between Ushijima’s theory and non-local fractional schemes. By validating this connection, we do more than just simulate a singularity; we create the foundation to prove, in future work, the rigorous convergence of the numerical blow-up time. This confirms that our scheme captures the true essence of the singular dynamics.

2. Semi-discretization and blow-up

We begin by discretising problem (1) in space only. Let I be a positive integer, h=1/I the spatial step size, and xi=i⁢h for i=0,…,I. Let Ui⁢(t) be an approximation of u⁡(xi,t). By replacing the second spatial derivative with a centred finite difference, we obtain the system of fractional ordinary differential equations (FODE):

(2) DβtC⁢Ui⁢(t) =D⁢δ2⁢Ui⁢(t)+[Ui⁢(t)]p, i=1,…,I−1,
(3) U0⁢(t) =UI⁢(t)=0, t≥0,
(4) Ui⁢(0) =u0⁢(xi), i=0,…,I,

where δ2 is the discrete Laplacian operator: δ2⁢Ui⁢(t)=(Ui+1⁢(t)−2⁢Ui⁢(t)+Ui−1⁢(t))/h2.

The analysis of this system is based on the associated eigenvalue problem δ2⁢(Φk,i)=−λk,h⁢Φk,i with zero Dirichlet boundary conditions. The eigenvalues and eigenvectors are well known:

(5) λk,h =2⁢(1−cos⁡(k⁢π⁢h))h2,k=1,…,I−1,
(6) Φk,i =sin(kiπh),i=0,…,I.

The first eigenvector Φ1, associated with the first eigenvalue λ1,h, has components Φ1,i=sin⁡(i⁢π⁢h) that are strictly positive for i=1,…,I−1.

2.1. Blow-up of the Semi-Discrete Solution

To study the behavior of the solution Ui⁢(t), we introduce a weighted functional.

Definition .

The weighted functional JΦ,h⁢(t) is defined by:

JΦ,h⁢(t)=h⁢∑j=1I−1Uj⁢(t)⁢Φ1,j.

The initial condition u0⁢(x) is chosen such that JΦ,h⁢(0)>0.

Our analysis is based on the following results.

Lemma (Non-negativity of the solution).

Let Ui⁢(t) be the solution of the system (2)–(4) with u0⁢(x)≥0 and u0≢0. Then, Ui⁢(t)>0 for all i∈{1,…,I−1} and for all t∈(0,Tm⁢a⁢x), where Tm⁢a⁢x is the maximum existence time.

Proof.

Suppose that there exists a first time t0>0 and an index k0∈{1,…,I−1} such that Uk0⁢(t0)=0 and Ui⁢(t)≥0 for all i and t∈[0,t0]. Since Uk0⁢(t0)=0 is a minimum for Uk0⁢(t) on the interval [0,t0], the extremum principle for the Caputo derivative (see [25], Theorem 3.2) implies:

(7) DβtC⁢Uk0⁢(t0)≤−Uk0⁢(0)Γ⁡(1−β)⁢t0β≤0.

On the other hand, from the governing equation (2) at t=t0, we have:

DβtC⁢Uk0⁢(t0)=D⁢Uk0−1⁢(t0)−2⁢Uk0⁢(t0)+Uk0+1⁢(t0)h2+[Uk0⁢(t0)]p.

Substituting Uk0⁢(t0)=0, we obtain:

DβtC⁢Uk0⁢(t0)=D⁢Uk0−1⁢(t0)+Uk0+1⁢(t0)h2≥0,

since Uk0±1⁢(t0)≥0. Comparing with (7), we must have DβtC⁢Uk0⁢(t0)=0, which implies Uk0±1⁢(t0)=0 and Uk0⁢(0)=0. By propagation to all neighbors, we find Ui⁢(0)=0 for all i, which contradicts the assumption u0≢0. Therefore, the assumption that the solution touches zero is false, and we conclude Ui⁢(t)>0 for all t∈(0,Tm⁢a⁢x). ∎

Lemma (Weighted Discrete Jensen’s Inequality).

Let ζ:ℝ→ℝ be a convex function. Let x1,…,xN∈ℝ and ω1,…,ωN be non-negative weights such that Sω=∑j=1Nωj>0. Then:

1Sω⁢∑j=1Nωj⁢ζ⁢(xj)≥ζ⁡(1Sω⁢∑j=1Nωj⁢xj).
Proposition .

The functional JΦ,h⁢(t) satisfies the following fractional differential inequality:

(8) DβtC⁢JΦ,h⁢(t)≥−D⁢λ1,h⁢JΦ,h⁢(t)+Kp,h⁢[JΦ,h⁢(t)]p,

where the constant Kp,h is defined by Kp,h=(h⁢∑j=1I−1Φ1,j)1−p.

Proof.

Applying the operator DβtC to JΦ,h⁢(t) and using equation (2), we have:

DβtC⁢JΦ,h⁢(t) =h⁢∑j=1I−1(DβtC⁢Uj⁢(t))⁢Φ1,j
=h⁢∑j=1I−1(D⁢δ2⁢Uj⁢(t)+[Uj⁢(t)]p)⁢Φ1,j
=D⁡(h⁢∑j=1I−1(δ2⁢Uj⁢(t))⁢Φ1,j)+h⁢∑j=1I−1[Uj⁢(t)]p⁢Φ1,j.

Using the symmetry property of δ2 and the fact that Φ1 is an eigenvector, the diffusion term becomes:

h⁢∑j=1I−1(δ2⁢Uj⁢(t))⁢Φ1,j =h⁢∑j=1I−1Uj⁢(t)⁢(δ2⁢Φ1,j)=−λ1,h⁢(h⁢∑j=1I−1Uj⁢(t)⁢Φ1,j)=−λ1,h⁢JΦ,h⁢(t).

For the nonlinear term, Section 2.1 guarantees that Uj⁢(t)≥0. The function ζ⁡(x)=xp is convex for x≥0 since p>1. We apply Section 2.1 with xj=Uj⁢(t) and ωj=Φ1,j>0. Let Sω=∑j=1I−1Φ1,j.

h⁢∑j=1I−1[Uj⁢(t)]p⁢Φ1,j =h⁢Sω⁢(1Sω⁢∑j=1I−1Φ1,j⁢[Uj⁢(t)]p)
≥h⁢Sω⁢(1Sω⁢∑j=1I−1Φ1,j⁢Uj⁢(t))p
=h⁢Sω⁢(∑Φ1,j⁢Uj⁢(t))p(Sω)p=h⁢(h⁢∑Φ1,j⁢Uj⁢(t))php⁢(Sω)p−1
=[JΦ,h⁢(t)]p(h⁢Sω)p−1=(h⁢∑j=1I−1Φ1,j)1−p⁢[JΦ,h⁢(t)]p.

Combining the two terms, we obtain the inequality (8). ∎

Theorem 1 (Blow-up of the Semi-Discrete Solution).

Assume p>1. If the initial condition u0⁢(x) is such that the weighted functional J⁢(0)≡JΦ,h⁢(0) satisfies:

(9) J⁡(0)>(D⁢λ1,hKp,h)1p−1≕Jcrit,

then the solution Ui⁢(t) of the semi-discrete system (2)–(4) blows up in finite time Th<∞. Moreover, the blow-up time satisfies the upper bound [15, Corollary 2]:

(10) Th≤[Γ⁡(β⁢pp−1)Γ⁡(βp−1)⁢(Kp,h⁢J⁢(0)p−1−D⁢λ1,h)]1/β<∞.
Proof.

By Section 2.1, the weighted functional J⁡(t) satisfies the fractional differential inequality:

(11) DβtC⁢J⁢(t)≥Kp,h⁢J⁢(t)p−D⁢λ1,h⁢J⁢(t)≕f⁡(J⁡(t)),

with initial condition J⁡(0)>Jcrit=(D⁢λ1,hKp,h)1p−1.

Since J⁡(t)≥J⁡(0)>Jcrit (by strict positivity of the fractional derivative when f⁡(J⁡(0))>0), and the function ϕ⁡(u)=Kp,h−D⁢λ1,h⁢u−(p−1) is increasing on [Jcrit,∞), we have for all t≥0:

(12) f⁡(J⁡(t))≥(Kp,h−D⁢λ1,h⁢J⁢(0)−(p−1))⁢J⁢(t)p=C∗⁢J⁢(t)p,

where C∗=Kp,h⁢J⁢(0)p−1−D⁢λ1,hJ⁢(0)p−1>0 by hypothesis on J⁡(0).

By the equivalence between the Caputo differential inequality and the Volterra integral formulation [4, Theorem 3.1], we obtain:

(13) J⁡(t)≥J⁡(0)+C∗Γ⁡(β)⁢∫0t(t−s)β−1⁢J⁢(s)p⁢𝑑s.

Consider the candidate subsolution y¯⁢(t)=J⁡(0)⁢(1−tT)−q defined on [0,T) with q=βp−1>0. This function satisfies y¯⁢(0)=J⁢(0) and limt→T−y¯⁢(t)=+∞.

For y¯ to be a subsolution of (13), it suffices that:

(14) y¯⁢(t)≤J⁡(0)+C∗Γ⁡(β)⁢∫0t(t−s)β−1⁢y¯⁢(s)p⁢𝑑s≕I⁡(t).

By the substitution s=t−(T−t)⁢σ and using p⁢q=β+q, one computes:

(15) ∫0t(t−s)β−1⁢(1−sT)−p⁢q⁢𝑑s=Tβ+q⁢(T−t)−q⁢B⁢(tT−t,β,q),

where B⁡(x,β,q)=∫0xσβ−1⁢(1+σ)−(β+q)⁢𝑑σ is the incomplete Beta function [4, Chapter 6].

As t→T−, B⁡(x,β,q)→Γ⁡(β)⁢Γ⁢(q)Γ⁡(β+q), so the dominant behavior of I⁡(t) near T is:

(16) I⁡(t)∼J⁡(0)+C∗⁢J⁢(0)p⁢Γ⁢(q)Γ⁡(β+q)⁢Tβ+q⁢(T−t)−q.

The constant J⁡(0) is negligible compared to the diverging term (T−t)−q.

Matching the dominant coefficients of (T−t)−q in y¯⁢(t)≤I⁢(t) gives:

1≤(Kp,h⁢J⁢(0)p−1−D⁢λ1,h)⁢Γ⁡(q)Γ⁡(β+q)⁢Tβ.

Since β+q=β⁢pp−1, the sufficient condition is:

(17) T≥[Γ⁡(β⁢pp−1)Γ⁡(βp−1)⁢(Kp,h⁢J⁢(0)p−1−D⁢λ1,h)]1/β≕Tmax.

For any T≥Tmax, the function y¯ is a subsolution of the integral equation (13). By the comparison principle for nonlinear Volterra equations [15, Corollary 2], J⁢(t)≥y¯⁢(t) for all t∈[0,T).

Since y¯⁢(t)→+∞ as t→T−, the solution J⁡(t) must blow up at a time Th satisfying:

(18) Th≤Tmax=[Γ⁡(β⁢pp−1)Γ⁡(βp−1)⁢(Kp,h⁢J⁢(0)p−1−D⁢λ1,h)]1/β<∞.

Since J⁢(t)≥y¯⁢(t) for all t on the interval [Jcrit,∞), the blow-up of J⁡(t) in finite time Th implies, by equivalence of norms in ℝI−1 (since the components Φ1,i are strictly positive), that ‖U⁡(t)‖∞→+∞ as t→Th−. ∎

Lemma (Lower Blow-up Rate for J⁡(t)).

Let J∈AC[0,Th) be the solution of the fractional differential inequality (8) with initial condition J⁡(0)>Jcrit. Then the blow-up time Th is finite and the following properties hold:

  1. (i)
    (19) lim inft→Th−(Th−t)βp−1⁢J⁢(t)≥CJ,h−:=(Γ⁡(p⁢βp−1)12⁢Kp,h⁢Γ⁢(βp−1))1p−1>0.
  2. (ii)

    There exists a constant c1>0 such that for all t∈[Th/2,Th):

    (20) J⁡(t)≥c1⁢(Th−t)−βp−1.
Proof.

Since J⁡(t)→+∞ as t→Th−, there exists a time t1∈[0,Th) such that for all t≥t1, the solution exceeds the threshold J⁡(t)≥(2⁢D⁢λ1,hKp,h)1p−1, which implies:

(21) Kp,h⁢J⁢(t)p−D⁢λ1,h⁢J⁢(t)≥12⁢Kp,h⁢J⁢(t)p,∀t∈[t1,Th).

Let Y⁡(t) be the maximal solution of the pure fractional Bernoulli equation:

(22) DβtC⁢Y⁢(t)=12⁢Kp,h⁢[Y⁡(t)]p,t>t1,Y⁡(t1)=J⁡(t1).

By the comparison principle for Caputo fractional derivatives [15], we have J⁡(t)≥Y⁡(t) for all t∈[t1,min⁡(Th,TY)).

Equation (22) is equivalent to the nonlinear Volterra integral equation Y⁡(t)=Y⁡(t1)+Kp,h2⁢Γ⁢(β)⁢∫t1t(t−s)β−1⁢Y⁢(s)p⁢𝑑s. From [17], Y⁡(t) blows up at TY≤Th with the exact asymptotic rate:

(23) limt→TY−(TY−t)βp−1⁢Y⁢(t)=(Γ⁡(p⁢βp−1)12⁢Kp,h⁢Γ⁢(βp−1))1p−1=CJ,h−.

This constant results from the dominant balance Y⁡(t)∼C⁢(TY−t)−q and the Beta function identity ∫0∞(1−x)β−1⁢x−p⁢q⁢𝑑x=Γ⁡(β)⁢Γ⁢(q)Γ⁡(p⁢q).

Since J⁡(t)≥Y⁡(t) on [t1,Th), the blow-up of Y at TY implies that J cannot exist beyond Th≤TY. Conversely, the blow-up of J at Th forces TY=Th. Consequently:

(24) lim inft→Th−(Th−t)βp−1⁢J⁢(t)≥limt→Th−(Th−t)βp−1⁢Y⁢(t)=CJ,h−.

Consider the rescaled function ϕ⁡(t)=(Th−t)βp−1⁢J⁢(t), which is continuous on [Th/2,Th). From the asymptotic result in (i), lim inft→Th−ϕ⁡(t)≥CJ,h−>0. By the definition of the limit, for ϵ=12⁢CJ,h−, there exists δ∈(0,Th/2] such that:

ϕ(t)≥CJ,h−−ϵ=12CJ,h−,∀t∈[Th−δ,Th).

On the compact interval [Th/2,Th−δ], the function ϕ is continuous and strictly positive. It attains a minimum c2=mint∈[Th/2,Th−δ]⁡ϕ⁡(t)>0. Taking c1=min⁡{c2,12⁢CJ,h−}>0, we obtain:

J⁡(t)≥c1⁢(Th−t)−βp−1,∀t∈[Th/2,Th),

which completes the proof. ∎

3. Full Discretisation and Numerical Analysis

3.1. Explicit L1 Scheme

We now discretise the semi-discrete system (2) in time using the explicit L1 scheme. Let us consider a time mesh 0=t0<t1<⋯<tNs⁢t⁢e⁢p⁢s=Tf⁢i⁢n⁢a⁢l, with Δ⁢tk=tk+1−tk. Let Vin≈Ui⁢(tn). The scheme is written as:

(25) Vin+1=∑k=0ncn,k⁢Vik+τnβ⁢(D⁢δ2⁢Vin+[Vin]p),

for n≥0 and i=1,…,I−1, with V0n=VIn=0. The coefficients are defined by τnβ=(Δ⁢tn)β⁢Γ⁢(2−β) and

(26) cn,k =γn,k−γn,k−1γn,n,with ⁢γn,−1=0,
(27) γn,k =1Δ⁢tk⁢Γ⁢(2−β)⁢[(tn+1−tk)1−β−(tn+1−tk+1)1−β].

An important property is that, under standard conditions on the mesh, the coefficients cn,k are non-negative and ∑k=0ncn,k=1.

3.2. Analysis via an Auxiliary Difference Inequality

We follow a similar approach to the semi-discrete case.

Definition .

The weighted discrete functional at time tn is defined by:

JΦ,hn=h⁢∑i=1I−1Vin⁢Φ1,i.
Lemma .

Let Vi0≥0 and V0n=VIn=0 for all n>0. Suppose that the time step satisfies:

(28) cn,n−2⁢D⁢τnβh2≥0,for all ⁢n≥0.

Then, the numerical solution Vin remains non-negative.

Proof.

We adopt an approach similar to that of Chen and Stynes [3]. Suppose that there exists i0∈{1,…,I−1} such that tn¯ is the smallest for which Vin¯<0. This implies that Vik¯≥0 for i∈{0,…,I} with k<n¯. Let Vi¯n¯ be the minimum value of Vin for i∈{1,…,I−1}. Therefore, Vi¯n¯<0 and Vi¯n¯<Vj¯n¯ for all j. Since V0n¯=VIn¯=0, we have 1≤i¯≤I−1. Equation (25) at point (x¯i,t¯n) can then be written as

(29) Vi¯n¯ =∑k=0n¯−1cn¯−1,k⁢Vi¯k+τn¯−1β⁢(D⁢Vi¯+1n¯−1−2⁢Vi¯n¯−1+Vi¯−1n¯−1h2+(Vi¯n¯−1)p)
(30) Vin¯ =(cn¯−1,n¯−1−2⁢D⁢τn¯−1βh2)⁢Vin¯−1+D⁢τn¯−1βh2⁢(Vi+1n¯−1+Vi−1n¯−1)
+τn¯−1β⁢(Vin¯−1)p+∑k=0n¯−2cn¯−1,k⁢Vik.

We also know that Vjk≥0 for all j and k≤n¯−1 by definition of n¯, and according to hypothesis (28), we can conclude that Vi¯n¯≥0. This contradicts the hypothesis that Vi¯n¯<0. Therefore, Vin≥0 for all n≥0 and i=0⁢…⁢I. ∎

Assuming that Section 3.2 is satisfied, we can multiply scheme (25) by h⁢Φ1,i, sum over i, and apply Jensen’s inequality Section 2.1). This gives the difference inequality:

(31) JΦ,hn+1≥∑k=0ncn,k⁢JΦ,hk+τnβ⁢(C0,h⁢JΦ,hn+Kp,h⁢[JΦ,hn]p),

where C0,h=−D⁢λ1,h. This inequality motivates us to study the auxiliary sequence Zn defined by the equation:

(32) Zn+1=∑k=0ncn,k⁢Zk+τnβ⁢f⁢(Zn),with ⁢f⁢(Z)=C0,h⁢Z+Kp,h⁢Zp,

and Z0=JΦ,h0.

Remark .

Condition (28) constitutes a fractional CFL-type stability criterion. Since the coefficient cn,n scales with Δ⁢t−β, this inequality implies a restrictive time step bound Δ⁢t≤C⁢h2/β. In the strong memory regime (e.g., β=0.4), the requirement Δ⁢t∝h5 becomes extremely severe, providing a mathematical explanation for the numerical instabilities observed when this bound is not strictly satisfied.

3.3. Consistency of the Explicit Scheme

This section is devoted to the numerical analysis of the explicit L1 scheme for problem (1). We first establish the consistency error and then prove the local convergence of the scheme towards the semi-discrete solution. Let Ui⁢(t) be the solution of the semi-discrete system (2). We assume U∈C2⁢([0,Th),C4⁢([0,1])). For any fixed time T<Th, we define the truncation error ℛin+1 at the point (xi,tn+1) by:

(33) ℛin+1=Ui⁢(tn+1)−∑k=0ncn,k⁢Ui⁢(tk)τnβ−(D⁢δ2⁢Ui⁢(tn)+[Ui⁢(tn)]p).
Lemma (Consistency Bound).

For a fixed time interval [0,T] where the solution U is bounded by MT, and assuming Δ⁢t<1, there exists a constant C⁡(MT)>0 such that the truncation error satisfies:

(34) ‖ℛn+1‖∞≤C⁡(MT)⁢(Δ⁢t+h2).
Proof.

The truncation error is decomposed into three components:

  1. (i)

    Following [19], the L1 approximation of the Caputo derivative at tn+1 satisfies:

    (35) |DβtC⁢Ui⁢(tn+1)−1τnβ⁢(Ui⁢(tn+1)−∑k=0ncn,k⁢Ui⁢(tk))|≤Cβ⁢maxt∈[0,T]⁢‖∂t2U⁡(t)‖∞⁢Δ⁢t 2−β.

    where Cβ=1Γ⁡(2−β)⁢[(1−β)12+22−β2−β]. Since U∈C2⁢([0,T]), this term is 𝒪⁡(Δ⁢t2−β).

  2. (ii)

    The centered finite difference for the Laplacian satisfies:

    (36) |Ux⁢x⁢(xi,tn)−δ2⁢Ui⁢(tn)|≤h212⁢‖∂x4U‖L∞⁢([0,T]).
  3. (iii)

    Since the scheme evaluates the reaction term at tn instead of tn+1, the Mean Value Theorem yields:

    (37) |Ui⁢(tn+1)p−Ui⁢(tn)p|≤(p⋅supξ∈[tn,tn+1]‖U⁡(ξ)‖∞p−1⋅‖∂Ui∂t⁢(ξ)‖∞)⁢|tn+1−tn|

    since U∈C2⁢([0,T]) there exists C~ such that

    (38) |Ui⁢(tn+1)p−Ui⁢(tn)p|≤p⁢C~⁢MTp−1⁢Δ⁢t.

Summing these components, we obtain:

‖ℛn+1‖∞≤C1⁢Δ⁢t2−β+C2⁢Δ⁢t+C3⁢h2

where C1=Cβ⁢‖∂t2U‖L∞⁢([0,T]), C2=p⁢C~⁢MTp−1 and C3=112⁢‖∂x4U‖L∞⁢([0,T]).

Since 0<β<1, we have 2−β>1 and Δ⁢t2−β≤Δ⁢t. By taking C⁡(MT)=max⁡(C1+C2,C3), we obtain the desired bound:

‖ℛn+1‖∞≤C⁡(MT)⁢(Δ⁢t+h2).

∎

3.4. Local Convergence Theorem

To satisfy the prerequisite A1’ of the Ushijima framework, we establish that the explicit L1 scheme converges to the semi-discrete solution on any compact interval where the latter remains bounded.

Theorem 2 (Local Convergence).

Let T<Th be a fixed time and MT=maxt∈[0,T]⁡‖U⁡(t)‖∞. Suppose the fractional stability condition (28) holds. There exist constants δT>0 and CT>0 such that if Δ⁢t+h2≤δT, the numerical error ein=Ui⁢(tn)−Vin satisfies:

(39) maxtn≤T⁡‖en‖∞≤CT⁢(Δ⁢t+h2).

The constant CT depends on MT and T through the local Lipschitz constant Lp=p⁢(MT+1)p−1.

Proof.

We use a bootstrap argument. Let η=1 be a fixed threshold. We assume by induction that for all k≤n, ‖ek‖∞≤η. This implies ‖Vk‖∞≤MT+η. On this bounded domain, the reaction term f⁡(u)=up is Lipschitz continuous with constant Lp=p⁢(MT+1)p−1.

Since we are interested in the convergence as the discretization parameters vanish, we assume without loss of generality that Δ⁢t<1. Thus, according to Section 3.3, ‖ℛn+1‖∞≤C⁡(MT)⁢(Δ⁢t+h2). Subtracting the scheme (25) from the consistency identity, the error evolution equation is:

(40) ein+1 =(cn,n−2⁢D⁢τnβh2)⁢ein+D⁢τnβh2⁢(ei+1n+ei−1n)+∑k=0n−1cn,k⁢eik
+τnβ⁢([Ui⁢(tn)]p−[Vin]p)+τnβ⁢ℛin+1.

Under the stability condition (28), all coefficients cn,k and (cn,n−2⁢D⁢τnβh2) are non-negative. Recalling that ∑k=0ncn,k=1, we apply the triangle inequality and the Lipschitz property |f⁡(U)−f⁡(V)|≤Lp⁢|e| to the maximum norm:

(41) ‖en+1‖∞ ≤(1+τnβ⁢Lp)⁢max0≤k≤n⁢‖ek‖∞+τnβ⁢‖ℛn+1‖∞.

We now invoke the discrete fractional Grönwall inequality [19, Lemma 3.2]. For a sequence satisfying (41), the accumulated error is bounded by:

(42) ‖en+1‖∞≤exp⁡(Lp⁢(tn+1)βΓ⁡(1+β))⁢(‖e0‖∞+max⁡∑j=0k0≤k≤n⁡wk,j⁢τjβ⁢‖ℛj+1‖∞),

where wk,j are the L1-weight coefficients. Given e0=0 and using the consistency bound:

(43) ‖en+1‖∞≤[C⁢exp⁡(Lp⁢TβΓ⁡(1+β))⁢C⁢(MT)]⏟CT⁢(Δ⁢t+h2).

Finally, for sufficiently small Δ⁢t and h such that CT⁢(Δ⁢t+h2)≤η, the inductive hypothesis ‖en+1‖∞≤1 is satisfied. This completes the proof. ∎

Remark .

The exponential dependence of CT on MTp−1 reflects the critical nature of the blow-up singularity. As T→Th−, the required resolution δT vanishes, necessitating the adaptive time-stepping strategy discussed in the subsequent sections to maintain numerical stability.

4. Blow-up analysis (fully discrete)

4.1. Auxiliary Suite Blow-up

We analyse the blow-up of the auxiliary sequence Zn under the following set of assumptions.

Assumption (Blow-up conditions).
  1. (H1)

    The initial condition satisfies

    Z0>Zcrit≔(−C0,hKp,h)1/(p−1).
  2. (H2)

    There exist constants α∈(0,1] and CΔ⁢t>0 such that

    (44) Δtn≤CΔ⁢t(Zn)−α(p−1)/β.
Lemma (Fundamental properties and monotonicity of Zn).

Under Section 4.1:

  1. (a)

    The sequence {Zn}n≥0 is strictly increasing.

  2. (b)

    limn→∞Zn=∞.

  3. (c)

    limn→∞τnβ=0 and limn→∞Δ⁢tn=0.

Proof.

(a) For n=0 we have Z1=Z0+τ0β⁢f⁢(Z0)>Z0 because f⁡(Z0)>0 by (H1). Assume Z0<⋯<ZN+1. Rewrite the L1 scheme as ∑k=0mγm,k⁢(Zk+1−Zk)=f⁡(Zm). Then

γN+1,N+1⁢(ZN+2−ZN+1) =f⁡(ZN+1)−∑k=0NγN+1,k⁢(Zk+1−Zk)
≥f⁡(ZN)−∑k=0NγN+1,k⁢(Zk+1−Zk)
=∑k=0N(γN,k−γN+1,k)⁢(Zk+1−Zk)>0,

since γN,k>γN+1,k and the increments are positive by the induction hypothesis. Hence ZN+2>ZN+1.

(b) Suppose limn→∞Zn=Z∗<∞. Then Z∗>Zcrit and f⁡(Z∗)>0. From (H2) we obtain τnβ≤Γ⁡(2−β)⁢CΔ⁢tβ⁢(Zn)−α⁡(p−1)→τ∗≥0. Passing to the limit in (32) yields Z∗=Z∗+τ∗⁢f⁢(Z∗), which implies τ∗=0. This contradicts τ∗≥Γ⁡(2−β)⁢CΔ⁢tβ⁢(Z∗)−α⁡(p−1)>0.

(c) Follows from (b) and (H2). ∎

Lemma (Discrete geometric growth of Zn).

Under  Section 4.1, there exist an integer nτ≥1 and a constant ρ>1 such that, for all sufficiently large n,

Zn+nτ≥ρ⁢Zn.
Proof.

We proceed as in [24]. Equation (32) at level n+nτ gives

Zn+nτ=ωn+nτ−1+τn+nτ−1β⁢f⁢(Zn+nτ−1),ωn+nτ−1=∑ℓ=0n+nτ−1cn+nτ−1,ℓ⁢Zℓ.

Here ωn+nτ−1 denotes the memory part of the L1 recurrence (not to be confused with the Grönwall weights wk,j of  Theorem 2). Choose nτ as the smallest integer such that

(1+nτ)1−β−nτ1−β<14⁢Γ⁢(2−β)⁢(−C0,h).

Monotonicity of {Zℓ} and the properties of the coefficients cN,ℓ (see [24], Eq. (14)) yield

(45) ωn+nτ−1≥(1−14⁢(−C0,h)⁢τnβ)⁢Zn.

On the other hand, (H2) implies

τnβ≥Γ⁡(2−β)⁢CΔ⁢tβ⁢(Zn)−α⁡(p−1).

For m≥N2 large enough we have Kp,h⁢(Zm)p−1≥2⁢(−C0,h), hence

f⁡(Zm)=C0,h⁢Zm+Kp,h⁢(Zm)p≥12⁢Kp,h⁢(Zm)p.

Applying this with m=n+nτ−1≥N2 and using (H2) once more,

τn+nτ−1β⁢f⁢(Zn+nτ−1) ≥12⁢Γ⁢(2−β)⁢CΔ⁢tβ⁢Kp,h⁢(Zn+nτ−1)(1−α)⁢(p−1)⁢Zn+nτ−1
≥12⁢Γ⁢(2−β)⁢CΔ⁢tβ⁢Kp,h⁢(Zn)(1−α)⁢(p−1)⁢Zn,

where the last inequality follows from Zn+nτ−1≥Zn. Combining with (45) we obtain, for n≥N1≥N2,

Zn+nτ≥(1+A⁢(Zn)(1−α)⁢(p−1))⁢Zn,A=12⁢Γ⁢(2−β)⁢CΔ⁢tβ⁢Kp,h>0.

Since (1−α)⁢(p−1)≥0, the factor 1+A⁢(Zn)(1−α)⁢(p−1) is larger than 1+A>1 for large n. Thus we may take ρ=1+12⁢A>1, which completes the proof. ∎

Lemma (Convergence of the time-step series).

Under Assumption 4.1, the total discrete time is finite:

∑n=0∞Δ⁢tn<∞.
Proof.

The sum of the time steps can be written as follows:

∑n=0∞Δ⁢tn=∑m=0N1−1Δ⁢tm+∑m=N1∞Δ⁢tm,

where N1 is the integer from which the geometric growth of Section 4.1 is ensured and

(46) ∑m=N1∞Δ⁢tm=∑k=0∞(∑j=0nτ−1Δ⁢tN1+k⁢nτ+j).

Using the time step strategy (H2) and the fact that −α(p−1)/β<0, the sequence {Δ⁢tm} is strictly decreasing. Therefore:

∑m=N1∞Δ⁢tm≤∑k=0∞nτ⁢Δ⁢tN1+k⁢nτ.

From Section 4.1 we have

Δ⁢tN1+k⁢nτ ≤CΔ⁢t(ZN1+k⁢nτ)−α(p−1)/β
≤CΔ⁢t(ZN1)−α(p−1)/β(ρ−α(p−1)/β)k.

The right-hand side is a convergent geometric series of common ratio R=ρ−α(p−1)/β<1. Hence

∑n=N1∞Δtn≤nτCΔ⁢t(ZN1)−α(p−1)/β∑k=0∞Rk<∞.∎
Remark (Finite-time blow-up).

The two limits limn→∞Zn=∞ and ∑n=0∞Δ⁢tn<∞ imply that the auxiliary sequence Zn blows up in finite numerical time.

4.2. Blow-up of the Numerical Solution

Lemma (Discrete Comparison Principle).

Let Vin be the solution to problem (25) and Zn the solution to (32). If JΦ,h0=Z0 and the positivity condition of Section 3.2 is satisfied, then JΦ,hn≥Zn for all n≥0.

Proof.

The proof is done by recurrence on n, using inequality (31), equation (32), the monotonicity of the function f for Z>Zcrit, and the non-negativity of the coefficients cn,k and Zk. ∎

Theorem 3 (Blow-up of the numerical solution Vin).

Under the conditions of hypotheses (H1)–(H2) and Section 3.2, the numerical solution Vin of problem (25) blows up in finite numerical time.

Proof.

By the remark above, the sequence Zn blows up in finite time. By the comparison principle (Section 4.2), JΦ,hn≥Zn, which implies that JΦ,hn also blows up in finite time. Since JΦ,hn is a weighted norm of Vn (there exist constants C1,C2>0 such that C1⁢‖Vn‖∞≤JΦ,hn≤C2⁢‖Vn‖∞), this implies that Vin blows up in finite time. ∎

4.3. Lower Blow-up Rate and Condition A2’

Remark (Motivation for the adaptive time-stepping strategy).

The adaptive time-stepping strategy (69) is motivated directly by the blow-up rate. Since ‖Vn‖∞∼C⁢(Tnum−tn)−γ near the singularity, substituting into (69) with α=1 gives Δ⁢tn∼CΔ⁢t⁢(Tnum−tn), which is precisely (H2) with α=1. The numerical validation is reported in  Table 2 and  Figure 1.

Lemma (L1 quadrature error near blow-up).

Let α=1, γ=β/(p−1). Assume:

(47) {β>(p−1)/p(finite-time blow-up),γ<1(i.e. ⁢β<p−1⁢),3>p⁢γ(integral convergence).

For p=2 and β∈(1/2,1), all three conditions are automatically satisfied. Choose θ∈(0,γ/(2−β)) and set δn=(TZ~−tn)θ. Let Z~n satisfy, for some C>0 and TZ~<∞:

(48) Z~n=C⁢(TZ~−tn)−γ⁢(1+o⁡(1))as ⁢tn→TZ~−.

Under strategy (44) with α=1, and with Z~⁢(s)=Z~k on [tk,tk+1):

ℰn ≔|∑k=N0n−1ωn−1,k⁢τkβ⁢Kp,h2⁢(Z~k)p−Kp,h2⁢Γ⁢(β)⁢∫tN0tn(tn−s)β−1⁢Z~⁢(s)p⁢𝑑s|
(49) =𝒪⁡((TZ~−tn)−γ).
Proof.

Decompose ℰn=En(0)+En(1)+En(2), where En(0) is the last-step term (k=n−1), En(1) the regular zone (tk≤TZ~−δn), and En(2) the singular zone (TZ~−δn<tk≤tn−2).

By (H2) with α=1 and (48):

(50) Δ⁢tk≲(TZ~−tk)γ⁡(p−1)/β=(TZ~−tk),

since γ⁡(p−1)/β=[β/(p−1)]⋅[(p−1)/β]=1 exactly.

For k≤n−2, the kernel (tn−s)β−1 is Lipschitz on [tk,tk+1] with constant (1−β)⁢(tn−tk+1)β−2 and we have:

(51) ωn−1,k⁢τkβ=1Γ⁡(β)⁢∫tktk+1(tn−s)β−1⁢𝑑s+εn,k,|εn,k|≤1−βΓ⁡(β)⁢(Δ⁢tk)2(tn−tk+1)2−β.

This requires tn−tk+1>0 and does not apply for k=n−1.

Since Z~⁢(s)=Z~n−1 on [tn−1,tn] and ωn−1,n−1⁢τn−1β=(Δ⁢tn−1)2−β/Γ⁡(2−β):

(52) En(0)=Kp,h2⁢(Z~n−1)p⁢(Δ⁢tn−1)β⁢|(Δ⁢tn−1)2−2⁢βΓ⁡(2−β)−1Γ⁡(1+β)|⏟→ 1/Γ⁡(1+β),bounded.

Hence En(0)≲(Δ⁢tn−1)β⁢(Z~n−1)p. By (50) and (48), and since β−pγ=β−pβ/(p−1)=−β/(p−1)=−γ exactly for α=1:

(53) En(0)≲(TZ~−tn)β−p⁢γ=(TZ~−tn)−γ=𝒪⁡((TZ~−tn)−γ).

Now consider the regular zone : tk≤TZ~−δn. For all k in this zone, tn−tk+1≥δn=(TZ~−tn)θ, so (tn−tk+1)−(2−β)≤(TZ~−tn)−θ⁡(2−β). Using (51), (50), and the ansatz:

(54) En(1)≤C⁢(TZ~−tn)−θ⁡(2−β)⁢∫tN0TZ~−δn(TZ~−s)2−p⁢γ⁢𝑑s.

By condition (iii), 3−p⁢γ>0. Evaluating the integral exactly:

(55) ∫tN0TZ~−δn(TZ~−s)2−p⁢γ⁢𝑑s=(TZ~−tN0)3−p⁢γ−δn3−p⁢γ3−p⁢γ≤(TZ~−tN0)3−p⁢γ3−p⁢γ≕C1,

which is a constant independent of n, since TZ~−tN0 is fixed and δn3−p⁢γ>0. Hence:

(56) En(1)≤C1⁢(TZ~−tn)−θ⁡(2−β).

The condition En(1)=o⁡((TZ~−tn)−γ) requires −θ⁡(2−β)>−γ, i.e.:

(57) θ<γ2−β=β(p−1)⁢(2−β).

This is satisfied by the choice of θ in the lemma statement. Therefore En(1)=o⁡((TZ~−tn)−γ).

Singular zone: TZ~−δn<tk≤tn−2. From (50): Δ⁢tk≲TZ~−tk, so tn−tk+1≥c⁡(TZ~−tk) for some c∈(0,1). Formula (51) applies. Using (50) and the ansatz:

|εn,k|⁢(Z~k)p≲(TZ~−tk)2(TZ~−tk)2−β⁢(TZ~−tk)−p⁢γ=(TZ~−tk)β−p⁢γ=(TZ~−tk)−γ.

Since −γ>−1 by condition (ii), the function (TZ~−s)−γ is integrable near TZ~. Integrating over Zone 2:

(58) En(2)≲∫TZ~−δnTZ~(TZ~−s)−γ⁢𝑑s=δn1−γ1−γ=(TZ~−tn)θ⁡(1−γ)1−γ.

Since θ⁡(1−γ)>0 (as γ<1 and θ>0), En(2)=o⁡((TZ~−tn)−γ) for any θ∈(0,1).

Conclusion. ℰn=En(0)+En(1)+En(2)=𝒪⁡((TZ~−tn)−γ). ∎

Theorem 4 (Lower blow-up rate — Condition A2’).

Assume (47) with α=1. There exists c−>0 such that for all n sufficiently large:

(59) ∥Vn∥∞≥c−(Tnum−tn)−β/(p−1).

Moreover:

(60) lim infn→∞(Tnum−tn)β/(p−1)⁢‖Vn‖∞≥CJ,h−CΦ>0,

where

CJ,h−=(2⁢Γ⁢(p⁢β/(p−1))Kp,h⁢Γ⁢(β/(p−1)))1/(p−1)andCΦ=h⁢∑j=1I−1Φ1,j.
Proof.

Set γ=β/(p−1) throughout.

Since Zn→+∞, there exists N0≥0 such that for n≥N0: Kp,h⁢(Zn)p−1≥2⁢|C0,h|, giving f⁡(Zn)≥12⁢Kp,h⁢(Zn)p≕g⁡(Zn). Define Z~n by the discrete pure Bernoulli equation:

(61) Z~n+1=∑k=0ncn,k⁢Z~k+τnβ⁢g⁢(Z~n),Z~N0=ZN0.

Since f≥g, Section 4.2 gives Zn≥Z~n for all n≥N0. Equation (61) is equivalent to the discrete Volterra equation:

(62) Z~n=Z~N0+∑k=N0n−1ωn−1,k⁢τkβ⁢Kp,h2⁢(Z~k)p.

Positing the asymptotic ansatz Z~n∼C⁢(TZ~−tn)−γ as tn→TZ~− (the legitimacy of this ansatz is discussed in  Section 4.3 below), and applying Section 4.3 to (62):

(63) Z~n=Z~N0+Kp,h2⁢Γ⁢(β)⁢∫tN0tn(tn−s)β−1⁢Z~⁢(s)p⁢𝑑s+𝒪⁡((TZ~−tn)−γ).

Substituting Z~⁢(s)≈C⁢(TZ~−s)−γ, the change of variable u=(tn−s)/(TZ~−tn) gives, as tn→TZ~−:

Kp,h2⁢Γ⁢(β) ∫tN0tn(tn−s)β−1⁢Cp⁢(TZ~−s)−p⁢γ⁢𝑑s∼
∼Kp,h⁢Cp2⁢Γ⁢(β)⁢(TZ~−tn)β−p⁢γ⁢∫0+∞uβ−1⁢(1+u)−p⁢γ⁢𝑑u
(64) =Kp,h⁢Cp2⁢Γ⁢(β)⁢(TZ~−tn)−γ⋅Γ⁡(β)⁢Γ⁢(γ)Γ⁡(β+γ),

where β−p⁢γ=−γ and the Beta integral ∫0+∞uβ−1⁢(1+u)−p⁢γ⁢𝑑u=B⁡(β,p⁢γ−β)=Γ⁡(β)⁢Γ⁢(γ)/Γ⁡(β+γ) converges since p⁢γ>β (always true for p>1). The error term 𝒪⁡((TZ~−tn)−γ) and the initial value Z~N0⁢(TZ~−tn)γ→0 both contribute at the same order or lower. Equating the dominant coefficient of (TZ~−tn)−γ on both sides of (62) gives:

(65) C=Kp,h⁢Cp2⋅Γ⁡(γ)Γ⁡(β+γ),i.e.⁢Cp−1=2⁢Γ⁢(β+γ)Kp,h⁢Γ⁢(γ)=2⁢Γ⁢(p⁢β/(p−1))Kp,h⁢Γ⁢(β/(p−1))=(CJ,h−)p−1.

Hence C=CJ,h− is the unique positive solution of (65), confirming the ansatz with this specific constant.

Both sequences Zn and Z~n are defined on the same adaptive grid {tn}, which satisfies tn→Tnum=∑n=0∞Δ⁢tn<∞. Since Z~n→+∞ along this grid, necessarily TZ~=Tnum. From Zn≥Z~n and JΦ,hn≥Zn:

(66) lim infn→∞(Tnum−tn)γ⁢JΦ,hn≥lim infn→∞(Tnum−tn)γ⁢Z~n=CJ,h−.

Since JΦ,hn≤‖Vn‖∞⋅CΦ, dividing by CΦ>0 gives (60), and (59) follows by definition of lim inf. ∎

Remark (Legitimacy of the asymptotic ansatz).

The ansatz Z~n∼C⁢(TZ~−tn)−γ is justified by two complementary arguments.

Continuous analogue. For the continuous pure Bernoulli equation DβtC⁢y=12⁢Kp,h⁢yp, Roberts and Olmstead [17] prove that any blow-up solution satisfies y⁡(t)⁢(T−t)γ→CJ,h− as t→T−. The exponent −γ is the unique power compatible with the Volterra structure of the Caputo derivative.

Numerical confirmation. Simulations of the discrete sequence Z~n (Section 6,  Table 2) show that the ratio (Tnum−tn)γ⁢Z~n converges to a stable plateau as tn→Tnum−. Moreover, this plateau satisfies:

limn→∞(Tnum−tn)γ⁢Z~n=CJ,h−⁢(1+O⁡(CΔ⁢t)),

which converges to CJ,h− as CΔ⁢t→0, consistently with the dominant balance (65). For any fixed CΔ⁢t>0, the actual limit exceeds CJ,h−, so the lower bound (60) holds with a strictly positive margin.

Lemma (Uniformity of CJ,h− as h→0).

limh→0Kp,h=(2/π)p−1, limh→0CΦ=2/π, hence limh→0CJ,h−>0 and lim infh→0c−⁢(h)>0.

Proof.

CΦ=h⁢∑j=1I−1sin⁡(j⁢π⁢h)→∫01sin⁡(π⁢x)⁢𝑑x=2/π by Riemann sums. Kp,h=CΦ1−p→(2/π)p−1. The limit of CJ,h− follows by continuity of its formula in Kp,h. ∎

5. Convergence of Blow-up Time

Theorem 5 (Uniform convergence up to blow-up).

For any δ>0, there exists C⁡(δ)>0 such that:

(67) suptn≤Th−δ‖U⁡(tn)−Vn‖∞≤C⁡(δ)⁢(Δ⁢t+h2),C⁡(δ)≤C0⁢exp⁡(c⁢δ−β),

where C0,c>0 depend only on D,β,p,Kp,h,Th and the initial data.

Proof.

By Section 2.1, the comparison principle [15] gives J⁢(t)≤J¯⁢(t) for all t∈[0,min⁡(Th,TJ¯)), where J¯ is the maximal solution of DβtC⁢J¯=Kp,h⁢J¯p with J¯⁢(0)=J⁢(0).

Since J¯ blows up at TJ¯≥Th, it is continuous on the compact interval [0,Th−δ] and therefore bounded there. To quantify this bound, we use the asymptotic rate J¯⁢(t)∼Cup⁢(TJ¯−t)−γ as t→TJ¯− [17]. Since every point t∈[0,Th−δ] satisfies TJ¯−t≥TJ¯−(Th−δ)≥δ>0, this asymptotic estimate provides the uniform upper bound:

maxt∈[0,Th−δ]⁡J¯⁢(t)≤Cup⁢δ−γ.

By norm equivalence ‖U⁡(t)‖∞≤J¯⁢(t)/cΦ with cΦ=h⁢mini⁢Φ1,i>0:

Mδ≔maxt∈[0,Th−δ]⁡‖U⁡(t)‖∞≤C1⁢δ−γ,

for a constant C1=Cup/cΦ>0 independent of δ.

On {∥v∥∞≤Mδ+1}, the nonlinearity f⁡(u)=up is Lipschitz with constant Lδ=p⁢(Mδ+1)p−1≤C3⁢δ−β, since (p−1)⁢γ=β.  Theorem 2 on [0,Th−δ] with the discrete fractional Grönwall inequality [19] gives:

suptn≤Th−δ‖en‖∞≤C0⁢exp⁡(c⁢δ−β)⁢(Δ⁢t+h2),

where c=C3⁢Thβ/Γ⁡(1+β). ∎

Theorem 6 (Convergence of the numerical blow-up time).

Under  Section 4.1 with (47): limΔ⁢t0→0Tnum=Th.

Proof.

The proof uses three conditions:

Case 1: Tnum→T∗>Th. By A1’ and A0, ‖Vn‖∞→∞ as tn→Th−. Hence the numerical blow-up cannot be delayed beyond Th<T∗.

Case 2: Tnum→T∗<Th. Choose δ=Th−T∗>0 so that T∗=Th−δ. On [0,T∗−ε]=[0,Th−δ−ε] for any ε∈(0,δ), A1’ gives ‖Vn‖∞ uniformly bounded. But A2’ gives ‖Vn‖∞≥c−⁢(Tnum−tn)−γ→+∞ as tn→Tnum: contradiction.

Therefore Tnum→Th. ∎

Remark (Critical singularity exponent).

The exponent is δ−β rather than δ−γ because Lδ∼Mδp−1∼(δ−γ)p−1=δ−β dominates the error estimate.

Remark (Why a one-sided lower bound suffices).

Ushijima’s original framework [22] requires both lower and upper blow-up rate bounds. In our fractional setting the upper bound is structurally unnecessary: Case 1 uses only A0 and A1’ with no rate information; Case 2 requires only divergence of ‖Vn‖∞, which any positive lower bound provides. The upper bound would characterise the blow-up profile more precisely and is left for future work.

6. Numerical Experiments

This section validates the theoretical analysis. The experiments pursue five goals: (i) verify the 𝒪⁡(h2+Δ⁢t) convergence rate (Theorem 2); (ii) confirm condition A2’ (Theorem 4); (iii) demonstrate Tnum→Th (Theorem 6); (iv) study the monotone dependence β↦Tnum⁢(β); (v) validate hypothesis (H2) with α=1.

6.1. Numerical setup

All simulations solve (1) with D=1, p=2, β∈{0.40, 0.60, 0.80, 0.99}, and u0⁢(x)=A⁢sin⁡(π⁢x).

Choice of amplitude.

The blow-up condition of  Theorem 1 requires JΦ,h⁢(0)>Jcrit, where

(68) JΦ,h(0)=A⋅h∑j=1I−1sin2(jπh),Jcrit=Dλ1,h⋅h∑j=1I−1sin(jπh).

For p=2 and large I: JΦ,h⁢(0)→A/2 and Jcrit→2⁢π≈6.28, so the condition requires A>4⁢π≈12.57. We use A=20, giving a margin of +59% at all mesh levels (Table 1). For A→(4⁢π)+, the constant C∗=(Kp,h⁢J⁢(0)p−1−D⁢λ1,h)/J⁢(0)p−1 approaches zero and the blow-up time bound diverges; A=20 avoids this stiffness.

I h JΦ,h⁢(0) Jcrit Margin
50 1/50 10.000 6.279 +59.3%
100 1/100 10.000 6.282 +59.2%
200 1/200 10.000 6.283 +59.2%
Table 1. Blow-up threshold verification for p=2, D=1, A=20, β=0.8.

Adaptive time-stepping.

For the explicit L1 scheme:

(69) Δtn=min(CΔ⁢t∥Vn∥∞−(p−1)/β,CCFLh2/β),CΔ⁢t=0.5,CCFL=0.1.

The second term enforces the positivity condition (28). For the implicit scheme, only the first term is used.

Blow-up time approximation.

Since Th=∑n=0+∞Δ⁢tn cannot be computed exactly, we set

(70) Tnum⁢(ℳ)≔∑n=0N∗−1Δ⁢tn,N∗=min⁡{n≥1:‖Vn‖∞>ℳ},

with ℳ=106. By construction Tnum⁢(ℳ)<Th; inverting ‖Vn‖∞∼C⁢(Th−tn)−γ at N∗ and using (H2) with α=1 gives

(71) Th−Tnum(ℳ)∼C(p−1)/βℳ−(p−1)/βas ℳ→+∞.

For β=0.8, p=2, h=1/50: the detection error is 𝒪⁡(ℳ−1), which is negligible compared to 𝒪⁡(h2). The monotonicity Tnum⁢(ℳ)↗Th is confirmed by the decreasing differences between successive thresholds.

Reference blow-up time.

Richardson extrapolation from the two finest levels eliminates the 𝒪⁡(h2) error and gives Tref=Th+𝒪⁡(h4):

(72) Tref⁢(β)=4⁢Tnum⁢(β,h/2)−Tnum⁢(β,h)3.

6.2. Validation of hypothesis (H2)

Substituting ‖Vn‖∞∼C⁢(Tnum−tn)−γ into (69) gives Δ⁢tn∼CΔ⁢t⁢(Tnum−tn), predicting a log-log slope of α=1 for Δ⁢tn versus (Tnum−tn). This scaling holds asymptotically as Tnum−tn→0; a lower slope is expected far from the singularity.  Table 2 and  Figure 1 report the slopes from the implicit L1 scheme (A=20, I=50, β=0.8, step Δtn=0.05∥Vn∥∞−1/β without CFL constraint).

Zone Measured slope Expected
Far from blow-up (Tnum−tn>10−2) 0.83±0.00 1
Near blow-up (Tnum−tn<10−3) 0.98±0.00 1
Table 2. Measured log-log slope of Δ⁢tn versus (Tnum−tn), implicit L1, β=0.8, h=1/50, p=2, A=20. Theoretical slope: α=1.
Refer to caption
Figure 1. Log-log plots versus (Tnum−tn) for the implicit L1 scheme (β=0.8, h=1/50, p=2, A=20). Left: Δ⁢tn; slope near blow-up 0.98≈α=1 (orange), pre-asymptotic slope 0.83 (red), confirming hypothesis (H2). Right: ‖Vn‖∞; slope −0.76, consistent with the theoretical rate −β/(p−1)=−0.8. (Axis labels: “Time remaining (Tnum−tn)”, “Blow-up simulation — Implicit L1 scheme”.)

6.3. Convergence of Tnum (β=0.8)

For β=0.8, p=2, the conditions (47) hold: β=0.8>0.5; p⁢γ=1.6<3; γ=0.8<1.

h Tnum |Tnum−Tref| Obs. order
1/50 0.078949 5.0×10−5 —
1/100 0.078986 1.3×10−5 2.00
1/200 0.078996 3.0×10−6 2.00
Table 3. Convergence of Tnum for β=0.8, p=2, D=1, A=20. Tref≈0.078999 by Richardson extrapolation (72). The observed order 2.00 is consistent with the 𝒪⁡(h2) spatial discretisation error.

6.4. Validation of condition A2’

We track Ψn=(Tnum−tn)γ⁢‖Vn‖∞ near blow-up, where γ=β/(p−1)=0.8. The theoretical lower bound CJ,h−/CΦ is computed analytically from  Theorem 4 at β=0.8, h=1/100:

CJ,h−CΦ=1CΦ⁢(2⁢Γ⁢(p⁢γ)Kp,h⁢Γ⁢(γ))1/(p−1)=0.97710.6366≈1.535.

The log-log slope of ‖Vn‖∞ versus (Tnum−tn) is −0.78±0.02, consistent with −γ=−0.8 (Figure 1, right panel).

Tnum−tn ‖Vn‖∞ Ψn Gap
9.54×10−3 6.77×101 1.637 +6.7%
1.30×10−3 3.20×102 1.574 +2.5%
8.00×10−5 2.96×103 1.559 +1.6%
9.70×10−6 1.59×104 1.556 +1.4%
1.16×10−6 8.62×104 1.540 +0.3%
Table 4. Rate functional Ψn=(Tnum−tn)γ⁢‖Vn‖∞ near blow-up, β=0.8, A=20, I=100. Column “Gap”: (Ψn−1.535)/1.535×100%. The decreasing trend reflects convergence of Ψn toward its lim inf≥CJ,h−/CΦ=1.535 (Theorem 4). CJ,h−/CΦ varies by less than 0.1% for h∈{1/50,1/100,1/200}, confirming lim infh→0CJ,h−>0 (Section 4.3).

6.5. Blow-up spatial profile

To complement the rate analysis of the previous section, we examine the normalized spatial profile V^n⁢(x)=Vn⁢(x)/‖Vn‖∞ as tn→Tnum−.  Figure 2 displays V^n at five time levels approaching the singularity (β=0.8, p=2, h=1/100, implicit L1 scheme).

Refer to caption
Figure 2. Normalized blow-up profile V^n=Vn/‖Vn‖∞ for β=0.8, p=2, h=1/100, at five time levels near Tnum (from Tnum−t≈2.8×10−2 to Tnum−t≈10−6). The profiles progressively concentrate into a sharp spike centered at x=1/2, confirming single-point blow-up at the midpoint of the domain.
Remark (Single-point blow-up).

The concentration at x=1/2 is consistent with the dominance of the first eigenmode Φ1⁢(x)=sin⁡(π⁢x), which attains its maximum at x=1/2. Since the weighted functional JΦ,h⁢(t) is driven by this mode (Section 2.1), and the initial data u0⁢(x)=A⁢sin⁡(π⁢x) are symmetric about x=1/2, the blow-up is expected to be single-point. The numerical evidence of  Figure 2 confirms this: as tn→Tnum− the support of V^n shrinks to {1/2}, consistent with the spatial symmetry of the problem and the Dirichlet boundary conditions.

6.6. Stability limits and implicit scheme (β=0.4)

For β=0.4, the CFL constraint gives Δ⁢t≤CCFL⁢h5≲10−10 at h=1/100, which is computationally infeasible. We therefore use the implicit L1 scheme:

(73) Vin+1−τnβ⁢(D⁢δ2⁢Vin+1+(Vin+1)p)=∑k=0ncn,k⁢Vik,

solved by Newton’s method (tolerance 10−12). A complete theoretical analysis of (73) is beyond the scope of this work; the results below are exploratory.

Scheme Tnum Positivity violated? ‖VN∗‖∞
Explicit (CFL enforced) 0.000170 No 106
Explicit (CFL ignored) — Yes <0
Implicit ≈0.000168 No 106
Table 5. Explicit vs. implicit L1, β=0.4, h=1/10, p=2, D=1, A=20. The explicit scheme with CFL constraint Δ⁢t≤CCFL⁢h5 remains positive and reaches blow-up; without this constraint positivity is violated. The implicit scheme is unconditionally stable.

The explicit scheme produces unphysical negative values when the CFL is ignored, confirming Section 3.2 is sharp. The implicit scheme yields Tnum within 1.5% of the CFL-enforced explicit result.

Refer to caption
(a) Explicit L1 (CFL ignored): solution becomes negative at n=1,247.
Refer to caption
(b) Implicit L1: stable blow-up capture.
Figure 3. Blow-up dynamics for β=0.4, h=1/100.

6.7. Monotone influence of β

The data in  Table 6 confirm that Tnum⁢(β) decreases strictly as β decreases, consistently with the memory interpretation of the Caputo operator: a smaller β induces a longer memory effect, which accelerates the accumulation of the nonlinear reaction term and shortens the existence time of the solution.

β h=1/50 h=1/100 h=1/200 Tref Obs. order
0.99 0.157090 0.157160 0.157178 0.157184 2.00
0.80 0.078949 0.078986 0.078996 0.078999 2.00
0.60 0.024464 0.024476 0.024479 0.024480 2.00
0.40 0.002665 0.002666 0.002666 0.002666 2.00
Table 6. Numerical blow-up time Tnum⁢(β), explicit L1 with adaptive stepping, p=2, D=1, A=20. Tref⁢(β) by Richardson extrapolation (72).

The data confirm: (i) Tnum⁢(β,h)→Tref⁢(β) with order 2.00, consistent with the 𝒪⁡(h2) spatial error; (ii) Tnum⁢(β1)<Tnum⁢(β2) for β1<β2, uniformly across all mesh levels, confirming the monotone memory effect of the Caputo operator; (iii) Tref⁢(0.99)/Tref⁢(0.40)≈59, so reducing β from near-classical to strong-memory accelerates blow-up by roughly two orders of magnitude.

Refer to caption
Figure 4. ‖Vn‖∞ versus time t for β∈{0.40, 0.60, 0.80, 0.99} (p=2, D=1, A=20, h=1/100): smaller β accelerates singularity formation. (Axis labels: “Time t”, “Solution amplitude ‖Vn‖∞”; legend: “Implicit blow-up simulation — L1 scheme”.)

6.8. Connection to the Ushijima framework

We verify numerically the three conditions underpinning  Theorem 6.

A0 (finite-time blow-up).

Table 3: Tnum<∞ at all mesh levels.

A1’ (uniform convergence on [0,Th−δ]).

With δ=10−4 and U⁡(tn) approximated by the h=1/400 implicit solution:

h suptn≤Th−δ‖Vn−U⁡(tn)‖∞ Obs. order
1/50 4.0×10−4 —
1/100 1.0×10−4 2.00
1/200 2.5×10−5 2.00
Table 7. Condition A1’: δ=10−4, β=0.8, p=2, D=1, A=20. Observed orders confirm 𝒪⁡(h2) (Theorem 2).

A2’ (lower blow-up rate).

Table 4: Ψn≥1.56>1.535 throughout; CJ,h−/CΦ=1.535 is stable within ±0.1% for h∈{1/50,1/100,1/200}, confirming that
lim infh→0CJ,h−>0 (Section 4.3). The normalized spatial profile (Figure 2) further confirms single-point blow-up at x=1/2, consistent with the dominance of the first eigenmode Φ1.

All three conditions are numerically confirmed, supporting Tnum→Th of  Theorem 6.

Declarations

Conflict of interest: The authors declare no competing interests.
Data availability: No data was used for the research described in the article.

References

  • [1] P.R. Beesack, Comparison theorems and integral inequalities for Volterra integral equations, Proc. Amer. Math. Soc., 20 (1969) no. 1, pp. 61–66. https://doi.org/10.1090/S0002-9939-1969-0233100-2
  • [2] J. Cao, G. Song, J. Wang, Q. Shi, S. Sun, Blow-up and global solutions for a class of time fractional nonlinear reaction–diffusion equation with weakly spatial source, Appl. Math. Lett., 91 (2019), pp. 201–206. https://doi.org/10.1016/j.aml.2018.12.020
  • [3] H. Chen and M. Stynes, A discrete comparison principle for the time-fractional diffusion equation, Comput. Math. Appl., 80 (2020) no. 5, pp. 917–922. https://doi.org/10.1016/j.camwa.2020.04.018
  • [4] K. Diethelm, The Analysis of Fractional Differential Equations: An Application-Oriented Exposition Using Differential Operators of Caputo Type, Lecture Notes in Mathematics, vol. 2004, Springer, Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14574-2
  • [5] X. Huang, Y. Liu, M. Yamamoto, Blow-up for time-fractional diffusion equations with superlinear convex semilinear terms, arXiv:2310.14295, 2023. https://doi.org/10.48550/arXiv.2310.14295
  • [6] B. Jin, R. Lazarov, Z. Zhou, An analysis of the L1 scheme for the subdiffusion equation with nonsmooth data, IMA J. Numer. Anal., 36 (2016) no. 1, pp. 197–221. https://doi.org/10.1093/imanum/dru063
  • [7] M.D. Kassim, K.M. Furati, N.-E. Tatar, Asymptotic behavior of solutions to nonlinear fractional differential equations, Math. Model. Anal., 21 (2016) no. 5, pp. 610–629. https://doi.org/10.3846/13926292.2016.1198279
  • [8] A.A. Kilbas, H.M. Srivastava, J.J. Trujillo, Theory and Applications of Fractional Differential Equations, Elsevier, Amsterdam, 2006. https://doi.org/10.1016/S0304-0208(06)X8001-5
  • [9] M. Kirane, M. Medved, N.-E. Tatar, On the nonexistence of blowing-up solutions to a fractional functional-differential equation, Georgian Math. J., 19 (2012) no. 1, pp. 127–144. https://doi.org/10.1515/gmj-2012-0006
  • [10] C.M. Kirk, W.E. Olmstead, C.A. Roberts, A system of nonlinear Volterra equations with blow-up solutions, J. Integral Equations Appl., 25 (2013) no. 3, pp. 377–394. https://doi.org/10.1216/JIE-2013-25-3-377
  • [11] W. Li, S. Wang, V. Rehbock, A 2nd-order one-point numerical integration scheme for fractional ordinary differential equations, Numer. Algebra Control Optim., 7 (2017) no. 3, pp. 273–287. https://doi.org/10.3934/naco.2017018
  • [12] B. Li, X. Xie, S. Zhang, A new smoothness result for Caputo-type fractional ordinary differential equations, Appl. Math. Comput., 349 (2019), pp. 408–420. https://doi.org/10.1016/j.amc.2018.12.052
  • [13] Y. Lin and C. Xu, Finite difference/spectral approximations for the time-fractional diffusion equation, J. Comput. Phys., 225 (2007) no. 2, pp. 1533–1552. https://doi.org/10.1016/j.jcp.2007.02.001
  • [14] Y. Luchko, Maximum principle for the generalized time-fractional diffusion equation, J. Math. Anal. Appl., 351 (2009) no. 1, pp. 218–223. https://doi.org/10.1016/j.jmaa.2008.10.018
  • [15] Y. Luchko and M. Yamamoto, On the maximum principle for a time-fractional diffusion equation, Fract. Calc. Appl. Anal., 20 (2017) no. 5, pp. 1131–1145. https://doi.org/10.1515/fca-2017-0060
  • [16] H. Nachid, B. Yekre, Y. Gozo, Simulation of the blow-up and the quenching time for positive solutions of singular boundary value problems for nonlinear parabolic systems, Ann. Math. Afr., 8 (2020), pp. 53–70. http://afrimathsannals.com/
  • [17] C.A. Roberts and W.E. Olmstead, Growth rates for blow-up solutions of nonlinear Volterra equations, Quart. Appl. Math., 54 (1996) no. 1, pp. 153–159. https://doi.org/10.1090/qam/1375179
  • [18] A. Safsaf, S. Alfalqi, A. Bchatnia, A. Beniani, Blow-up dynamics in nonlinear coupled wave equations with fractional damping and external source, Electron. Res. Arch., 32 (2024) no. 10, pp. 5738–5751. https://doi.org/10.3934/era.2024265
  • [19] Z.Z. Sun and X. Wu, A fully discrete difference scheme for a diffusion-wave system, Appl. Numer. Math., 56 (2006) no. 2, pp. 193–209. https://doi.org/10.1016/j.apnum.2005.03.003
  • [20] V.E. Tarasov, On history of mathematical economics: Application of fractional calculus, Mathematics, 7 (2019) no. 6, 509. https://doi.org/10.3390/math7060509
  • [21] V.E. Tarasov, Exact solutions of Bernoulli and Logistic fractional differential equations with power law coefficients, Mathematics, 8 (2020) no. 12, 2231. https://doi.org/10.3390/math8122231
  • [22] T.K. Ushijima, On the Approximation of Blow-up Time for Solutions of Nonlinear Parabolic Equations, Publ. Res. Inst. Math. Sci., 36 (2000) no. 5, pp. 613–640. https://doi.org/10.2977/PRIMS/1195142812
  • [23] J. Villa-Morales, Upper bounds for the blow-up time of a system of fractional differential equations with Caputo derivatives and a numerical scheme for the solution of the system, arXiv:2310.13584, 2023.
  • [24] Q. Wang, Z. Yang, C. Zhao, Numerical blow-up analysis of the explicit L1-scheme for fractional ordinary differential equations, Numer. Algorithms, 89 (2022), pp. 819–846. https://doi.org/10.1007/s11075-021-01121-w
  • [25] S. Zeng, S. Migórski, V.T. Nguyen, Y.R. Bai, Maximum Principles for a Class of Generalized Time-Fractional Diffusion Equations, Fract. Calc. Appl. Anal., 23 (2020) no. 3, pp. 822–836. https://doi.org/10.1515/fca-2020-0041