Preprint
Article

This version is not peer-reviewed.

High-Order Convolution Quadrature Scheme for the Subdiffusion Equation with Nonsmooth Data

Submitted:

10 September 2026

Posted:

13 September 2026

You are already at the latest version

Abstract
While polynomial interpolation discretizes fractional operators up to order \(k-\alpha\) (\(k=4,5,6,7\)), we construct a \(4-\alpha\) order approximation for the Caputo derivative directly in the frequency domain using the asymptotic expansion of the polylogarithm function. We determine the scheme's weights by applying the method of undetermined coefficients to a polynomial correction of the generating function \(\operatorname{Li}_{1+\alpha}(e^{-z})\), which cancels low-order truncation errors. To address the continuous solution's initial weak singularity near \(t=0\)—a persistent issue that degrades theoretical \(\mathcal{O}(\tau^{4-\alpha})\) accuracy to first order—we introduce a starting correction that modifies the right-hand side of the discrete equations. Although this modification applies solely to the first three time steps, Laplace transform analysis establishes the uniform recovery of the optimal \(\mathcal{O}(\tau^{4-\alpha})\) convergence rate for any fixed \(t>0\). Numerical tests on both homogeneous and inhomogeneous equations confirm this result.
Keywords: 
;  ;  

1. Introduction

This paper is concerned with the development and analysis of high-order time-stepping discrete methods for the following initial-boundary value problem of the subdiffusion equation [1,2]:
D t α 0 C u ( x , t ) + A u ( x , t ) = f ( x , t ) in Ω × ( 0 , T ] ,
u ( x , t ) = 0 on Ω × ( 0 , T ] ,
u ( x , 0 ) = v ( x ) in Ω ,
where Ω R d ( d { 1 , 2 , 3 } ) is a convex polygonal or polyhedral domain with boundary Ω , and T > 0 is a fixed number. Here, f : Ω ¯ × [ 0 , T ] R is a given source function, and v L 2 ( Ω ) is a given initial data. The operator A = Δ is the negative Laplacian defined on the domain D ( A ) = H 2 ( Ω ) H 0 1 ( Ω ) L 2 ( Ω ) . D t α 0 C u is the left-sided Caputo fractional derivative of order α ( 0 , 1 ) , defined by [9]
D t α 0 C u ( x , t ) = 1 Γ ( 1 α ) 0 t ( t s ) α u ( x , s ) s d s ,
where Γ ( · ) denotes the Euler Gamma function. The subdiffusion equation is a valuable tool for describing slow transport processes in complex systems, including subsurface environments, turbulent plasmas, and heterogeneous porous media [1]. To capture such anomalous behavior accurately, high-order time discretization schemes are often essential, especially when the data are nonsmooth [2].
Finite difference methods for the Caputo fractional derivative mainly fall into two classes: L1-type and Grünwald-Letnikov-type schemes. The former handles variable coefficients and nonsmooth data more flexibly. Within the L1 framework, the standard scheme achieves ( 2 α ) order for smooth solutions, whereas the L1-2 formula raises this to ( 3 α ) via quadratic interpolation [4]. However, these polynomial-based schemes demand high regularity. As noted in [3], solutions typically exhibit weak singularities near t = 0 . Without strict compatibility conditions, this singular behavior severely degrades the convergence rate of high-order methods down to first order.
The Laplace (or Fourier) transform of fractional calculus yields s α (or ( i ω ) α ) [9], motivating the approximation of fractional derivatives directly from the frequency domain. Generating functions facilitate this approach by mapping discrete operators into the Laplace domain. Recent developments heavily utilize the Riemann zeta and polylogarithm functions. Dimitrov et al. [7] constructed a ( 2 α ) -order approximation using the polylogarithm, and subsequently [8] derived an equivalent-order scheme via asymptotic expansions involving ζ ( α ) . These approaches endow the discrete weights with explicit integral representations. Such exactness significantly simplifies the subsequent error analysis.
We extend the zeta/polylogarithm framework of Dimitrov et al. [7,8] by constructing a family of generating functions of order k α ( k = 3 , 4 , 5 , 6 , 7 ). This leads to our new time-stepping methods, the Zeta schemes. We then incorporate the starting correction technique of [12] directly into the discrete convolution. This specific modification alters both the generating function and the Laplace-domain integration contour, compensating for the initial singular behavior. To further suppress truncation errors stemming from the dominant singularity, we introduce an additional correction factor. A linear system involving the Riemann zeta function determines the necessary correction coefficients to cancel the leading errors. By employing contour integral techniques, we prove that the corrected schemes uniformly recover the optimal O ( τ 4 α ) rate for any fixed t > 0 . Remarkably, this optimal convergence holds for both homogeneous and inhomogeneous problems, even when dealing with incompatible initial data v L 2 ( Ω ) and nonsmooth sources.
The remainder of this paper is organized as follows. Section 2 and Section 3 detail the O ( τ 4 α ) time discretization. Here, we introduce the starting correction terms and compute the coefficients needed for the high-order generating function. Section 4 and Section 5 contain the core theoretical analysis: deriving uniform error estimates for the homogeneous and inhomogeneous cases, respectively, alongside the high-order correction factor. Section 6 presents numerical experiments that validate our theoretical bounds. Section 7 gives a brief conclusion.

2. High-Order CQ schemes

2.1. Pre Knowledge

Let τ = T / N and u n = u ( t n ) be the value of the function u ( t ) at the point t n = n τ . The L1 approximation of the Caputo derivative is constructed by dividing the interval [ 0 , t ] into subintervals of equal length τ and approximating the first derivative on each subinterval using a second-order central difference approximation.
For any sequence { g n } n = 0 2 ( L 2 ( Ω ) ) , let g ˜ ( ξ ) denote the generating function of the sequence defined by
g ˜ ( ξ ) = n = 0 g n ξ n for ξ D .
The L1 approximation formula is given by
D t α 0 C u ( t n ) = τ α Γ ( 2 α ) j = 0 n b j u n j + O ( τ 2 α ) ,
where b 0 = 1 , b n ( α ) = ( n 1 ) 1 α n 1 α , and b j = ( j + 1 ) 1 α 2 j 1 α + ( j 1 ) 1 α ( j = 2 , , n 1 ). The popular L1 scheme [3] is associated with the generating symbol
( 1 ζ ) 2 ζ Γ ( 2 α ) Li α 1 ( ζ ) = j = 0 b j ζ j ,
where
Li p ( z ) = j = 1 z j j p = z + z 2 2 p + + z n n p +
is the polylogarithmic function, which is well defined for | z | < 1 and can be analytically continued to the split complex plane C [ 1 , ) .
The CQ generated by the k-th order BDF [10,11] is given by formal power series expansions. To establish our high-order CQ approximations, we rely on the following asymptotic summation behavior and singularity expansions.
Lemma 1. 
[13] If u ( t ) C k [ 0 , T ] , then
1 τ α j = 1 n 1 u ( t j τ ) j 1 + α = Γ ( α ) D t α 0 u ( t ) + m = 0 k ( 1 ) m m ! ζ ( 1 + α m ) u ( m ) ( t ) τ m α m = 0 k B 2 m ( 2 m ) ! l = 0 2 m 1 2 m 1 l Γ ( 1 + α + l ) Γ ( 1 + α ) u ( 2 m 1 l ) ( 0 ) t 1 + α + l τ 2 m .
In particular, if u ( m ) ( 0 ) = 0 for m = 0 , 1 , , k , then
1 τ α j = 1 n 1 u ( t j τ ) j 1 + α = Γ ( α ) D t α 0 u ( t ) + m = 0 k ( 1 ) m m ! ζ ( 1 + α m ) u ( m ) ( t ) τ m α .
Lemma 2. 
[24] For p 1 , 2 , , the function Li p ( e z ) satisfies the singular expansion
Li p ( e z ) Γ ( 1 p ) z p 1 + l = 0 ( 1 ) l ζ ( p l ) z l l ! as z 0 ,
where ζ is the Riemann zeta function.
Proof. 
To establish the absolute convergence of the series in a neighborhood of z = 0 , we employ the functional equation for the Riemann zeta function:
ζ ( p l ) = 2 ( 2 π ) 1 p + l cos π ( p l ) 2 Γ ( 1 p + l ) ζ ( 1 p + l ) .
As l , the argument 1 p + l + , which implies ζ ( 1 p + l ) 1 . Furthermore, by Stirling’s formula (or the asymptotic ratio of Gamma functions), we have Γ ( 1 p + l ) l ! l p as l . Consequently, the general term of the series satisfies
ζ ( p l ) z l l ! C l p ( 2 π ) l | z | l ,
for some constant C > 0 . By the ratio test, this power series has a radius of convergence R = 2 π . Since we are concerned with the asymptotic behavior as z 0 , the series converges absolutely in this domain.    □
In particular, taking p = α 1 in Lemma 2, we obtain the specific singular expansion
Li α 1 ( e z ) Γ ( 2 α ) z α 2 + l = 0 ( 1 ) l ζ ( α 1 l ) z l l ! as z 0 .

2.2. High-Order Time Discretization Schemes

