Search arXivSearch

arXiv · 1906.06584

Time-Fractional Allen-Cahn Equations: Analysis and Numerical Methods

Abstract

In this work, we consider a time-fractional Allen-Cahn equation, where the conventional first order time derivative is replaced by a Caputo fractional derivative with order $α\in(0,1)$. First, the well-posedness and (limited) smoothing property are systematically analyzed, by using the maximal $L^p$ regularity of fractional evolution equations and the fractional Grönwall's inequality. We also show the maximum principle like their conventional local-in-time counterpart. Precisely, the time-fractional equation preserves the property that the solution only takes value between the wells of the double-well potential when the initial data does the same. Second, after discretizing the fractional derivative by backward Euler convolution quadrature, we develop several unconditionally solvable and stable time stepping schemes, i.e., convex splitting scheme, weighted convex splitting scheme and linear weighted stabilized scheme. Meanwhile, we study the discrete energy dissipation property (in a weighted average sense), which is important for gradient flow type models, for the two weighted schemes. Finally, by using a discrete version of fractional Grönwall's inequality and maximal $\ell^p$ regularity, we prove that the convergence rates of those time-stepping schemes are $O(τ^α)$ without any extra regularity assumption on the solution. We also present extensive numerical results to support our theoretical findings and to offer new insight on the time-fractional Allen-Cahn dynamics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiang Du, Jiang Yang, Zhi Zhou. 2019-06-15. Time-Fractional Allen-Cahn Equations: Analysis and Numerical Methods. https://arxiv.org/abs/1906.06584

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA