---
title: Symmetric Graded Time Mesh in Fractional Problems
url: https://www.emergentmind.com/topics/symmetric-graded-time-mesh
type: topic
---

# Symmetric Graded Time Mesh in Fractional Problems

Searching arXiv for recent and foundational papers on symmetric graded time meshes and closely related graded temporal meshes in fractional problems.
A symmetric graded time mesh is a nonuniform temporal partition in which node density is increased toward both ends of a relevant time window, rather than only toward the initial time. In the cited arXiv literature, the term is introduced explicitly for a constant-delay subdiffusion equation on \([-\tau,K\tau]\), where weak temporal regularity occurs near \(t=0\) and \(t=\tau\), and then repeats across delay windows. In that setting, the mesh is constructed so that, within each interval \(((i-1)\tau,i\tau]\), points are clustered near both \((i-1)\tau\) and \(i\tau\); when the grading parameter is set to \(r=1\), the construction degenerates to a uniform time mesh [2509.13052]. This notion should be distinguished from the more common one-sided graded temporal meshes used for initial-time singularities in Caputo subdiffusion problems [2309.13316], [2506.12954], [1912.06614].

## 1. Canonical construction

In the delay-subdiffusion formulation that explicitly introduces the term, the time interval is \([-\tau,K\tau]\), and the mesh is defined blockwise with respect to each delay window. The nodes satisfy
\[
t_{-2N}=-\tau,
\]
and for each block \(i=0,1,\dots,K\),
\[
t_n= \begin{cases} 
\dfrac{\tau}{2}\left(\dfrac{n-2(i-1)N}{N}\right)^r+(i-1)\tau, & 2(i-1)N+1\le n < (2i-1)N,\\[2ex]
-\dfrac{\tau}{2}\left(\dfrac{2iN-n}{N}\right)^r+i\tau, & (2i-1)N\le n\le 2iN.
\end{cases}
\]
Here \(N\ge 2\) is an integer, \(r\ge 1\) is the grading parameter, \(t_n\) are the temporal nodes, \(\rho_n=t_n-t_{n-1}\) are the subinterval lengths, \(u^n=u(t_n)\), and \(\nabla_t u^n=u^n-u^{n-1}\) [2509.13052].

The symmetry is local to each delay block. Within \(((i-1)\tau,i\tau]\), the mesh grades toward both endpoints, so the node pattern is adapted to singular behavior associated with the left endpoint \((i-1)\tau\) and the right endpoint \(i\tau\). The grading parameter controls the strength of endpoint clustering. The characteristic behavior
\[
\rho_1=t_1 \simeq N^{-r},
\]
together with
\[
\rho_n \lesssim (\rho_1)^{1/r}\bigl(t_n-(i-1)\tau\bigr)^{1-\frac1r}, \qquad 2(i-1)N+1\le n\le 2iN,\ i=1,\dots,K,
\]
makes explicit that larger \(r\) yields stronger refinement near the singular locations. For \(r=1\), the power law disappears and the mesh becomes uniform [2509.13052].

## 2. Singular structure and the rationale for symmetry

The mesh is introduced for a subdiffusion equation with constant time delay and a Riemann–Liouville fractional derivative. In the transformed form, the equation is written as
\[
{}_0^C D_t^\alpha u(x,t)=p\Delta u + au(x,t)+ {}_0I_t^{1-\alpha}[b\,u(x,t-\tau)] + G(x,t),
\]
where \(G={}_0I_t^{1-\alpha}f\) [2509.13052].

The motivation for symmetric grading is the repeated loss of temporal regularity at delay-induced singular locations. The recorded temporal regularity is
\[
|\partial_t u_{k\tau}|\le C\bigl(1+t^{\alpha-1}\bigr),\qquad k=1,\dots,K,
\]
and
\[
|\partial_t^2 u_{\tau}|\le C\bigl(1+t^{\alpha-2}\bigr),\qquad |\partial_t^2 u_{k\tau}|\le C\bigl(1+(t-\tau)^{\alpha-1}\bigr),\quad k=2,\dots,K.
\]
These estimates show singular behavior near \(t=0\) and near \(t=\tau\), and by repetition at later delay points. The mesh is therefore aligned with the repeated singular structure induced by the delay, rather than only with the initial layer [2509.13052].

A direct consequence is that the construction differs qualitatively from standard graded meshes for non-delay fractional diffusion. Those meshes are refined only near \(t=0\), because the singularity they target is an initial-time singularity. Symmetric grading is thus not a generic synonym for graded temporal refinement; it is a response to a two-sided or repeated endpoint-singularity structure.

## 3. Fractional discretization on the mesh