Inspired by the corrected scheme in [13] and drawing on the idea of polynomial interpolation, we construct new corrected schemes for both smooth and nonsmooth cases based on Lemma 1. The key idea is to regard the convolution weights of the discrete scheme as the coefficients of a power series b ˜ ( ξ ) , which is understood in the sense of formal power series for the purpose of asymptotic expansion.
Theorem 1. 
Let 0 < α < 1 and let k 2 be a given integer. Assume that the function u C k [ 0 , T ] and its derivatives up to order k vanish at t = 0 . Construct the generating function
Γ ( α ) b ˜ ( ξ ) = Γ ( α ) j = 0 b j ξ j = j = 0 ξ j j 1 + α + j = 0 k 1 c j ξ j = Li 1 + α ( ξ ) + j = 0 k 1 c j ξ j ,
where the coefficients { c j } j = 0 k 1 are uniquely determined by the equations
ζ ( α + 1 m ) + j = 0 k 1 c j j m = 0 , m = 0 , 1 , , k 1 .
Then the convolution scheme whose weight coefficients b j are derived by b ˜ ( ξ ) ,
1 τ α j = 0 b j u ( t n j τ ) = D t α 0 u ( t n ) + O ( τ k α ) ,
has k α order accuracy.
Proof. 
We carry out the analysis in the frequency domain. Define the error symbol
E ( z , τ ) : = τ α Γ ( α ) j = 0 b j e j z τ Γ ( α ) z α ,
where z lies on a suitable contour in the left half-plane. It suffices to show that E ( z , τ ) = O ( τ k α ) as τ 0 , uniformly on the contour. The desired time-domain estimate then follows by applying the inverse Laplace transform together with standard Paley–Wiener type arguments.
Since Γ ( α ) j = 0 b j e j z τ = F ( e z τ ) , we have
E ( z , τ ) = τ α F ( e z τ ) Γ ( α ) z α .
Substituting the explicit form of F, we obtain
F ( e z τ ) = Li 1 + α ( e z τ ) + j = 0 k 1 c j e j z τ .
Using the expansion
Li 1 + α ( e z ) = Γ ( α ) z α + m = 0 ( 1 ) m ζ ( α + 1 m ) m ! z m
and
e j z = m = 0 ( j ) m m ! z m ,
we have
τ α F ( e z τ ) = Γ ( α ) z α + m = 0 ( 1 ) m ζ ( α + 1 m ) m ! + j = 0 k 1 c j ( j ) m m ! z m τ m α .
Truncating high order terms for accuracy yields
τ α F ( e z τ ) = Γ ( α ) z α + m = 0 k 1 ( 1 ) m ζ ( α + 1 m ) m ! + j = 0 k 1 c j ( j ) m m ! z m τ m α + O ( τ k α ) .
Thus,
E ( z , τ ) = m = 0 k 1 ( 1 ) m ζ ( α + 1 m ) m ! + j = 0 k 1 c j ( j ) m m ! z m τ m α + O ( τ k α ) .
To achieve E ( z , τ ) = O ( τ k α ) , it is necessary and sufficient to let the first several terms of the above expansion vanish. Factoring out the common ( 1 ) m multiplier from the summation, the condition reduces to:
ζ ( α + 1 m ) + j = 0 k 1 c j j m = 0 , m = 0 , 1 , , k 1 .
Finally, applying the inverse Laplace transform gives the time-domain error estimate
1 τ α j = 0 b j u ( t n j τ ) = D t α 0 u ( t n ) + O ( τ k α ) .
This completes the proof.    □
Since u ( 0 ) = 0 , we extend the solution by zero for negative times to derive the numerical scheme. We have
j = 0 b j u ( t n j τ ) = j = 0 n b j u ( t n j τ ) ,
i.e.,
1 τ α j = 0 n b j u ( t n j τ ) = D t α 0 u ( t n ) + O ( τ k α ) .
We now discuss special cases corresponding to indices k = 2 , 3 , 4 , 5 , 6 , 7 . Solving the equations
ζ ( α + 1 ) + c 0 + c 1 = 0 , ζ ( α ) + c 1 = 0
by taking k = 2 , we get c 0 = ζ ( α ) ζ ( 1 + α ) and c 1 = ζ ( α ) , yielding the weight coefficients
b 0 ( α ) = 1 Γ ( α ) ( ζ ( α ) ζ ( 1 + α ) ) , b 1 ( α ) = 1 Γ ( α ) ( 1 ζ ( α ) ) , b j ( α ) = 1 Γ ( α ) j 1 + α ( 2 j n ) .
By means of the generating function, we obtain the same result as in [13].
If we take k = 3 , the system of equations is rewritten as
ζ ( α + 1 ) + c 0 + c 1 + c 2 = 0 , ζ ( α ) + c 1 + 2 c 2 = 0 , ζ ( α 1 ) + c 1 + 4 c 2 = 0 .
Solving the equations yields c 0 = 1 2 ( ζ ( 1 + α ) + 3 ζ ( α ) 2 ζ ( 1 + α ) ) , c 1 = ζ ( 1 + α ) 2 ζ ( α ) , and c 2 = 1 2 ζ ( 1 + α ) + 1 2 ζ ( α ) , which imply
b 0 = 1 Γ ( α ) 1 2 ( ζ ( 1 + α ) + 3 ζ ( α ) 2 ζ ( 1 + α ) ) , b 1 = 1 Γ ( α ) 1 + ζ ( 1 + α ) 2 ζ ( α ) , b 2 = 1 Γ ( α ) 1 2 1 + α 1 2 ζ ( 1 + α ) + 1 2 ζ ( α ) , b j = 1 j 1 + α Γ ( α ) , j = 3 , 4 ,
If we take k = 4 and solve the equations, namely,
ζ ( α + 1 ) + c 0 + c 1 + c 2 + c 3 = 0 , ζ ( α ) + c 1 + 2 c 2 + 3 c 3 = 0 , ζ ( α 1 ) + c 1 + 4 c 2 + 9 c 3 = 0 , ζ ( α 2 ) + c 1 + 8 c 2 + 27 c 3 = 0 ,
we get
c 0 = 1 6 ζ ( 2 + α ) ζ ( 1 + α ) + 11 6 ζ ( α ) ζ ( 1 + α ) , c 1 = 1 2 ζ ( 2 + α ) + 5 ζ ( 1 + α ) 6 ζ ( α ) , c 2 = 1 2 ζ ( 2 + α ) 2 ζ ( 1 + α ) + 3 2 ζ ( α ) , c 3 = 1 6 ζ ( 2 + α ) + 1 2 ζ ( 1 + α ) 1 3 ζ ( α ) ,
which imply the weight coefficients
b 0 = 1 Γ ( α ) 1 6 ζ ( 2 + α ) ζ ( 1 + α ) + 11 6 ζ ( α ) ζ ( 1 + α ) , b 1 = 1 Γ ( α ) 1 + 1 2 ζ ( 2 + α ) + 5 ζ ( 1 + α ) 6 ζ ( α ) , b 2 = 1 Γ ( α ) 1 2 1 + α + 1 2 ζ ( 2 + α ) 2 ζ ( 1 + α ) + 3 2 ζ ( α ) , b 3 = 1 Γ ( α ) 1 3 1 + α 1 6 ζ ( 2 + α ) + 1 2 ζ ( 1 + α ) 1 3 ζ ( α ) , b j = 1 Γ ( α ) 1 j 1 + α , ( j 4 ) .
To remove the stringent requirement that u ( k ) ( 0 ) = 0 for all k 4 , we introduce a corrected scheme that is applicable to smooth solutions without such boundary restrictions. Designed along the local singularity matching principle of Jin et al. [12], this strategy applies specific algebraic weights directly to the right-hand side. Denoting the spatial operator by A = Δ h and setting V n = u h ( t n ) u h ( 0 ) , the corrected scheme for the homogeneous equation reads
τ α j = 1 n b n j V j + A V n = 1 + c ¯ n ( 4 ) A v , 1 n 3 ,
where the correction coefficients are
c ¯ 1 ( 4 ) = 31 24 , c ¯ 2 ( 4 ) = 7 6 , c ¯ 3 ( 4 ) = 3 8 ,
and c ¯ n ( 4 ) = 0 for n 4 .
For the inhomogeneous equation the correction involves the source function g h ( t ) = f h ( t ) A u h ( 0 ) and its derivatives at t = 0 :
τ α j = 1 n b n j V j + A V n = g h ( t n ) + c ¯ n ( 4 ) g h ( 0 ) + = 1 3 τ d , n ( 4 ) g h ( ) ( 0 ) , 1 n 3 .
For n 4 the right-hand side reduces to g h ( t n ) . Matching the Taylor expansion of g h ( t ) at t n with the homogeneous correction factors gives the relation
d , n ( 4 ) = n ! c ¯ n ( 4 ) .
If we take k = 5 , we have
b 0 = 1 Γ ( α ) 1 24 ζ ( 3 + α ) + 10 ζ ( 2 + α ) 35 ζ ( 1 + α ) + 50 ζ ( α ) 24 ζ ( 1 + α ) , b 1 = 1 Γ ( α ) 1 + 1 6 ζ ( 3 + α ) 9 ζ ( 2 + α ) + 26 ζ ( 1 + α ) 24 ζ ( α ) , b 2 = 1 Γ ( α ) 1 2 1 + α + 1 4 ζ ( 3 + α ) + 8 ζ ( 2 + α ) 19 ζ ( 1 + α ) + 12 ζ ( α ) , b 3 = 1 Γ ( α ) 1 3 1 + α + 1 6 ζ ( 3 + α ) 7 ζ ( 2 + α ) + 14 ζ ( 1 + α ) 8 ζ ( α ) , b 4 = 1 Γ ( α ) 1 4 1 + α + 1 24 ζ ( 3 + α ) + 6 ζ ( 2 + α ) 11 ζ ( 1 + α ) + 6 ζ ( α ) , b j = 1 Γ ( α ) 1 j 1 + α , ( j 5 ) .
If we take k = 6 , we get
b 0 = 1 Γ ( α ) 1 120 [ ζ ( 4 + α ) 15 ζ ( 3 + α ) + 85 ζ ( 2 + α ) 225 ζ ( 1 + α ) + 274 ζ ( α ) 120 ζ ( 1 + α ) ] , b 1 = 1 Γ ( α ) [ 1 + 1 24 ( ζ ( 4 + α ) + 14 ζ ( 3 + α ) 71 ζ ( 2 + α ) + 154 ζ ( 1 + α ) 120 ζ ( α ) ) ] , b 2 = 1 Γ ( α ) [ 1 2 1 + α + 1 12 ζ ( 4 + α ) 13 12 ζ ( 3 + α ) + 59 12 ζ ( 2 + α ) 107 12 ζ ( 1 + α ) + 5 ζ ( α ) ] , b 3 = 1 Γ ( α ) [ 1 3 1 + α 1 12 ζ ( 4 + α ) + ζ ( 3 + α ) 49 12 ζ ( 2 + α ) + 13 2 ζ ( 1 + α ) 10 3 ζ ( α ) ] , b 4 = 1 Γ ( α ) [ 1 4 1 + α + 1 24 ζ ( 4 + α ) 11 24 ζ ( 3 + α ) + 41 24 ζ ( 2 + α ) 61 24 ζ ( 1 + α ) + 5 4 ζ ( α ) ] , b 5 = 1 Γ ( α ) [ 1 5 1 + α 1 120 ζ ( 4 + α ) + 1 12 ζ ( 3 + α ) 7 24 ζ ( 2 + α ) + 5 12 ζ ( 1 + α ) 1 5 ζ ( α ) ] , b j = 1 Γ ( α ) 1 j 1 + α , ( j 6 ) .
If we take k = 7 , we get
b 0 = 1 Γ ( α ) 1 720 [ ζ ( 5 + α ) + 21 ζ ( 4 + α ) 175 ζ ( 3 + α ) + 735 ζ ( 2 + α ) 1624 ζ ( 1 + α ) + 1764 ζ ( α ) 720 ζ ( 1 + α ) ] , b 1 = 1 Γ ( α ) [ 1 + 1 120 ( ζ ( 5 + α ) 20 ζ ( 4 + α ) + 155 ζ ( 3 + α ) 580 ζ ( 2 + α ) + 1044 ζ ( 1 + α ) 720 ζ ( α ) ) ] , b 2 = 1 Γ ( α ) [ 1 2 1 + α 1 48 ζ ( 5 + α ) + 19 48 ζ ( 4 + α ) 137 48 ζ ( 3 + α ) + 461 48 ζ ( 2 + α ) 117 8 ζ ( 1 + α ) + 15 2 ζ ( α ) ] , b 3 = 1 Γ ( α ) [ 1 3 1 + α + 1 36 ζ ( 5 + α ) 1 2 ζ ( 4 + α ) + 121 36 ζ ( 3 + α ) 31 3 ζ ( 2 + α ) + 127 9 ζ ( 1 + α ) 20 3 ζ ( α ) ] , b 4 = 1 Γ ( α ) [ 1 4 1 + α 1 48 ζ ( 5 + α ) + 17 48 ζ ( 4 + α ) 107 48 ζ ( 3 + α ) + 307 48 ζ ( 2 + α ) 33 4 ζ ( 1 + α ) + 15 4 ζ ( α ) ] , b 5 = 1 Γ ( α ) [ 1 5 1 + α + 1 120 ζ ( 5 + α ) 2 15 ζ ( 4 + α ) + 19 24 ζ ( 3 + α ) 13 6 ζ ( 2 + α ) + 27 10 ζ ( 1 + α ) 6 5 ζ ( α ) ] , b 6 = 1 Γ ( α ) [ 1 6 1 + α 1 720 ζ ( 5 + α ) + 1 48 ζ ( 4 + α ) 17 144 ζ ( 3 + α ) + 5 16 ζ ( 2 + α ) 137 360 ζ ( 1 + α ) + 1 6 ζ ( α ) ] , b j = 1 Γ ( α ) 1 j 1 + α ( j 7 ) .
Example 1. 
To confirm the theoretical convergence order of the above high-order discrete operators, we test a compatible configuration without temporal singularity. The initial condition is set to zero, u ( x , 0 ) = 0 , and the source term is taken as f ( x , t ) = t k sin ( π x ) . Under this choice, the first k 1 temporal derivatives of f vanish identically at t = 0 . Consequently, the exact solution possesses sufficient regularity at the origin and the scheme attains its formal convergence order without any starting correction.
All computations are performed with the Multiprecision Computing Toolbox (MP) at 100 decimal digits of precision, in order to circumvent the truncation limit imposed by standard IEEE 754 double-precision arithmetic. The reference solution is computed with the fully corrected scheme on a uniform mesh with τ ref = 2 14 for all k.
For clarity of presentation, Table 1 reports the results on the test grids τ { 2 3 , 2 4 , , 2 9 } together with the corresponding convergence rates. On the finest grids, the errors approach the double-precision machine floor ( 10 15 ); points falling below 10 12 are excluded from the rate computation to avoid contamination by round-off. Notably, for the k = 7 scheme, the extreme decay rate limits the valid data to only a few points before hitting the noise floor, yet the estimated rates remain theoretically consistent.
The convergence rates in Table 1 confirm that, once the singular barrier at the initial time is removed, all higher-order Zeta discrete operators attain the formal convergence order O ( τ k α ) under sufficiently fine grids and high-precision arithmetic. This confirms that the discrete operators themselves attain the formal convergence order, independently of any starting correction. In future work, we will investigate generalized multi-point starting correction strategies for these higher-order ( k = 5 , 6 , 7 ) discrete operators under incompatible source terms and nonsmooth initial data.
Remark 1. 
For m = 0 ( Re ( s ) = α + 1 > 1 ), ζ ( α + 1 ) is computed directly from the Dirichlet series, which incurs a truncation error bounded by N α / α for N terms. For m = 2 , 3 , the functional equation (59) reflects the arguments to Re ( 1 s ) > 1 , enabling evaluation via the absolutely convergent reflected series. For m = 1 , the argument maps to 1 α , which remains in the critical strip ( 0 , 1 ) ; here, evaluation typically relies on the Euler–Maclaurin summation or the alternating Dirichlet eta function. All four constants are evaluated exactly once at O ( 1 ) cost independent of the time-step count, with robust implementations readily provided by standard numerical libraries.

3. High-Order CQ Schemes

