Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Relaxed Step-Ratio Constraint for Time-Fractional Cahn--Hilliard Equations: Analysis and Computation

Published 24 Aug 2025 in math.NA and cs.NA | (2508.17178v1)

Abstract: Numerical solutions of time-fractional differential equations encounter significant challenges arising from solution singularities at the initial time. To address this issue, the construction of nonuniform temporal meshes satisfying $\tau_k/\tau_{k-1} \geq 1$ has emerged as an effective strategy, where $\tau_k$ represents the $k$-th time-step size. For the time-fractional Cahn-Hilliard equation, Liao et al.~[\textit{IMA J. Numer. Anal.}, \textbf{45} (2025), 1425--1454] developed an analytical framework using a variable-step L2 formula with the constraint $0.3960 \leq \tau_k/\tau_{k-1} \leq r*(\alpha)$, where $r*(\alpha) \geq 4.660$ for $\alpha \in (0,1)$. The present work makes substantial theoretical progress by introducing innovative splitting techniques that relax the step-size ratio restriction to $\tau_k/\tau_{k-1} \leq \rho*(\alpha)$, with $\rho*(\alpha) > \overline{\rho} \approx 4.7476114$. This advancement provides significantly greater flexibility in time-step selection. Building on this theoretical foundation, we propose a refined L2-type temporal approximation coupled with a fourth-order compact difference spatial discretization, yielding an efficient numerical scheme for the time-fractional Cahn-Hilliard problem. Our rigorous analysis establishes the scheme's fundamental properties, including unique solvability, exact discrete volume conservation, proper energy dissipation laws, and optimal convergence rates. For practical implementation, we construct a specialized nonuniform mesh that automatically satisfies the relaxed constraint $\rho*(\alpha) > 4.7476114$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.