On the symmetric graded time mesh, the Caputo derivative is approximated by the L1 formula on a nonuniform grid:
\[
D^\alpha u^n=\sum_{k=1}^n a_{n-k}^{(n)}\nabla_t u^k,
\]
with weights
\[
a_{n-k}^{(n)}= \frac{\omega_{2-\alpha}(t_n-t_{k-1})-\omega_{2-\alpha}(t_n-t_k)}{\rho_k}.
\]
The delayed Riemann–Liouville integral term is discretized by the fractional right rectangular rule,
\[
J^{1-\alpha}u^{n-2N}=\sum_{k=1}^n \rho_k a_{n-k}^{(n)}u^{k-2N},
\]
using the same coefficients \(a_{n-k}^{(n)}\) [2509.13052].

With piecewise linear finite elements \(X_h\), the fully discrete method is
\[
(D^\alpha u_h^n,v_h)+B(u_h^n,v_h) = (b\,J^{1-\alpha}u_h^{n-2N},v_h)+(G^n,v_h), \qquad \forall v_h\in X_h,
\]
where
\[
B(u,v)=p(u_x,v_x)-(au,v),
\]
and \(u_h^{n-2N}\) is initialized from the history function \(\varphi\) [2509.13052].

The discretization is therefore coupled to the mesh at two levels. First, the L1 coefficients depend on the nonuniform nodal distribution. Second, the delayed integral inherits the same time-grid geometry. This coupling is central to the local truncation analysis, because the weak regularity occurs exactly near the endpoints toward which the mesh is graded.

## 4. Truncation error, stability, and convergence

The local truncation analysis on the symmetric graded mesh is carried out separately for the Riemann–Liouville integral and for the L1 approximation of the Caputo derivative. For the integral term,
\[
\left|(J^{1-\alpha}-{}_0I_t^{1-\alpha})u^{n-2N}\right| \lesssim \rho_1^{1/r}, \qquad 1\le n\le 2KN.
\]
For the L1 formula, an auxiliary quantity \(\psi_k\) is introduced to measure time regularity across different mesh regions, and the resulting local truncation error satisfies
\[
\left|(D^\alpha-{}_0^CD_t^\alpha)u^n\right| \lesssim \begin{cases} 
\left(\dfrac{\rho_1}{t_n}\right)^{\min\{\frac{2-\alpha}{r},\,\alpha+1\}}, & 1\le n\le 2N,\\[2ex]
\rho_1^{1+\alpha}(t_n-\tau)^{-\alpha} +\rho_1^{\frac{2-\alpha}{r}}(t_n-\tau)^{\frac{\alpha-2}{r}+1}, & 2N+1\le n\le 2KN.
\end{cases}
\]
These estimates are tailored to the two singular regimes: the initial interval and the intervals following the first delay shift [2509.13052].

The analysis then bifurcates according to whether the mesh is uniform or graded. For the uniform case \(r=1\), a discrete sequence \(\{P_k\}\) is introduced, satisfying
\[
P_0=\frac1{a_0},\qquad P_{n-k}=\frac1{a_0}\sum_{j=k+1}^n P_{n-j}\bigl(a_{j-(k+1)}-a_{j-k}\bigr), \qquad 1\le k\le n-1,
\]
together with
\[
\sum_{j=1}^n P_{n-j}\le \omega_{1+\alpha}(t_n),\qquad \sum_{j=k}^n P_{n-j}a_{j-k}=1.
\]
Using these relations, the paper establishes unconditional stability and the local time error estimate
\[
\|u^n-u_h^n\| \lesssim \begin{cases} 
h^2+\rho\,t_n^{\alpha-1}, & 1\le n\le 2N,\\
h^2+\rho, & 2N+1\le n\le 2KN.
\end{cases}
\]
This yields order \(\alpha\) near \(t=0\) and order \(1\) after the first delay interval [2509.13052].

For the symmetric graded mesh case \(r>1\), the coefficients depend on the time level, and the analysis employs a discrete fractional Gronwall inequality with recursively defined sequences \(\overline P_{k-j}^{(k)}\). Applying this machinery to the finite element error gives the global estimate
\[
\|u^n-u_h^n\| \lesssim h^2 + N^{-\min\{1,\alpha r\}}.
\]
The global rate becomes first-order in time when \(r\ge 1/\alpha\). In the paper’s interpretation, the symmetric graded mesh is precisely the mechanism that recovers this globally optimal time error estimate under low regularity at \(t=0\) and \(\tau\) [2509.13052].

## 5. Relation to one-sided graded temporal meshes

Several closely related papers analyze graded temporal meshes for fractional diffusion, but they do not use symmetric grading. Instead, they employ one-sided meshes refined near \(t=0\), because the singularity to be resolved is an initial-time singularity rather than a repeated endpoint singularity.