The definition of the Caputo derivative can be rewritten to establish the relationship:
0 D t α ( u ( x , t ) u 0 ( x ) ) = 0 C D t α u ( x , t ) .
By introducing the homogenized variable V ( x , t ) = u ( x , t ) u 0 ( x ) , we obtain the equivalent system with the Riemann-Liouville derivative:
0 D t α V ( x , t ) + A V ( x , t ) = A u 0 ( x ) + f ( x , t ) i n Ω × ( 0 , T ] ,
V ( x , t ) = 0 o n Ω × ( 0 , T ] ,
V ( x , 0 ) = 0 i n Ω ,
with the left-sided Riemann-Liouville fractional derivative of order α ( 0 , 1 ) defined by
0 D t α V ( x , t ) : = 1 Γ ( 1 α ) t 0 t V ( x , s ) ( t s ) α d s .
To analyze this system, we utilize the continuous Laplace transform and its associated properties. Since V ( x , 0 ) = 0 , the Caputo and Riemann-Liouville derivatives coincide. Assuming that the exact solution u ( t ) is analytically extendable to the sector | arg z | < π / 2 , the Laplace transform of the fractional derivative is well-defined as
D t α 0 C u ^ ( z ) = z α u ^ ( z ) z α 1 u ( 0 ) .
where the frequency variable z belongs to the sector Σ θ 0 with π / 2 < θ 0 < π . We define the spatial operator A as a self-adjoint positive definite second-order elliptic operator with dense domain D ( A ) = H 0 1 ( Ω ) H 2 ( Ω ) in L 2 ( Ω ) . As a strongly elliptic operator, A is sectorial: there exists an angle θ 0 ( π / 2 , π ) such that the resolvent estimate
( z I + A ) 1 C | z | 1
holds uniformly for all z in the sector Σ θ 0 = { z C { 0 } : | arg z | < θ 0 } . Consequently, A generates a bounded analytic semigroup, which implies that the solution u ( t ) can be analytically extended to a sector containing the positive real axis. This justifies the use of the Laplace transform and contour integration in the complex plane.
We now fix an angle θ ( π / 2 , θ 0 ) sufficiently close to π / 2 . For 0 < α < 1 and any z Σ θ = { z : | arg z | < θ } , we have arg ( z α ) = α θ < θ < θ 0 ; thus z α Σ θ 0 . Replacing z by z α in the resolvent estimate, we obtain
( z α I + A ) 1 C | z | α ,
valid for all z Σ θ , where C depends only on θ and α . From the operator identity A ( z α I + A ) 1 = I z α ( z α I + A ) 1 , which follows directly from the commutativity of A with its resolvent, we obtain a key relation for subsequent contour integral estimates.
Applying the Laplace transform to (Section 3) yields z α V ^ ( z ) + A V ^ ( z ) = z 1 A u 0 + f ^ ( z ) . Let Γ θ , κ be the sectorial contour defined by
Γ θ , κ = { z C : | z | = κ , | arg z | θ } { z C : z = ρ e ± i θ , ρ κ } ,
oriented with an increasing imaginary part, where κ > 0 . Then, by taking the inverse Laplace transform along this contour, the function V ( t ) can be represented as
V ( t ) = 1 2 π i Γ θ , κ e z t K ( z ) A u 0 + z K ( z ) f ^ ( z ) d z ,
with the kernel function defined by
K ( z ) : = z 1 ( z α I + A ) 1 .
To approximate the fractional derivative, we employ a high-order convolution quadrature approximation characterized by the generating function. For the sake of simplicity in the error analysis, we now focus on the homogeneous case ( f 0 ). Following the continuous formulation introduced earlier, we directly seek the fully discrete solution V n at time level t n with the initial condition V 0 = 0 . The fully discrete evolution scheme satisfies
j = 0 n b j V n j + τ α A V n = τ α A v 0 ,
where v 0 denotes the discrete initial data. Multiplying both sides of the equation by ξ n and summing from n = 1 to yields
n = 1 j = 0 n b j V n j ξ n + τ α A V ˜ ( ξ ) = ξ 1 ξ τ α A v 0 ,
where V ˜ ( ξ ) = n = 1 V n ξ n and b ˜ ( ξ ) = j = 0 b j ξ j is the generating function. Using the fact V 0 = 0 and the discrete convolution property of generating functions, the first term on the left-hand side can be directly expressed as b ˜ ( ξ ) V ˜ ( ξ ) . This leads to the frequency-domain algebraic equation:
b ˜ ( ξ ) V ˜ ( ξ ) + τ α A V ˜ ( ξ ) = ξ 1 ξ τ α A v 0 .
Extracting the common factor, the generating function of the fully discrete solution can be represented in the form of a resolvent operator:
V ˜ ( ξ ) = ξ 1 ξ τ α b ˜ ( ξ ) I + A 1 A v 0 .
It is easy to verify that the function V ˜ ( ξ ) is analytic at ξ = 0 . Hence, Cauchy’s integral theorem implies that for sufficiently small ρ , there holds
V n = 1 2 π i | ξ | = ρ 1 ξ n + 1 V ˜ ( ξ ) d ξ = 1 2 π i | ξ | = ρ 1 1 ξ 1 ξ n τ α b ˜ ( ξ ) I + A 1 A v 0 d ξ .
Upon changing the variable ξ = e z τ , we obtain
V n = 1 2 π i Γ τ e z t n τ e z τ 1 τ α b ˜ ( e z τ ) I + A 1 A v 0 d z ,
where the contour Γ τ : = { z = ln ( ρ ) / τ + i y : | y | π / τ } corresponds to the counterclockwise orientation in the ξ -plane. By continuously deforming the contour to Γ τ : = { z Γ θ , κ : | ( z ) | π / τ } and using the periodicity of the exponential function (which ensures that the integrals along the horizontal segments Im ( z ) = ± π / τ perfectly cancel each other), we obtain
V n = 1 2 π i Γ τ e z t n τ e z τ 1 τ α b ˜ ( e z τ ) I + A 1 A v 0 d z .
This integral representation forms the foundation for the subsequent error analysis and kernel function estimation.
Lemma 3.([10,11]) The term ζ ( s ) denotes the Riemann zeta function. For Re ( s ) > 1 , it is defined by the absolutely convergent Dirichlet series
ζ ( s ) = n = 1 1 n s .
It extends analytically to a meromorphic function on C whose only singularity is a simple pole at s = 1 . For s Z , the analytic continuation satisfies the functional equation
ζ ( s ) = 2 s π s 1 sin π s 2 Γ ( 1 s ) ζ ( 1 s ) .
Consequently, for any fractional parameter α ( 0 , 1 ) and integer m { 0 , 1 , 2 , 3 } , the evaluations ζ ( α + 1 m ) are finite, well-defined real constants. These constants uniquely determine the high-order correction coefficients c j for the generating function b ˜ ( ξ ) , as explicitly derived earlier.
Lemma 4. 
Let α ( 0 , 1 ) and define the discrete fractional derivative operator associated with the fully discrete 4 α order Zeta scheme as z τ ( α ) = τ α b ˜ ( e z τ ) . Assume that there exist a positive constant c 0 > 0 and an angle θ 0 ( π / 2 , π ) independent of τ, such that for any z 0 with | arg z | θ 0 , the discrete operator satisfies | z τ ( α ) | c 0 | z | α and | arg ( z τ ( α ) ) | θ 0 . Furthermore, as verified numerically in Figure 1, we assume z τ ( α ) has no zeros. Under these hypotheses, for all z Γ τ , the spectral equivalence holds:
c | z | α | z τ ( α ) | C | z | α .
Proof. 
By the hypothesis of the lemma, we directly obtain the lower bound c | z | α | z τ ( α ) | for all z Γ τ . To establish the upper bound, we first evaluate the limit as z τ 0 . Multiplying the numerator and denominator by τ α , we have:
lim z τ 0 | z τ ( α ) | | z | α = lim z τ 0 | ( z τ ) α + c 4 ( z τ ) 4 + c 5 ( z τ ) 5 + | | z τ | α = 1 .
Therefore, there exists a constant r 0 > 0 such that | z τ ( α ) | | z | α C holds for 0 < | z τ | < r 0 and z Γ τ .
On the other hand, when | z τ | r 0 , we have θ ( π 2 , θ 0 ) with θ 0 being sufficiently close to π 2 . In this case, the modulus satisfies:
| ( z ) | τ | z | τ π sin θ 2 π M 0 .
Combining this bounded domain with the empirical boundedness of the generating function verified in Figure 1, we obtain the upper bound:
| z τ ( α ) | C | z | α , for r 0 | z τ | π sin θ , z Γ τ .
This completes the proof.    □
Lemma 5. 
For the discrete operator z τ ( α ) defined in Lemma 4, and for all z on the low-frequency contour portion Γ low : = { z Γ τ : | z τ | π } , there exists a positive constant C independent of τ such that the truncation error satisfies
| z τ ( α ) z α | C τ 4 α | z | 4 .
Proof. 
From the frequency-domain discrete scheme, the truncation error can be expanded via the generating function. By the high-order construction of b ˜ ( ξ ) matching the fractional derivative symbol, the low-order error terms are precisely cancelled. Thus, for | z τ | π , we have:
| z τ ( α ) z α | = b ˜ ( e z τ ) τ α z α = c 4 z 4 τ 4 α + c 5 z 5 τ 5 α + = O ( z 4 τ 4 α ) .
Since | z τ | is bounded by π , the remainder of the power series is uniformly bounded, leading directly to the bound | z τ ( α ) z α | C τ 4 α | z | 4 . This completes the proof.    □
Theorem 2. 
Let α ( 0 , 1 ) and let u W 4 , 1 ( 0 , T ) , extended by zero to t < 0 . Here W 4 , 1 ( 0 , T ) is the Sobolev space of functions whose weak derivatives up to order 4 are integrable on ( 0 , T ) ; the zero extension implies u ( k ) ( 0 ) = 0 for k = 0 , 1 , 2 , 3 . Assume the Laplace transform u ^ ( z ) is initially analytic for Re ( z ) > 0 and admits an analytic continuation to a domain encompassing the integration contour Γ τ . Assume further that the rapid decay of u ^ ( z ) ensures Γ τ | e z t n | | z | 4 | u ^ ( z ) | | d z | < . The truncation error of the 4 α order discrete operator satisfies
| D τ α u ( t n ) 0 C D t α u ( t n ) | M τ 4 α Γ τ | e z t n | | z | 4 | u ^ ( z ) | | d z | ,
where the constant M > 0 is independent of τ and n. The discrete weights { b j } are the corresponding coefficients of the generating function b ˜ ( ξ ) , whose explicit formulations incorporated with the high-order corrections have been provided. Here, the 4 α order discrete fractional approximation operator D τ α at t n is defined as:
D τ α u ( t n ) = τ α j = 0 n b j u ( t n j ) .
Proof. 
By the causality condition, u ( t ) and its derivatives up to order 3 vanish at t = 0 , ensuring L [ D t α 0 C u ] ( z ) = z α u ^ ( z ) . The exact Caputo derivative and the discrete approximation operator evaluated at t n are expressed as:
D t α 0 C u ( t n ) = 1 2 π i Γ τ e z t n z α u ^ ( z ) d z , D τ α u ( t n ) = 1 2 π i Γ τ e z t n τ α b ˜ ( e z τ ) u ^ ( z ) d z .
Subtracting the exact derivative from the discrete operator yields the absolute truncation error:
| D τ α u ( t n ) 0 C D t α u ( t n ) | 1 2 π Γ τ | e z t n | | E ( z , τ ) | | u ^ ( z ) | | d z | ,
where E ( z , τ ) = τ α b ˜ ( e z τ ) z α . We partition the contour into Γ low = { z Γ τ : | z τ | π } and Γ high = { z Γ τ : π / sin θ > | z τ | > π } .
On Γ low , Lemma 5 directly yields
Γ low | e z t n | | E ( z , τ ) | | u ^ ( z ) | | d z | C 1 τ 4 α Γ low | e z t n | | z | 4 | u ^ ( z ) | | d z | .
On Γ high , the condition | z τ | > π gives τ 1 < | z | / π . Furthermore, for all z Γ high , the mapped variable ξ = e z τ forms a compact set strictly bounded away from the singularity at ξ = 1 . Recall from its explicit formulation (as defined in Lemma 3.3) that the generating function b ˜ ( ξ ) consists of polynomials and the polylogarithm Li 1 + α ( ξ ) , which admits an analytic continuation to the split complex plane C [ 1 , ) . Since ξ [ 1 , ) for all z Γ high , b ˜ ( ξ ) is analytic in this compact region. Therefore, the extreme value theorem guarantees its uniform boundedness, i.e., | τ α b ˜ ( e z τ ) | C 2 τ α . By the triangle inequality, | E ( z , τ ) | | τ α b ˜ ( e z τ ) | + | z | α C 2 τ α + | z | α . We bound the two terms separately. Since τ 1 < | z | / π , we have
τ α π 4 τ 4 α | z | 4 .
Raising τ 1 < | z | / π to the power 4 α gives
| z | α π α 4 τ 4 α | z | 4 .
Combining (71) and (72), the error symbol on Γ high is bounded by C 3 τ 4 α | z | 4 , where C 3 = C 2 π 4 + π α 4 . The rapid decay of u ^ ( z ) ensures integral convergence
Γ high | e z t n | | E ( z , τ ) | | u ^ ( z ) | | d z | C 3 τ 4 α Γ high | e z t n | | z | 4 | u ^ ( z ) | | d z | .
Summing (70) and (73), and setting M = max ( C 1 , C 3 ) / ( 2 π ) , concludes the proof.    □
Remark 2. 
The decay assumption on u ^ ( z ) stated earlier ensures the integral remains uniformly bounded as τ 0 . This guarantees the theoretical O ( τ 4 α ) asymptotic rate. For practical computations with any fixed τ > 0 , the truncation | z τ | π / sin θ naturally restricts Γ τ to a compact set. The continuous integrand thus trivially yields a finite integral.
Remark 3. 
The preceding error estimate relies on the assumption that the initial data and its derivatives up to order k 1 vanish at t = 0 . If any u ( m ) ( 0 ) 0 for m = 0 , 1 , , k 1 , the exact solution typically exhibits weak singularities at the initial time, which leads to a severe order reduction in the standard convolution quadrature. Instead of modifying the last few terms of the convolution sum, we are inspired by Jin et al. [12], who introduced starting correction terms in the time domain to construct high-order schemes. Motivated by this, we propose a novel approach: directly matching and constructing the starting correction terms in the frequency domain to neutralize the initial singularities. The specific construction and detailed rigorous analysis of this modified scheme will be presented in the subsequent section.

4. Corrected Schemes for Homogeneous and Inhomogeneous Problem

In this section, we derive optimal error estimates for the fully discrete scheme. The analysis is based on the representations of the semidiscrete solution V ( t n ) and the fully discrete solution V n . Subtracting the two gives:
V ( t n ) V n = I + I I ,
where the terms I and I I are given by
I = 1 2 π i Γ θ , δ Γ τ e z t n K 1 ( z ) v d z
and
I I = 1 2 π i Γ τ e z t n ( K 1 ( z ) K 2 ( z ) ) v d z .
Here the integral kernel functions K 1 ( z ) and K 2 ( z ) are defined by
K 1 ( z ) : = z 1 ( z α I + A ) 1 A = : z 1 B 1 ( z )
K 2 ( z ) : = τ e z τ 1 τ α b ˜ ( e z τ ) I + A 1 A = : μ 1 ( z ) B 2 ( z ) ,
where
μ ( z ) = τ 1 ( e z τ 1 ) ,
and
B 2 ( z ) = z τ ( α ) ( z ) I + A 1 A .
Since e z t n is uniformly bounded and decays exponentially on Γ τ , it suffices to bound K 1 ( z ) K 2 ( z ) . We first derive estimates for the auxiliary function and the high-order discrete operator.

4.1. Error Analysis of the Uncorrected Scheme

Lemma 6. 
Let μ ( z ) = τ 1 ( e z τ 1 ) . Then for all z Γ τ , there hold for some c 1 , c 2 > 0
| μ ( z ) z | c | z | 2 τ and c 1 | z | | μ ( z ) | c 2 | z | .
Proof. 
We note that | z τ | π / sin θ for z Γ τ . By means of Taylor expansion, the first assertion follows directly:
| μ ( z ) z | | z | 2 τ j = 0 ( z τ ) j ( j + 2 ) ! c | z | 2 τ z Γ τ .
Next we consider the second claim. The upper bound of μ ( z ) is trivial, so it suffices to verify the lower bound. Split the contour Γ τ into three disjoint parts: Γ τ = Γ τ + Γ τ c Γ τ . For z Γ τ + , z τ = ρ e i θ with ρ ( 0 , π / sin θ ) . By cos ( ρ sin θ ) 1 , we obtain
e z τ 1 z τ = | e ρ cos θ cos ( ρ sin θ ) 1 + i e ρ cos θ sin ( ρ sin θ ) | ρ 1 e ρ cos θ ρ c 1 > 0
due to the positivity and monotonicity of ( 1 e ρ cos θ ) / ρ as a function of ρ over the interval ( 0 , π / sin θ ] . The case of z Γ τ follows analogously. Last, we consider z Γ τ c , the circular arc. In this case, by means of Taylor expansion, we have μ ( z ) = z ( 1 + O ( z τ ) ) . From this and the fact that | z τ | < 1 , it follows directly that | μ ( z ) | c 3 | z | . This completes the proof of the lemma. □
To estimate the spatial resolvent term B 2 ( z ) , we define the high-order discrete kernel z τ ( α ) ( z ) = τ α b ˜ ( e z τ ) .
   □
Lemma 7. 
Let B 1 ( z ) = ( z α I + A ) 1 A and B 2 ( z ) = ( z τ ( α ) ( z ) I + A ) 1 A . Then for any z Γ τ , there holds:
| | B 1 ( z ) B 2 ( z ) | | C | z | 4 α τ 4 α .
Proof. 
Using the operator identity ( z α I + A ) 1 A = I z α ( z α I + A ) 1 , we can rewrite the operators as:
B 1 ( z ) = I + z α ( z α I + A ) 1 , B 2 ( z ) = I + z τ ( α ) ( z ) ( z τ ( α ) ( z ) I + A ) 1 .
By subtracting them and inserting cross terms, we obtain
| | B 1 ( z ) B 2 ( z ) | | | z α z τ ( α ) ( z ) | · | | ( z τ ( α ) ( z ) I + A ) 1 | | + | z | α · | | ( z τ ( α ) ( z ) I + A ) 1 ( z τ ( α ) ( z ) z α ) ( z α I + A ) 1 | | .
Based on the resolvent estimate of the sectorial operator | | ( z α I + A ) 1 | | c | z | α and the bound provided that | | ( z τ ( α ) ( z ) I + A ) 1 | | c | z τ ( α ) ( z ) | 1 C | z | α , we deduce:
B 1 ( z ) B 2 ( z ) C | z | α z τ ( α ) ( z ) z α + C | z | α | z | α z τ ( α ) ( z ) z α | z | α C | z | α z τ ( α ) ( z ) z α .
we finally arrive at | | B 1 ( z ) B 2 ( z ) | | C | z | α · | z | K τ 4 α = C | z | 4 α τ 4 α .
   □
Lemma 8. 
Let K 1 ( z ) = z 1 ( z α I + A ) 1 A and K 2 ( z ) = μ 1 ( z ) ( z τ ( α ) ( z ) I + A ) 1 A . Then for any z Γ τ , there holds
| | K 1 ( z ) K 2 ( z ) | | C | z | α τ .
Proof. 
By subtracting the operators and inserting a cross term, we decompose the norm as:
| | K 1 ( z ) K 2 ( z ) | | | z μ ( z ) | | z | | μ ( z ) | | | B 1 ( z ) | | + | μ ( z ) | 1 | | B 1 ( z ) B 2 ( z ) | | .
From Lemma 3.1, | z μ ( z ) | c | z | 2 τ and | μ ( z ) | c 1 | z | . Together with the sectorial resolvent estimate B 1 ( z ) C | z | α , the first term is bounded by C | z | α τ . For the second term, we apply the high-order bound B 1 ( z ) B 2 ( z ) C | z | 3 α τ 4 α from Lemma 4.2. Note | z τ | π sin θ C 0 uniformly on Γ τ , with α ( 0 , 1 ) . Thereforce:
| | K 1 ( z ) K 2 ( z ) | | C | z | α τ + C | z | α ( | z | τ ) 4 α C | z | α τ .
This completes the proof.
   □
Theorem 3. 
Let V ( t n ) and V n be the semidiscrete and fully discrete homogeneous solutions, respectively. Then the total temporal discretization error satisfies E = V ( t n ) V n O ( t n α 1 τ ) .
Proof. 
The total error is decomposed into I + I I . By the preceding lemmas, we estimate I I directly:
| | I I | | 1 2 π Γ τ | e z t n | · | | K 1 ( z ) K 2 ( z ) | | · | | v | | | d z | C τ | | v | | Γ τ | e z t n | | z | α | d z | .
Using the change of variables s = z t n ( d z = t n 1 d s ), we have:
Γ τ | e z t n | | z | α | d z | = t n α 1 Γ τ | e s | | s | α | d s | .
Since the integral Γ τ | e s | | s | α | d s | converges to a finite constant independent of t n , we obtain | | I I | | C t n α 1 τ .
Similarly, the error for term I is bounded by:
| | I | | C τ | | v | | Γ τ | e z t n | | z | α | d z | .
Applying the identical substitution s = z t n , we compute:
| | I | | C τ | | v | | t n α 1 Γ τ | e s | | s | α | d s | C t n α 1 τ .
By the triangle inequality | | E | | | | I | | + | | I I | | , the proof is complete.    □
Remark 4. 
The proof shows that although the CQ operator z τ ( α ) z α in the high-order scheme attains O ( τ 4 α ) accuracy, the overall truncation error is dominated by the O ( τ ) error between z and μ ( z ) in the first term. This forms the algebraic bottleneck for further accuracy improvement.

4.2. Corrected Schemes for Nonsmooth Problems