| Paper | Time mesh | Symmetry status |
|---|---|---|
| [2309.13316] | \(t_n = T\left(\frac{n}{K_t}\right)^r\) | not symmetric |
| [2506.12954] | \(\tau:=t_1\simeq M^{-r}\), \(\tau_j\simeq M^{-1} t_j^{1-1/r}\) | not symmetric |
| [1912.06614] | \(t_n=\left(\frac{n}{N}\right)^\delta T\) | not symmetric |

In the high-order Caputo approximation of time-fractional diffusion equations with an initial-time singularity, the temporal mesh is
\[
t_n = T\left(\frac{n}{K_t}\right)^r, \qquad n=0,1,\dots,K_t,\qquad r\ge 1,
\]
with nodes clustered near \(t=0\) when \(r>1\). The truncation error rate is \(\min\{4-\alpha,r\alpha\}\), the optimal grading parameter is
\[
r_\ast = \frac{4-\alpha}{\alpha},
\]
and the best possible temporal order \(4-\alpha\) is recovered when \(r\ge (4-\alpha)/\alpha\) [2309.13316]. The mesh is explicitly described as a graded, forward-in-time mesh, not a symmetric one.

For semilinear and quasilinear fractional subdiffusion equations, the graded-mesh condition is
\[
\tau:=t_1\simeq M^{-r},\qquad \tau_j:=t_j-t_{j-1}\simeq M^{-1} t_j^{1-1/r} \lesssim \tau^{1/r} t_j^{1-1/r},\qquad j=1,\dots,M,
\]
with a standard example
\[
t_j = T\left(\frac{j}{M}\right)^r,\qquad j=0,\dots,M.
\]
The resulting L1 analysis yields sharp pointwise-in-time error bounds on graded temporal meshes with arbitrary degree of grading, but no symmetry hypothesis is introduced anywhere in the theory [2506.12954].

In the inverse-source problem for a two-parameter anomalous diffusion model, the mesh
\[
t_n=\left(\frac{n}{N}\right)^\delta T, \qquad n=0,1,\dots,N,\qquad \delta\ge 1,
\]
is introduced because the recovered source term is singular or weakly regular near \(t=0\). Under the graded mesh, the discontinuous collocation method satisfies
\[
\|w-\tilde w\|_{L^\infty(I_n)}\le C(\Delta t)^{\sigma\delta}, \qquad 1\le \delta\le \frac{2}{\sigma},
\]
and choosing
\[
\delta=\frac{2}{\sigma}
\]
recovers the optimal second-order rate \(O((\Delta t)^2)\) [1912.06614].

Taken together, these results show that symmetric graded time meshes are not a generic replacement for one-sided graded meshes. They are a specialized construction for problems in which singular behavior appears at more than one distinguished temporal location.

## 6. Terminological extensions and distinctions

The phrase “symmetric” appears in other temporal-discretization literatures, but with different meanings. On arbitrary time scales \(\mathbb{T}\), the symmetric derivative is defined through the forward and backward jump operators \(\sigma(t)\) and \(\rho(t)\). At dense points it reduces to
\[
f^\diamond(t)=\lim_{h\to 0} \frac{f(t+h)-f(t-h)}{2h},
\]
while at non-dense points, under continuity,
\[
f^\diamond(t)=\frac{f(\sigma(t))-f(\rho(t))}{\sigma(t)-\rho(t)}.
\]
This framework is centered and compatible with nonuniform spacing, but it is a calculus on time scales rather than a delay-adapted graded-mesh construction [1209.2094].

A distinct use of symmetry arises in a geometric variational discretization of second-order initial value problems. There, the independent variable is an auxiliary world-line parameter \(\gamma\), not physical time \(t\). An equidistant grid is imposed in \(\gamma\), while \(t(\gamma)\) is solved for as part of the discrete dynamics. The resulting physical time mesh is non-equidistant and is interpreted as automatic AMR guided by the system symmetries; the associated continuum Noether charge \(Q_t=g_{00}\dot t\) is exactly preserved in the interior of the simulated time interval by the discrete scheme [2307.04490].

A plausible implication is that “symmetric graded time mesh” should be reserved for a prescribed temporal partition that grades toward multiple singular endpoints, rather than being used loosely for any centered difference formula or any symmetry-preserving nonuniform time discretization. In the literature cited here, the explicit, technical meaning is the delay-window construction on \([-\tau,K\tau]\) designed to resolve low regularity near \(t=0,\tau,2\tau,\dots\), whereas the dominant graded-mesh tradition in fractional diffusion remains one-sided and focused on the initial layer [2509.13052].

Source: https://www.emergentmind.com/topics/symmetric-graded-time-mesh