In the generating function framework, the discrete time-stepping operator is encoded in the function
μ ( z ) = e z τ 1 τ ,
which appears in the contour integral representation of the numerical solution. Let K 1 ( z ) = z 1 ( z α I + A ) 1 A be the continuous solution kernel and K 2 ( z ) = μ 1 ( z ) ( z τ ( α ) ( z ) I + A ) 1 A the kernel induced by the standard L1 discretisation. As established in Lemma 4.3, the discrepancy between these two kernels satisfies
K 1 ( z ) K 2 ( z ) C | z | α τ , z Γ τ .
The root cause of this saturation is the first-order accuracy of μ ( z ) as an approximation to z, namely | μ ( z ) z | = O ( | z | 2 τ ) . To break this barrier we replace μ ( z ) by a corrected prefactor μ ¯ ( z ) that approximates z to higher order, thereby realigning the accuracy of the two kernel layers in the contour integral representation.
The construction starts from the elementary identity
z τ = ln 1 + ( e z τ 1 ) = ln ( 1 + τ μ ( z ) ) .
Expanding the logarithm with the Mercator series ln ( 1 + x ) = j = 1 ( 1 ) j 1 j x j and substituting x = τ μ ( z ) yields the formal power series representation
z = 1 τ j = 1 ( 1 ) j 1 j ( τ μ ( z ) ) j = j = 1 ( 1 ) j 1 τ j 1 j μ j ( z ) .
Truncating the infinite series at the K-th term defines the order-K correction prefactor
μ ¯ ( z ) = j = 1 K ( 1 ) j 1 τ j 1 j μ j ( z ) .
By construction the residual satisfies
μ ¯ ( z ) z = O τ K μ ( z ) K + 1 = O ( z K + 1 τ K ) ,
because μ ( z ) = z + O ( z 2 τ ) . The integer K controls the formal accuracy: larger K eliminates more low-order error terms in the kernel expansion.
Setting K = 4 in (99) gives the explicit expression
μ ¯ ( z ) = μ ( z ) τ 2 μ 2 ( z ) + τ 2 3 μ 3 ( z ) τ 3 4 μ 4 ( z ) .
For the subsequent analysis it is convenient to introduce the scaled variable
w = z τ ,
so that τ μ ( z ) = e w 1 and consequently
μ ¯ ( z ) = 1 τ Φ K ( w ) , Φ K ( w ) = j = 1 K ( 1 ) j 1 j ( e w 1 ) j .
The function Φ K ( w ) is precisely the K-th order Taylor polynomial of ln ( 1 + ( e w 1 ) ) = w centred at w = 0 . For K = 4 , factoring out the common factor ( e w 1 ) yields
Φ 4 ( w ) = ( e w 1 ) P 4 ( e w ) ,
where P 4 ( Y ) is the cubic polynomial
P 4 ( Y ) = 1 Y 1 2 + ( Y 1 ) 2 3 ( Y 1 ) 3 4 = 1 12 25 23 Y + 13 Y 2 3 Y 3 .
On the rays of the integration contour Γ τ ± defined in Lemma 10 below, we have Re ( z τ ) < 0 , hence | e z τ | < 1 . For the error analysis it is essential that μ ¯ ( z ) does not vanish on the contour. By the factorisation (104) this is guaranteed if P 4 ( Y ) has no root inside the closed unit disk | Y | 1 . The following classical result [15,16] provides a convenient sufficient condition.
Lemma 9. 
[15] [16] Let Q 0 ( Y ) = j = 0 n a j ( 0 ) Y j be a polynomial of degree n with complex coefficients. For k = 0 , 1 , , n 1 , define the sequence
Q k + 1 ( Y ) = a 0 ( k ) ¯ Q k ( Y ) a n k ( k ) Q k * ( Y ) ,
where Q k * ( Y ) = j = 0 n k a n k j ( k ) ¯ Y j is the reciprocal polynomial of Q k , and a 0 ( k ) , a n k ( k ) denote respectively the constant term and the leading coefficient of Q k . If the strict inequalities
| a 0 ( k ) | > | a n k ( k ) | , k = 0 , 1 , , n 1 ,
hold for every step, then all roots of Q 0 ( Y ) lie strictly outside the unit disk { Y C : | Y | 1 } .
We apply Lemma 9 to Q ( Y ) = 12 P 4 ( Y ) = 3 Y 3 + 13 Y 2 23 Y + 25 (clearing the denominator does not affect the root locations). The coefficients are
a 0 ( 0 ) = 25 , a 1 ( 0 ) = 23 , a 2 ( 0 ) = 13 , a 3 ( 0 ) = 3 .
For k = 0 , | a 0 ( 0 ) | = 25 > 3 = | a 3 ( 0 ) | . The reciprocal polynomial is Q 0 * ( Y ) = 3 + 13 Y 23 Y 2 + 25 Y 3 , hence
Q 1 ( Y ) = 25 Q 0 ( Y ) ( 3 ) Q 0 * ( Y ) = 256 Y 2 536 Y + 616 .
For k = 1 , | a 0 ( 1 ) | = 616 > 256 = | a 2 ( 1 ) | . With Q 1 * ( Y ) = 256 536 Y + 616 Y 2 ,
Q 2 ( Y ) = 616 Q 1 ( Y ) 256 Q 1 * ( Y ) = 192960 Y + 313920 .
For k = 2 , | a 0 ( 2 ) | = 313920 > 192960 = | a 1 ( 2 ) | . All three inequalities are satisfied. Lemma 9 therefore guarantees that every root of Q ( Y ) , and consequently of P 4 ( Y ) , lies strictly outside | Y | 1 . Thus for all z on the rays Γ τ ± where | e z τ | < 1 , we have P 4 ( e z τ ) 0 . Since e z τ 1 on these rays, (104) implies Φ 4 ( z τ ) 0 , which is equivalent to μ ¯ ( z ) 0 by (103).
Lemma 10. 
Let Γ be the Hankel-type contour consisting of the two rays
Γ ± = { r e ± i θ : r 0 r π / sin θ } , θ ( π / 2 , π ) ,
and a connecting circular arc Γ c of radius r 0 > 0 . Define Γ τ = { z C : z τ Γ } . For K = 4 and every z Γ τ , there exist constants c , C > 0 , independent of τ, such that
c | z | | μ ¯ ( z ) | C | z | ,
and the approximation error satisfies
| μ ¯ ( z ) z | C | z | 5 τ 4 .
Proof. 
Set w = z τ Γ . From (103), μ ¯ ( z ) = τ 1 Φ 4 ( w ) . Truncating the Mercator series at j = 4 gives
w = ln 1 + ( e w 1 ) = Φ 4 ( w ) + 1 5 ( e w 1 ) 5 + O ( e w 1 ) 6 .
Since e w 1 = w + O ( w 2 ) , we have ( e w 1 ) 5 = w 5 + O ( w 6 ) , and therefore
Φ 4 ( w ) = w 1 5 w 5 + O ( w 6 ) .
Hence Φ 4 ( w ) w = O ( w 5 ) , which directly implies | μ ¯ ( z ) z | = τ 1 | Φ 4 ( w ) w | C | z | 5 τ 4 , proving (113).
We now turn to (112). On the rays Γ τ ± , Re ( w ) < 0 and | e w | < 1 . As shown above, P 4 ( e w ) 0 and e w 1 , so Φ 4 ( w ) 0 . Define F ( w ) = Φ 4 ( w ) / w for w 0 , and F ( 0 ) = Φ 4 ( 0 ) = 1 . The function F is analytic on the compact set Γ ± and never vanishes there. By the extreme value theorem, there exist c θ , C θ > 0 with
c θ | F ( w ) | C θ w Γ ± .
Multiplying by | w | / τ = | z | yields (112) on Γ τ ± .
On the circular arc Γ τ c , | w | = r 0 . Because lim w 0 Φ 4 ( w ) / w = 1 , we may select r 0 ( 0 , 1 ) sufficiently small so that | Φ 4 ( w ) / w 1 | 1 / 2 for all | w | r 0 . The triangle inequality then gives 1 2 | w | | Φ 4 ( w ) | 3 2 | w | , which translates to c | z | | μ ¯ ( z ) | C | z | on Γ τ c . Combining the estimates on the three pieces of Γ τ completes the proof.    □
The same construction principle applies to any fixed order K 1 . The polynomial P K ( Y ) , defined implicitly by Φ K ( w ) = ( e w 1 ) P K ( e w ) , can be verified to satisfy the Schur–Cohn criterion for each fixed K by a finite number of elementary operations, guaranteeing that Φ K ( w ) 0 on the contour. The resulting prefactor then achieves | μ ¯ ( z ) z | = O ( z K + 1 τ K ) , providing a systematic route to arbitrarily high-order starting correction schemes.
Lemma 11. 
Let K ˜ 2 ( z ) = μ ¯ 1 ( z ) ( z τ ( α ) ( z ) I + A ) 1 A . Assuming the fractional order is 0 < α < 1 and the time step satisfies 0 < τ T for a fixed final time T, for any z Γ τ , there exists a constant C > 0 such that
| | K 1 ( z ) K ˜ 2 ( z ) | | C τ 4 α ( | z | 2 α + | z | 3 α ) .
Proof. 
By subtracting the operators and inserting a cross term, the norm decomposes as:
| | K 1 ( z ) K ˜ 2 ( z ) | | | z μ ¯ ( z ) | | z | | μ ¯ ( z ) | | | B 1 ( z ) | | + | μ ¯ ( z ) | 1 | | B 1 ( z ) B ˜ 2 ( z ) | | .
From the mapping bounds : | μ ¯ ( z ) z | C | z | 5 τ 4 and | μ ¯ ( z ) | c | z | . Given the spatial resolvent norm | | B 1 ( z ) | | C | z | α , the first term yields:
| z μ ¯ ( z ) | | z | | μ ¯ ( z ) | | | B 1 ( z ) | | C | z | 5 τ 4 c | z | 2 · C | z | α = C τ 4 | z | 3 α .
From the spatial approximation bound, | | B 1 ( z ) B ˜ 2 ( z ) | | C τ 4 α | z | 3 α . For the second term, we have
| μ ¯ ( z ) | 1 | | B 1 ( z ) B ˜ 2 ( z ) | | c 1 | z | 1 · C τ 4 α | z | 4 α = C τ 4 α | z | 3 α .
Summing these bounds completes the proof.
   □
Theorem 4. 
Let V ˜ h n be the fully discrete homogeneous solution of the corrected scheme.For nonsmooth initial data v L 2 ( Ω ) , the L 2 -norm temporal discretization error E ˜ = V ( t n ) V ˜ n satisfies:
| | E ˜ | | C t n 4 τ 4 + t n α 4 τ 4 α | | v | | .
Proof. 
The total error in the L 2 -norm is decomposed into the outer and inner contour integral components I + I I .
For the inner contour integral I I , substituting the kernel difference bound from Lemma 4.2 yields
| | I I | | 1 2 π Γ τ | e z t n | · | | K 1 ( z ) K ˜ 2 ( z ) | | · | | v | | | d z | C τ 4 α | | v | | Γ τ | e z t n | | z | 3 α | d z | .
Utilizing the properties of the Gamma function, the above integral can be evaluated as
Γ τ | e z t n | | z | 3 α | d z | C 0 e r t n | cos θ | r 3 α d r = C t n α 3 .
This derives | | I I | | C t n α 4 τ 4 α | | v | | .
For the outer contour integral I, on Γ θ , δ Γ τ we have | z | = r π τ sin θ . Extracting the Kth-order temporal scaling term gives r 4 C τ 4 . Combining with the L 2 resolvent estimate K 1 ( z ) C | z | 1 and matching orders yields
| | I | | C | | v | | π τ sin θ e r t n | cos θ | r 1 d r = C | | v | | π τ sin θ e r t n | cos θ | r 3 · r 4 d r .
The lower integration limit to 0 gives a strict upper bound:
| | I | | C τ 4 | | v | | 0 e r t n | cos θ | r 3 d r = C t n 4 τ 4 | | v | | .
By the triangle inequality | | E ˜ | | | | I | | + | | I I | | , and recognizing that for the given fractional parameter α ( 0 , 1 ) the term τ 4 α dominates the overall truncation error, the theorem is proved. □
   □

4.3. Corrected Scheme for Smooth Cases

Having discussed the L 2 space estimates for non-smooth initial data, we now address the problem under smooth initial conditions. Here, we define u ( 0 ) = v D ( A ) = H 2 ( Ω ) H 0 1 ( Ω ) .
Lemma 12. 
Let the continuous and discrete smooth kernel functions be defined as K 1 s ( z ) = z 1 ( z α I + A ) 1 and K 2 s ( z ) = μ ¯ 1 ( z ) ( z τ ( α ) ( z ) I + A ) 1 , respectively. For any z Γ τ , there exists a constant C > 0 such that:
| | K 1 s ( z ) K 2 s ( z ) | | C τ 4 α | z | 3 2 α .
Proof. 
Utilizing operator difference, the norm is bounded by:
| | K 1 s ( z ) K 2 s ( z ) | | | z 1 μ ¯ 1 ( z ) | · | | B 1 s ( z ) | | + | μ ¯ 1 ( z ) | · | | B 1 s ( z ) B 2 s ( z ) | | ,
where B 1 s ( z ) = ( z α I + A ) 1 and B 2 s ( z ) = ( z τ ( α ) ( z ) I + A ) 1 . For the first term, from previous bounds, it is easy to obtain
| z 1 μ ¯ 1 ( z ) | · | | B 1 s ( z ) | | C | z | 3 α τ 5 .
For the second term, applying the resolvent identity along with the operator estimates yields:
| μ ¯ 1 ( z ) | · | | B 1 s ( z ) B 2 s ( z ) | | C | z | 1 · | | B 1 s ( z ) | | · | | B 2 s ( z ) | | · | z τ ( α ) ( z ) z α | C | z | 1 · | z | α · | z | α · | z | K τ 4 α = C τ 4 α | z | 3 2 α .
Combining both terms strictly derives | | K 1 s ( z ) K 2 s ( z ) | | C τ 4 α | z | 3 2 α .    □
Theorem 5. 
Let V ˜ ( t n ) be the numerical solution under the corrected scheme. For smooth initial data v D ( A ) with U 0 = v = R h v , the total error E ˜ s = V ( t n ) V ˜ n measured in the L 2 -norm satisfies:
| | E ˜ s | | C t n 2 α 4 τ 4 + t n 2 α 4 τ 4 α | | A v | | .
Proof. 
The error is decomposed into the outer and inner contour integrals I s + I I s :
E ˜ s = 1 2 π i Γ θ , δ Γ τ e z t n K 1 s ( z ) A v d z + 1 2 π i Γ τ e z t n ( K 1 s ( z ) K 2 s ( z ) ) A v d z .
Analogous to the proof strategy for | | E ˜ | | in Theorem 4.5, the inner integral I I s can be bounded as
| | I I s | | 1 2 π Γ τ | e z t n | · | | K 1 s ( z ) K 2 s ( z ) | | · | | A v | | | d z | C τ 4 α | | A v | | Γ τ | e z t n | | z | 4 2 α | d z | C t n 2 α 4 τ 4 α | | A v | | .
Similarly, for the outer integral I s , extracting the 4th-order scaling term and using smooth-state estimates gives
I s C t n 2 α 4 τ 4 A v .
Combining bounds for I s and I I s via the triangle inequality, the scheme attains the optimal temporal convergence order O ( τ 4 α ) .    □
Remark 5. 
Theorems 4 and 5 reveal the core difference in error behavior of the corrected scheme between nonsmooth initial data v L 2 ( Ω ) and smooth initial data v D ( A ) . With higher spatial regularity, the singularity of the temporal discretization error as t n 0 weakens from t n α 4 to t n 2 α 4 . The singularity persists even for smooth initial data, reflecting the limited smoothing effect of the fractional derivative operator.
The high-order discrete symbol μ ¯ ( z ) is constructed to approximate the continuous fractional operator z 1 with O ( τ 4 α ) accuracy. For the homogeneous problem, the equivalent constant source term has a low-frequency truncation deficit in the discrete Laplace domain. To correct this, we perform high-order asymptotic expansion of the discrete generating function as ω = z τ 0 .
Table 2. Starting correction coefficients c j ¯ ( K ) for the K-th order corrected μ ¯ schemes.
Table 2. Starting correction coefficients c j ¯ ( K ) for the K-th order corrected μ ¯ schemes.
K c 1 ¯ ( K ) c 2 ¯ ( K ) c 3 ¯ ( K ) c 4 ¯ ( K ) c 5 ¯ ( K ) c 6 ¯ ( K )
K = 4 31 24 7 6 3 8
K = 5 1181 720 177 80 341 240 251 720
K = 6 2837 1440 2543 720 17 5 1201 720 95 288
K = 7 138241 60480 309047 60480 198251 30240 145877 30240 23077 12096 19087 60480
Table 3. Starting correction coefficients d , n ( K ) for high-order Zeta schemes.
Table 3. Starting correction coefficients d , n ( K ) for high-order Zeta schemes.
K d , 1 ( K ) d , 2 ( K ) d , 3 ( K ) d , 4 ( K ) d , 5 ( K ) d , 6 ( K )
K = 4 = 1 31 24 7 3 9 8
= 2 31 48 7 3 27 16
= 3 31 144 14 9 27 16
K = 5 = 1 1181 720 177 40 341 80 251 180
= 2 1181 1440 177 40 1023 160 251 90
= 3 1181 4320 59 20 1023 160 502 135
= 4 1181 17280 59 40 3069 640 502 135
K = 6 = 1 2837 1440 2543 360 51 5 1201 180 475 288
= 2 2837 2880 2543 360 153 10 1201 90 2375 576
= 3 2837 8640 2543 540 153 10 2402 135 11875 1728
= 4 2837 34560 2543 1080 459 40 2402 135 59375 6912
= 5 2837 172800 2543 2700 1377 200 9608 675 59375 6912
K = 7 = 1 138241 60480 309047 30240 198251 10080 145877 7560 115385 12096 19087 10080
= 2 138241 120960 309047 30240 198251 6720 145877 3780 576925 24192 19087 3360
= 3 138241 362880 309047 45360 198251 6720 145877 2835 2884625 72576 19087 1680
= 4 138241 1451520 309047 90720 198251 8960 145877 2835 14423125 290304 19087 1120
= 5 138241 7257600 309047 226800 594753 44800 583508 14175 14423125 290304 57261 2800
= 6 138241 43545600 309047 680400 594753 89600 1167016 42525 72115625 1741824 57261 2800

5. Error Analysis for the Inhomogeneous Problem

We now extend the corrected scheme to the inhomogeneous equation,where g ( t ) = f ( t ) A v and v = u ( 0 ) . The homogeneous problem treated in the previous sections corresponds to the special case g ( t ) A v , i.e., a constant source.
The correction coefficients c ¯ n ( 4 ) ( n = 1 , 2 , 3 ) were determined in Section 4.1 by requiring that the homogeneous scheme be exact for the leading singular modes of the continuous solution. For the inhomogeneous equation the source g ( t ) is no longer constant; its variation in time introduces additional low-order errors that must also be compensated. The key observation is that, by linearity, the correction for a variable source can be obtained by Taylor-expanding g ( t ) about t = 0 and correcting each monomial term individually.
Assume that g is sufficiently smooth and write
g ( t ) = g ( 0 ) + t g ( 0 ) + t 2 2 g ( 0 ) + t 3 6 g ( 0 ) + R ( t ) ,
where the remainder R ( t ) = O ( t 4 ) does not affect the leading-order error and requires no correction. Evaluating (132) at the discrete time levels t n = n τ gives
g ( t n ) = g ( 0 ) + n τ g ( 0 ) + n 2 τ 2 2 g ( 0 ) + n 3 τ 3 6 g ( 0 ) + R ( t n ) .
The constant term g ( 0 ) is precisely of the same form as the homogeneous source A v ; its correction is therefore identical to the homogeneous case. The terms involving g ( 0 ) , g ( 0 ) , g ( 0 ) are new and require separate treatment.
Consider the contribution of the -th derivative term t ! g ( ) ( 0 ) to the right-hand side. At time t n this term evaluates to n τ ! g ( ) ( 0 ) . In the continuous equation, the response of the system to a source proportional to t is ! times weaker than its response to a constant source of the same pointwise magnitude. Consequently, the correction needed for this term inherits the same relative factor c ¯ n ( 4 ) as the constant-source correction, weighted by the Taylor coefficient n ! . Formally, matching the discrete correction term τ d , n ( 4 ) g ( ) ( 0 ) with the Taylor contribution ( n τ ) ! c ¯ n ( 4 ) g ( ) ( 0 ) yields the relation
d , n ( 4 ) = n ! c ¯ n ( 4 ) , = 1 , 2 , 3 , n = 1 , 2 , 3 .
For n 4 , c ¯ n ( 4 ) = 0 and consequently d , n ( 4 ) = 0 for all ; no correction is applied beyond the third time step.
Theorem 6. 
Let V n be the numerical solution of the corrected fully discrete scheme and V ( t n ) the exact continuous solution. Suppose f C 4 ( 0 , T ; L 2 ( Ω ) ) (which implies g h C 3 ( [ 0 , T ] ; L 2 ( Ω ) ) ) and 0 t n ( t n s ) 2 α 1 g ( 4 ) ( s ) d s < .
There exists a constant C > 0 , independent of τ and h, subject to the initial condition u ( 0 ) = v D ( A ) (such that A v L 2 ( Ω ) ), such that for all t n > 0
V n V ( t n ) C τ 4 α t n 2 α 4 A v + g ( 0 ) + = 1 3 t n 2 α 5 + g ( ) ( 0 ) + 0 t n ( t n s ) 2 α 1 g ( 4 ) ( s ) d s .
Proof. 
The Taylor expansion of the total source term g ( t ) = A v + f ( t ) at t = 0 gives
g ( t ) = = 0 2 t ! g ( ) ( 0 ) + R 3 ( t ) ,
where R 3 ( t ) = t 3 3 ! g ( 3 ) ( 0 ) + 0 t ( t s ) 3 3 ! g ( 4 ) ( s ) d s .
Using the Laplace transform identity L { t / ! } = z 1 , we obtain
g ^ h ( z ) = = 0 2 z 1 g ( ) ( 0 ) + R ^ 3 ( z ) ,
where R ^ 3 ( z ) = z 4 g ( 3 ) ( 0 ) + L 0 t ( t s ) 3 3 ! g ( 4 ) ( s ) d s .
The exact continuous solution is given by the inverse Laplace transform
V ( t n ) = 1 2 π i Γ e z t n ( z α I + A ) 1 = 0 2 z 1 g ( ) ( 0 ) + R ^ 4 ( z ) d z .
Applying the discrete Laplace transform V ^ τ ( z ) = n = 1 V n ζ n (where ξ = e z τ ) to the fully discrete scheme yields ( z τ ( α ) I + A ) V ^ τ ( z ) = g ^ τ ( z ) . To incorporate the starting corrections, we introduce the generating functions M 0 ( ζ ) = ζ 1 ζ + n = 1 3 c n ¯ ( 4 ) ζ n and M ( ζ ) = n = 1 n ! ζ n + n = 1 3 d , n ( 4 ) ζ n , which satisfy the asymptotic relation τ + 1 M ( e z τ ) = z 1 + O ( τ 4 | z | 3 ) . Denoting the discrete transform of the remainder as R ^ 3 , τ ( z ) = n = 1 R 3 ( t n ) ζ n , the expanded source term in the frequency domain is
g ^ τ ( z ) = = 0 2 τ + 1 M ( ζ ) g ( ) ( 0 ) + τ R ^ 3 , τ ( z ) .
The frequency-domain solution is
V ^ τ ( z ) = ( z τ ( α ) I + A ) 1 = 0 2 τ + 1 M ( ζ ) g ( ) ( 0 ) + τ R ^ 3 , τ ( z ) .
Applying the inverse discrete Laplace transform over the contour Γ τ , the numerical solution is recovered as
V n = 1 2 π i Γ τ e z t n ( z τ ( α ) I + A ) 1 = 0 2 τ + 1 M ( ζ ) g ( ) ( 0 ) + τ R ^ 3 , τ ( z ) d z .
Thus,the error between the discrete solution and the exact solution is
| V n V ( t n ) | = = 0 2 I + I R
For each ( 0 , 1 3 ) , I is split into the tail error outside Γ τ and the approximation error inside Γ τ
I = 1 2 π i Γ Γ τ e z t n ( z α I + A ) 1 z 1 g ( ) ( 0 ) d z + 1 2 π i Γ τ e z t n ( z α I + A ) 1 z 1 ( z τ ( α ) I + A ) 1 τ + 1 M ( ζ ) g ( ) ( 0 ) d z .
The tail error is bounded by C τ 4 α t n 2 α 4 + g ( ) ( 0 ) . Inside Γ τ , using the operator difference bound from lemma 4.7 ( z α I + A ) 1 ( z τ ( α ) I + A ) 1 C τ 4 α | z | 4 2 α yields
( z α I + A ) 1 z 1 ( z τ ( α ) I + A ) 1 τ + 1 M ( ζ ) ( z α I + A ) 1 ( z τ ( α ) I + A ) 1 | z | 1 + ( z τ ( α ) I + A ) 1 z 1 τ + 1 M ( ζ ) C τ 4 α | z | 3 2 α .
By analogy with the proof of | | I | | in Theorem 4.2, integrating this bound over the ray portions of Γ τ and applying the change of variables ρ = r t n ( d r = d ρ / t n ) yields:
C τ 4 α 1 / t n π τ sin θ e c r t n r 3 2 α d r = C τ 4 α t n 2 α 4 + 1 e c ρ ρ 3 2 α d ρ C τ 4 α t n 2 α 4 + .
For the remainder I R , we decompose R 3 ( t ) into a polynomial part and a convolution part: R 3 ( t ) = R 3 1 ( t ) + R 3 2 ( t ) , where R 3 1 ( t ) = t 3 3 ! g ( 3 ) ( 0 ) and R 3 2 ( t ) = 0 t ( t s ) 3 3 ! g ( 4 ) ( s ) d s . Correspondingly, the error is split as I R = I 3 + I c .
For the polynomial term R 3 1 ( t ) , integration over the z 4 pole ( = 3 ) yields[3]:
I 3 C τ 4 α t n 2 α 1 g ( 3 ) ( 0 ) .
For the convolution part I c
I c C τ 4 α 0 t n ( t n s ) 2 α 1 g ( 4 ) ( s ) d s .
Combining the bounds for I 0 to I 3 and I c completes the proof. Similarly, by making relevant smoothness assumptions on the nonlinear term f.    □

6. Numerical Simulations

The numerical implementation of the high-order Zeta scheme decouples the precomputation of coefficients from the time evolution to ensure reproducibility and computational efficiency.
The Caputo integration kernel ( t s ) α induces a weak singularity at t = 0 . For solutions lacking sufficient vanishing initial derivatives, this restricts temporal regularity and severely reduces the convergence order of high-order schemes, necessitating starting corrections.
This section empirically validates the temporal convergence. Spatial discretization employs linear finite elements with a consistent mass matrix ( N x = 64 ). To isolate temporal errors, numerical solutions are compared against a fully corrected reference solution on an ultra-fine mesh ( τ ref = 2 14 ). We report L 2 -norm errors at T = 1.0 and local convergence orders log 2 ( e 2 τ / e τ ) . Rate calculations strictly omit errors below 5 × 10 14 (to suppress machine precision contamination) and the coarsest grid pair 2 3 2 4 (to avoid pre-asymptotic order inflation). The average convergence order over valid pairs is reported for each α .
The experiments are structured progressively: verifying baseline homogeneous cases, introducing source incompatibility, testing polynomial compatibility, examining source regularity limits, and establishing the empirical regularity threshold.

6.1. Numerical Implementation and Time Evolution

The numerical implementation of the high-order Zeta scheme decouples the precomputation of coefficients from the time evolution to ensure reproducibility and computational efficiency.
The spatial domain is discretized via linear finite elements on a uniform mesh of size h. To strictly preserve the high-order accuracy, we utilize the exact consistent mass matrix rather than mass lumping. This yields the standard tridiagonal mass matrix M and stiffness matrix S :
M = h 6 4 1 1 1 1 4 , S = 1 h 2 1 1 1 1 2 .
Both matrices are assembled in sparse formats, and the initial condition u 0 is projected onto this discrete space.
The convolution weights b j and the starting correction coefficients c ¯ n are computed once prior to the time loop, following their exact analytical definitions established in Section 2 and Section 3. For our baseline 4th-order experiments ( K = 4 ), the starting corrections are applied strictly to the first 3 time steps and take the exact values c ¯ 1 ( 4 ) = 31 24 , c ¯ 2 ( 4 ) = 7 6 , and c ¯ 3 ( 4 ) = 3 8 .
For the inhomogeneous equation, the correction also involves the source term g h ( t ) = M f ( t ) S u 0 and its time derivatives at t = 0 . Matching the Taylor expansion of g h ( t ) with the homogeneous correction factors yields the auxiliary derivative-correction coefficients:
d , n ( 4 ) = n ! c ¯ n ( 4 ) , = 1 , , K 1 .
For high-order schemes ( K 5 ), calculating these coefficients using standard IEEE 754 double-precision arithmetic leads to a severe loss of significant digits due to the ill-conditioned Vandermonde matrices. To address this, the coefficient generation is executed using the Advanpix Multiprecision Computing Toolbox (MP) for MATLAB at 100 decimal digits. After accurately generating b j and c ¯ n , they are cast back to double-precision arrays. This strategy confines the rounding errors entirely to the initialization phase without inflating the computational cost of the time-stepping loop.
Since the implicit discrete operator is time-independent, the coefficient matrix A = S + τ α b 0 M is assembled and LU-factorized only once. For each time step n = 1 , , N t , the fully discrete scheme reads:
A V n = M f ( t n ) S u 0 τ α M j = 1 n 1 b n j V j + C ( n ) ,
where V n represents the homogenized discrete solution, and the correction vector C ( n ) is active only for n K 1 :
C ( n ) = c ¯ n ( K ) g h ( 0 ) + = 1 K 1 τ d , n ( K ) g h ( ) ( 0 ) , 1 n K 1 ,
with g h ( 0 ) = M f ( 0 ) S u 0 . For n K , the right-hand side reduces to M f ( t n ) S u 0 . The solution V n is obtained via rapid forward and backward substitution using the precomputed LU factors.
Errors are evaluated against the reference solution V ref measured in the mass-weighted L 2 -norm: e L 2 = e T M e .

6.2. Numerical Examples

Numerical experiments test the proposed scheme across six scenarios. The spatial domain is Ω = ( 0 , 1 ) with final time T = 1.0 . We apply piecewise linear finite elements on a uniform mesh with h = 1 / 64 . The nonsmooth initial data u 0 ( x ) = χ ( 0 , 0.5 ) is discretized via a lumped-mass L 2 -projection. Average rates are computed via log-linear regression, excluding the coarsest step τ = 2 3 to avoid pre-asymptotic pollution. The reference solution is generated by the Zeta scheme with K = 4 at τ = 2 14 . Furthermore, a systematic comparison against the corrected Gao and Cao schemes of [2] is included to evaluate pre-asymptotic stability.
Example 2. 
Consider the homogeneous equation:
D t α 0 C u ( x , t ) Δ u ( x , t ) = 0 , 0 < x < 1 , t > 0 ,
u ( 0 , t ) = u ( 1 , t ) = 0 ,
u ( x , 0 ) = u 0 ( x ) ,
where Case (I) takes u 0 ( x ) = sin ( π x ) , and Case (II) takes u 0 ( x ) = χ ( 0 , 0.5 ) .
Table 4 lists the errors and convergence orders. Uncorrected steps (Scheme A) limit the rate to O ( τ ) due to the singularity at t = 0 . Scheme B recovers the theoretical O ( τ 4 α ) rate. The correction remains effective under nonsmooth initial data.
Example 3. 
Consider inhomogeneous problems with smooth sources:
D t α 0 C u ( x , t ) Δ u ( x , t ) = f ( x , t ) , 0 < x < 1 , t > 0 ,
u ( 0 , t ) = u ( 1 , t ) = 0 ,
u ( x , 0 ) = sin ( π x ) ,
where Case (I) sets f ( x , t ) = ( 1 + π 2 ) sin ( π x ) (zero-order mismatch), and Case (II) sets f ( x , t ) = e t sin ( π x ) .
Table 5 shows the results. For Case (I), g ( t ) = f ( t ) Δ u 0 = sin ( π x ) is constant. Only c ¯ n activates, eliminating the constant offset. For Case (II), Scheme B corrects the origin singularity and restores the O ( τ 4 α ) rate.
Example 4. 
We test the effect of compatibility using f ( x , t ) = t 4 sin ( π x ) :
D t α 0 C u ( x , t ) Δ u ( x , t ) = t 4 sin ( π x ) , 0 < x < 1 , t > 0 ,
u ( 0 , t ) = u ( 1 , t ) = 0 ,
u ( x , 0 ) = u 0 ( x ) .
Case (I) uses u 0 ( x ) = 0 (compatible), and Case (II) uses u 0 ( x ) = sin ( π x ) (incompatible).
As shown in Table 6, Case (I) yields O ( τ 4 α ) naturally because f ( x , t ) and its derivatives vanish at t = 0 . In Case (II), u 0 0 breaks compatibility, reducing Scheme A to O ( τ ) . Scheme B recovers full accuracy.
Example 5. 
We consider a low-regularity source to observe order limits:
D t α 0 C u ( x , t ) Δ u ( x , t ) = t 1 + α sin ( π x ) , 0 < x < 1 , t > 0 ,
u ( 0 , t ) = u ( 1 , t ) = 0 ,
u ( x , 0 ) = 0 .
Table 7 shows that low source regularity limits convergence to O ( τ 2 + α ) . Correction terms vanish automatically, confirming that starting steps cannot bypass the regularity barrier of the underlying PDE solution.
Example 6. 
To track how regularity influences uncorrected steps, we test manufactured solutions u ( x , t ) = t σ sin ( π x ) with varying σ > 0 . With u ( x , 0 ) = 0 , the source is:
f ( x , t ) = Γ ( σ + 1 ) Γ ( σ + 1 α ) t σ α + π 2 t σ sin ( π x ) .
This test uses Scheme A exclusively.
Table 8 records the rates. Small values of σ restrict convergence. Rates grow with σ and hit the formal 4 α limit once σ 4 α .
Remark 6. 
To isolate the temporal truncation error, an operator test evaluates the Caputo derivative of the supersmooth function u ( t ) = t 6 at T = 1.0 , with temporal grid size N up to 3000. Figure 2 displays the absolute errors across different α for three schemes: the O ( τ 2 α ) Liao L1 scheme [20], the O ( τ 3 α ) Alikhanov L2-1σ scheme [21], and the proposed O ( τ 4 α ) Zeta scheme. Under ideal smoothness, the Zeta scheme achieves the designed O ( τ 4 α ) accuracy and shows notably smaller errors than the lower-order methods for all tested fractional orders.
Example 7. 
To evaluate absolute accuracy and numerical stability, we compare the proposed Zeta scheme against the Gao O ( τ 3 α ) and Cao O ( τ 4 α ) schemes of [2] using the homogeneous fractional diffusion equation with nonsmooth initial data:
D t α 0 C u ( x , t ) Δ u ( x , t ) = 0 , 0 < x < 1 , t > 0 ,
u ( 0 , t ) = u ( 1 , t ) = 0 ,
u ( x , 0 ) = χ [ 0 , 0.5 ] .
The spatial domain is discretized via a lumped-mass L 2 -projection onto linear finite elements with a uniform mesh size h = 1 / 64 . The final time is T = 1 and the test grid is τ { 2 3 , 2 4 , , 2 7 } . To avoid the systematic bias inherent in self-referential measurements, the reference solution is strictly computed using the Zeta scheme ( K = 6 ) at τ = 2 14 , establishing an independent baseline accurate to approximately O ( 10 12 ) .
Table 9 reports the absolute L 2 errors and convergence rates. Evaluated against the independent reference, all schemes exhibit high-order convergence. The Gao and Cao schemes maintain their expected O ( τ 3 α ) and O ( τ 4 α ) trajectories, respectively.
The Zeta scheme ( K = 4 ) achieves comparable accuracy to the Cao scheme, with absolute errors reaching O ( 10 11 ) . The structural advantage of the Zeta scheme is that it naturally assigns exact spectral coefficients via the Euler–Maclaurin expansion, bypassing the need for customized starting corrections. This intrinsically preserves spectral consistency and provides a unified, stable framework for nonsmooth data.

6.3. Summary

In summary, the uncorrected scheme degrades to first-order accuracy whenever the exact solution exhibits a weak singularity at t = 0 , whether due to a non-zero initial condition or an incompatibility between the initial data and the source. The implementation of starting corrections successfully restores the O ( τ 4 α ) convergence rate. This restoration remains effective regardless of the spatial regularity of the initial data.
The two correction mechanisms, c ¯ n 4 and d , n 4 , function independently. As confirmed by the zero-order mismatch experiment, c ¯ n alone is sufficient to recover the full homogeneous rate when only the constant offset is non-zero. However, these corrections cannot bypass the limits imposed by the source term’s own regularity. If the source lacks sufficient smoothness, the convergence rate becomes bounded by the continuous solution’s regularity; for instance, a source f t 1 + α restricts the rate to approximately O ( τ 2 + α ) . The regularity threshold experiment precisely maps this boundary, showing that without correction, the scheme only attains its formal order if the solution satisfies u t σ with σ 4 α near t = 0 .
Finally, the numerical stability of the Zeta scheme stems directly from its generating function structure. Instead of relying on algebraic coefficient cancellation, the method utilizes the Euler–Maclaurin expansion to assign exact spectral coefficients. This specific design preserves spectral consistency and guarantees high-order convergence for nonsmooth data, entirely avoiding the need for ad-hoc initialization adjustments.

7. Conclusion

We constructed a high-order fully discrete Zeta scheme for time-fractional partial differential equations and established an optimal O ( τ 4 α ) convergence rate for the fourth-order discretization. Numerical tests confirm this theoretical bound. The results demonstrate that the starting corrections successfully restore the optimal order by resolving the initial weak singularities. In nonhomogeneous scenarios, the Zeta scheme yields smaller errors than the reference method, an advantage that becomes particularly evident for small α . The generating function framework provides a clear path for extensions to nonlinear problems and variable-order models, as the discrete weights depend smoothly on α .

References

  1. Shi, J.; Chen, M.; Yan, Y.; Cao, J. Correction of high-order Lk approximation for subdiffusion. J. Sci. Comput. 2022, 93, 31. [Google Scholar] [CrossRef]
  2. Wang, Y.; Yan, Y.; Yang, Y. Two high-order time discretization schemes for subdiffusion problems with nonsmooth data. Fract. Calc. Appl. Anal. 2020, 23, 1349–1380. [Google Scholar] [CrossRef]
  3. Jin, B.; Lazarov, R.; Zhou, Z. An analysis of the L1 scheme for the subdiffusion equation with nonsmooth data. IMA J. Numer. Anal. 2016, 36, 197–221. [Google Scholar] [CrossRef]
  4. Gao, G.-H.; Sun, Z.-Z.; Zhang, H.-W. A new fractional numerical differentiation formula to approximate the Caputo fractional derivative and its applications. J. Comput. Phys. 2014, 259, 33–50. [Google Scholar] [CrossRef]
  5. Lv, C.; Xu, C. Error analysis of a high order method for time-fractional diffusion equations. SIAM J. Sci. Comput. 2016, 38, A2699–A2724. [Google Scholar] [CrossRef]
  6. Cao, J.; Li, C.; Chen, Y. High-order approximation to Caputo derivatives and Caputo-type advection-diffusion equations (II). Fract. Calc. Appl. Anal. 2015, 18, 735–761. [Google Scholar] [CrossRef]
  7. Dimitrov, Y.; Georgiev, S.; Todorov, V. Approximation of Caputo fractional derivative and numerical solutions of fractional differential equations. Fractal Fract. 2023, 7, 750. [Google Scholar] [CrossRef]
  8. Dimitrov, Y.; Georgiev, S.; Todorov, V. First derivative approximations and applications. Fractal Fract. 2024, 8, 608. [Google Scholar] [CrossRef]
  9. Podlubny, Igor. Fractional differential equations: an introduction to fractional derivatives, fractional differential equations, to methods of their solution and some of their applications. 1998, Vol. 198. [Google Scholar]
  10. Lubich, C. Discretized fractional calculus. SIAM J. Math. Anal. 1986, 17, 704–719. [Google Scholar] [CrossRef]
  11. Lubich, C. Convolution quadrature and discretized operational calculus. II. Numer. Math. 1988, 52, 413–425. [Google Scholar] [CrossRef]
  12. Jin, B.; Li, B.; Zhou, Z. Correction of high-order BDF convolution quadrature for fractional evolution equations. SIAM J. Sci. Comput. 2017, 39, A3129–A3152. [Google Scholar] [CrossRef]
  13. Dimitrov, Y. Approximations for the Caputo derivative (I). J. Fract. Calc. Appl. 2018, 9, 35–63. [Google Scholar]
  14. Lubich, C.; Sloan, I.H.; Thomée, V. Nonsmooth data error estimates for approximations of an evolution equation with a positive-type memory term. Math. Comp. 1996, 65, 1–17. [Google Scholar] [CrossRef]
  15. Gargantini, I. The numerical stability of the Schur-Cohn criterion. SIAM J. Numer. Anal. 1971, 8, 24–29. [Google Scholar] [CrossRef]
  16. Marden, M. Geometry of Polynomials; Mathematical Surveys, No. 3; American Mathematical Society: Providence, RI, 1949. [Google Scholar]
  17. Yang, Z.; Zeng, F. A Corrected L1 Method for a Time-Fractional Subdiffusion Equation. J. Sci. Comput. 2023, 95, 85. [Google Scholar] [CrossRef]
  18. Hilberdink, T. Inequalities for the Riemann zeta function on the positive reals. Math. Inequal. Appl. 2023, 26, 995–1002. [Google Scholar] [CrossRef]
  19. Tian, W.; Zhou, H.; Deng, W. A class of second order difference approximations for solving space fractional diffusion equations. Math. Comp. 2015, 84, 1703–1727. [Google Scholar] [CrossRef]
  20. Liao, H.L.; Li, D.; Zhang, J. Sharp error estimate of the nonuniform L1 formula for linear reaction-subdiffusion equations. SIAM J. Numer. Anal. 2018, 56, 1112–1133. [Google Scholar] [CrossRef]
  21. Alikhanov, A.A.; Huang, C. A high-order L2 type difference scheme for the time-fractional diffusion equation. Appl. Math. Comput. 2021, 411, 126545. [Google Scholar] [CrossRef]
  22. Jin, B.; Li, B.; Zhou, Z. An analysis of the Crank–Nicolson method for subdiffusion. IMA J. Numer. Anal. 2018, 38, 518–541. [Google Scholar] [CrossRef]
  23. Titchmarsh, E.C.; Heath-Brown, D.R. The Theory of the Riemann Zeta-Function, 2nd ed.; Oxford University Press: Oxford, 1986. [Google Scholar]
  24. Zagier, Don. Polylogarithms, Dedekind zeta functions, and the algebraic K-theory of fields. In Arithmetic algebraic geometry; Birkhäuser Boston.: Boston, MA, 1991; pp. 391–430. [Google Scholar]
  25. Samko, Stefan G.; Kilbas, Anatoly A.; Marichev, Oleg I. Fractional integrals and derivatives: Theory and applications; Gordon and Breach Science Publishers: New York, 1993. [Google Scholar]
  26. Shi, J. High-Precision Algorithms and Analysis for Fractional Differential Equations with Singular Source Terms. Ph.D. Dissertation, Lanzhou University, Lanzhou, 2024. [Google Scholar] [CrossRef]
Figure 1. Global Stability Manifold View of the zero-free stability regions in the frequency domain under the sectorial angle constraint.
Figure 1. Global Stability Manifold View of the zero-free stability regions in the frequency domain under the sectorial angle constraint.
Preprints 232616 g001
Figure 2. Accuracy Comparison: Comparison of the Zeta scheme with the classical discrete method.
Figure 2. Accuracy Comparison: Comparison of the Zeta scheme with the classical discrete method.
Preprints 232616 g002
Table 1. L 2 -norm errors and convergence rates of the unmodified higher-order Zeta schemes under the compatible condition ( f = t k , u 0 = 0 ).
Table 1. L 2 -norm errors and convergence rates of the unmodified higher-order Zeta schemes under the compatible condition ( f = t k , u 0 = 0 ).
K α τ = 2 3 2 4 2 5 2 6 2 7 2 8 2 9 Rate
4 0.1 6.0818e-07 4.0804e-08 2.7353e-09 1.8329e-10 1.2280e-11 8.2266e-13 5.5110e-14 3.8996
0.5 1.1635e-05 1.0346e-06 9.1690e-08 8.1146e-09 7.1768e-10 6.3453e-11 5.6091e-12 3.4986
0.9 7.7527e-05 9.1063e-06 1.0640e-06 1.2419e-07 1.4489e-08 1.6902e-09 1.9711e-10 3.0991
5 0.1 2.8818e-07 9.6743e-09 3.2436e-10 1.0869e-11 3.6412e-13 1.2199e-14 4.1009e-16 4.8983
0.5 5.5886e-06 2.4915e-07 1.1053e-08 4.8935e-10 2.1645e-11 9.5698e-13 4.2302e-14 4.4980
0.9 3.8264e-05 2.2546e-06 1.3180e-07 7.6948e-09 4.4896e-10 2.6187e-11 1.5271e-12 4.0987
6 0.1 1.7250e-07 2.8981e-09 4.8598e-11 8.1437e-13 1.3644e-14 2.3023e-16 5.3436e-18 5.8029
0.5 3.3783e-06 7.5576e-08 1.6786e-09 3.7179e-11 8.2245e-13 1.8184e-14 4.0191e-16 5.4973
0.9 2.3764e-05 6.9819e-07 2.0450e-08 5.9716e-10 1.7423e-11 5.0803e-13 1.4663e-14 5.1010
7 0.1 1.2474e-07 1.0494e-09 8.8014e-12 7.3755e-14 6.1965e-16 6.8723e-18 1.5231e-18 5.8720
0.5 2.4666e-06 2.7624e-08 3.0748e-10 3.4071e-12 3.7694e-14 4.1674e-16 4.6059e-18 6.4963
0.9 1.7705e-05 2.5813e-07 3.8119e-09 5.5681e-11 8.1230e-13 1.1702e-14 3.0848e-17 6.5924
Table 4. L 2 error and average convergence rate for the homogeneous problem (Example 2).
Table 4. L 2 error and average convergence rate for the homogeneous problem (Example 2).
α Data Configuration Scheme τ = 2 3 τ = 2 4 τ = 2 5 τ = 2 6 τ = 2 7 τ = 2 8 Avg Rate
0.1 (I) u 0 ( x ) = sin ( π x ) (A) Uncorr. 5.07e-04 2.51e-04 1.25e-04 6.21e-05 3.10e-05 1.55e-05 1.004
(B) Corr. 5.62e-06 4.47e-07 2.23e-08 1.26e-09 7.47e-11 4.53e-12 4.147
(II) u 0 ( x ) = χ ( 0 , 0.5 ) (A) Uncorr. 2.32e-04 1.15e-04 5.71e-05 2.85e-05 1.42e-05 7.10e-06 1.004
(B) Corr. 2.78e-06 2.05e-07 1.03e-08 5.76e-10 3.43e-11 2.08e-12 4.148
0.5 (I) u 0 ( x ) = sin ( π x ) (A) Uncorr. 1.86e-03 8.94e-04 4.43e-04 2.21e-04 1.10e-04 5.50e-05 1.005
(B) Corr. 6.64e-04 2.60e-06 1.14e-07 5.50e-09 2.54e-10 9.41e-12 4.519
(II) u 0 ( x ) = χ ( 0 , 0.5 ) (A) Uncorr. 8.43e-04 4.06e-04 2.01e-04 1.00e-04 5.00e-05 2.50e-05 1.005
(B) Corr. 2.92e-04 1.19e-06 5.29e-08 2.58e-09 1.23e-10 5.08e-12 4.461
0.9 (I) u 0 ( x ) = sin ( π x ) (A) Uncorr. 9.99e-04 4.85e-04 2.33e-04 1.15e-04 5.74e-05 2.86e-05 1.021
(B) Corr. 2.11e-03 1.02e-05 9.33e-07 1.10e-07 1.29e-08 1.50e-09 3.182
(II) u 0 ( x ) = χ ( 0 , 0.5 ) (A) Uncorr. 4.54e-04 2.16e-04 1.04e-04 5.14e-05 2.56e-05 1.28e-05 1.020
(B) Corr. 1.08e-03 4.50e-06 4.10e-07 4.83e-08 5.65e-09 6.60e-10 3.184
Table 5. L 2 error and average convergence rate for smooth sources (Example 3).
Table 5. L 2 error and average convergence rate for smooth sources (Example 3).
α Data Configuration Scheme τ = 2 3 τ = 2 4 τ = 2 5 τ = 2 6 τ = 2 7 τ = 2 8 Avg Rate
0.1 (I) f = ( 1 + π 2 ) sin ( π x ) (A) Uncorr. 5.13e-05 2.53e-05 1.26e-05 6.28e-06 3.14e-06 1.57e-06 1.004
(B) Corr. 5.68e-07 4.52e-08 2.26e-09 1.27e-10 7.55e-12 4.58e-13 4.147
(II) f = e t sin ( π x ) (A) Uncorr. 4.55e-04 2.25e-04 1.12e-04 5.58e-05 2.79e-05 1.39e-05 1.003
(B) Corr. 3.32e-06 3.24e-07 1.61e-08 9.05e-10 5.36e-11 3.25e-12 4.152
0.5 (I) f = ( 1 + π 2 ) sin ( π x ) (A) Uncorr. 1.88e-04 9.04e-05 4.48e-05 2.23e-05 1.11e-05 5.56e-06 1.005
(B) Corr. 6.71e-05 2.63e-07 1.16e-08 5.56e-10 2.56e-11 9.53e-13 4.519
(II) f = e t sin ( π x ) (A) Uncorr. 1.67e-03 8.02e-04 3.98e-04 1.98e-04 9.90e-05 4.95e-05 1.005
(B) Corr. 5.56e-04 1.81e-06 7.29e-08 2.95e-09 8.30e-11 2.57e-12 4.857
0.9 (I) f = ( 1 + π 2 ) sin ( π x ) (A) Uncorr. 1.01e-04 4.90e-05 2.35e-05 1.16e-05 5.80e-06 2.89e-06 1.021
(B) Corr. 2.13e-04 1.03e-06 9.43e-08 1.11e-08 1.30e-09 1.52e-10 3.182
(II) f = e t sin ( π x ) (A) Uncorr. 8.97e-04 4.37e-04 2.09e-04 1.03e-04 5.15e-05 2.57e-05 1.021
(B) Corr. 1.77e-03 1.07e-05 9.80e-07 1.14e-07 1.32e-08 1.54e-09 3.189
Table 6. L 2 error and average convergence rate for compatibility tests (Example 4).
Table 6. L 2 error and average convergence rate for compatibility tests (Example 4).
α Data Configuration Scheme τ = 2 3 τ = 2 4 τ = 2 5 τ = 2 6 τ = 2 7 τ = 2 8 Avg Rate
0.1 (I) u 0 = 0 (A) Uncorr. 6.08e-07 4.08e-08 2.74e-09 1.83e-10 1.23e-11 8.22e-13 3.900
(B) Corr. 6.08e-07 4.08e-08 2.74e-09 1.83e-10 1.23e-11 8.22e-13 3.900
(II) u 0 = sin ( π x ) (A) Uncorr. 5.08e-04 2.51e-04 1.25e-04 6.21e-05 3.10e-05 1.55e-05 1.004
(B) Corr. 5.01e-06 4.06e-07 1.96e-08 1.07e-09 6.24e-11 3.71e-12 4.185
0.5 (I) u 0 = 0 (A) Uncorr. 1.16e-05 1.04e-06 9.17e-08 8.11e-09 7.18e-10 6.35e-11 3.498
(B) Corr. 1.16e-05 1.04e-06 9.17e-08 8.11e-09 7.18e-10 6.35e-11 3.498
(II) u 0 = sin ( π x ) (A) Uncorr. 1.87e-03 8.95e-04 4.43e-04 2.21e-04 1.10e-04 5.50e-05 1.006
(B) Corr. 6.52e-04 1.57e-06 2.27e-08 2.61e-09 4.64e-10 5.41e-11 3.706
0.9 (I) u 0 = 0 (A) Uncorr. 7.75e-05 9.11e-06 1.06e-06 1.24e-07 1.45e-08 1.69e-09 3.099
(B) Corr. 7.75e-05 9.11e-06 1.06e-06 1.24e-07 1.45e-08 1.69e-09 3.099
(II) u 0 = sin ( π x ) (A) Uncorr. 1.08e-03 4.94e-04 2.34e-04 1.15e-04 5.74e-05 2.86e-05 1.027
(B) Corr. 2.19e-03 1.93e-05 2.00e-06 2.34e-07 2.74e-08 3.19e-09 3.140
Table 7. L 2 error and average convergence rate for low-regularity data (Example 5).
Table 7. L 2 error and average convergence rate for low-regularity data (Example 5).
α Data Configuration Scheme τ = 2 3 τ = 2 4 τ = 2 5 τ = 2 6 τ = 2 7 τ = 2 8 Avg Rate
0.1 (I) f = t 1 + α sin ( π x ) , u 0 = 0 (A) Uncorr. 6.79e-07 1.61e-07 3.76e-08 8.79e-09 2.05e-09 4.79e-10 2.098
(B) Corr. 6.79e-07 1.61e-07 3.76e-08 8.79e-09 2.05e-09 4.79e-10 2.098
0.5 (I) f = t 1 + α sin ( π x ) , u 0 = 0 (A) Uncorr. 1.06e-07 3.76e-08 9.87e-09 1.99e-09 3.72e-10 6.76e-11 2.280
(B) Corr. 1.06e-07 3.76e-08 9.87e-09 1.99e-09 3.72e-10 6.76e-11 2.280
0.9 (I) f = t 1 + α sin ( π x ) , u 0 = 0 (A) Uncorr. 4.11e-07 2.63e-08 3.65e-09 4.40e-10 5.15e-11 5.97e-12 3.026
(B) Corr. 4.11e-07 2.63e-08 3.65e-09 4.40e-10 5.15e-11 5.97e-12 3.026
Table 8. Observed convergence rates of Scheme A for u = t σ sin ( π x ) (Example 6).
Table 8. Observed convergence rates of Scheme A for u = t σ sin ( π x ) (Example 6).
σ α = 0.1 α = 0.5 α = 0.9
0.5 1.488 1.196 0.719
1.0 1.984 1.657 1.153
1.5 2.454 2.044 1.213
2.0 2.121 2.609 2.272
2.5 4.436 3.543 3.132
3.0 3.886 3.541 3.174
3.5 3.916 3.513 3.115
4.0 3.900 3.499 3.100
4.5 3.886 3.485 3.085
5.0 3.872 3.471 3.071
4 α (target) 3.9 3.5 3.1
Table 9. Absolute L 2 errors and convergence rates for u 0 = χ [ 0 , 0.5 ] (Example 7).
Table 9. Absolute L 2 errors and convergence rates for u 0 = χ [ 0 , 0.5 ] (Example 7).
Scheme α τ = 2 3 τ = 2 4 τ = 2 5 τ = 2 6 τ = 2 7 Rate
Zeta ( K = 4 ) 0.1 2.83e-06 2.10e-07 1.05e-08 5.90e-10 3.50e-11 4.08
0.5 2.99e-04 1.22e-06 5.42e-08 2.64e-09 1.25e-10 5.30
0.9 1.10e-03 4.62e-06 4.20e-07 4.96e-08 5.79e-09 4.38
Gao O ( τ 3 α ) 0.1 8.71e-06 8.50e-07 9.41e-08 1.11e-08 1.34e-09 3.17
0.5 4.50e-05 3.76e-06 3.38e-07 2.81e-08 1.78e-09 3.66
0.9 1.37e-04 1.27e-05 3.35e-06 8.12e-07 1.92e-07 2.37
Cao O ( τ 4 α ) 0.1 4.36e-06 1.97e-07 9.73e-09 5.23e-10 2.35e-10 3.54
0.5 2.58e-04 1.10e-06 4.71e-08 2.12e-09 2.53e-10 4.99
0.9 1.09e-03 4.82e-06 4.36e-07 5.10e-08 6.57e-09 4.33
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.