Search

A key characteristic of the anomalous sub-solution equation is that the solution exhibits algebraic decay rate over long time intervals, which is often refered to the Mittag-Leffler type stability. For a class of power nonlinear sub-diffusion models with variable coefficients, we prove that their solutions have Mittag-Leffler stability when the source functions satisfy natural decay assumptions. That is the solutions have the decay rate $\|u(t)\|_{L^{s}(\Omega)}=O\left( t^{-(\alpha+\beta)/\gamma} \right)$ as $t\rightarrow\infty$, where $\alpha$, $\gamma$ are positive constants, $\beta\in(-\alpha,\infty)$ and $s\in (1,\infty)$. Then we develop the structure preserving algorithm for this type of model. For the complete monotonicity-preserving ($\mathcal{CM}$-preserving) schemes developed by Li and Wang (Commun. Math. Sci., 19(5):1301-1336, 2021), we prove that they satisfy the discrete comparison principle for time fractional differential equations with variable coefficients. Then, by carefully constructing the fine the discrete supsolution and subsolution, we obtain the long time optimal decay rate of the numerical solution $\|u_{n}\|_{L^{s}(\Omega)}=O\left( t_n^{-(\alpha+\beta)/\gamma} \right)$ as $t_{n}\rightarrow\infty$, which is fully agree with the theoretical solution. Finally, we validated the analysis results through numerical experiments.

In this paper, we present a rigorous proof of the convergence of first order and second order exponential time differencing (ETD) schemes for solving the nonlocal Cahn-Hilliard (NCH) equation. The spatial discretization employs the Fourier spectral collocation method, while the time discretization is implemented using ETD-based multistep schemes. The absence of a higher-order diffusion term in the NCH equation poses a significant challenge to its convergence analysis. To tackle this, we introduce new error decomposition formulas and employ the higher-order consistency analysis. These techniques enable us to establish the $\ell^\infty$ bound of numerical solutions under some natural constraints. By treating the numerical solution as a perturbation of the exact solution, we derive optimal convergence rates in $\ell^\infty(0,T;H_h^{-1})\cap \ell^2(0,T; \ell^2)$. We conduct several numerical experiments to validate the accuracy and efficiency of the proposed schemes, including convergence tests and the observation of long-term coarsening dynamics.

The solution of the nonlinear initial-value problem $\mathcal{D}_{t}^{\alpha}y(t)=-\lambda y(t)^{\gamma}$ for $t>0$ with $y(0)>0$, where $\mathcal{D}_{t}^{\alpha}$ is a Caputo derivative of order $\alpha\in (0,1)$ and $\lambda, \gamma$ are positive parameters, is known to exhibit $O(t^{\alpha/\gamma})$ decay as $t\to\infty$. No corresponding result for any discretisation of this problem has previously been proved. In the present paper it is shown that for the class of complete monotonicity-preserving ($\mathcal{CM}$-preserving) schemes (which includes the L1 and Gr\"unwald-Letnikov schemes) on uniform meshes $\{t_n:=nh\}_{n=0}^\infty$, the discrete solution also has $O(t_{n}^{-\alpha/\gamma})$ decay as $t_{n}\to\infty$. This result is then extended to $\mathcal{CM}$-preserving discretisations of certain time-fractional nonlinear subdiffusion problems such as the time-fractional porous media and $p$-Laplace equations. For the L1 scheme, the $O(t_{n}^{-\alpha/\gamma})$ decay result is shown to remain valid on a very general class of nonuniform meshes. Our analysis uses a discrete comparison principle with discrete subsolutions and supersolutions that are carefully constructed to give tight bounds on the discrete solution. Numerical experiments are provided to confirm our theoretical analysis.

The asymptotic stable region and long-time decay rate of solutions to linear homogeneous Caputo time fractional ordinary differential equations (F-ODEs) are known to be completely determined by the eigenvalues of the coefficient matrix. Very different from the exponential decay of solutions to classical ODEs, solutions of F-ODEs decay only polynomially, leading to the so-called Mittag-Leffler stability, which was already extended to semi-linear F-ODEs with small perturbations. This work is mainly devoted to the qualitative analysis of the long-time behavior of numerical solutions. By applying the singularity analysis of generating functions developed by Flajolet and Odlyzko (SIAM J. Disc. Math. 3 (1990), 216-240), we are able to prove that both $\mathcal{L}$1 scheme and strong $A$-stable fractional linear multistep methods (F-LMMs) can preserve the numerical Mittag-Leffler stability for linear homogeneous F-ODEs exactly as in the continuous case. Through an improved estimate of the discrete fractional resolvent operator, we show that strong $A$-stable F-LMMs are also Mittag-Leffler stable for semi-linear F-ODEs under small perturbations. For the numerical schemes based on $\alpha$-difference approximation to Caputo derivative, we establish the Mittag-Leffler stability for semi-linear problems by making use of properties of the Poisson transformation and the decay rate of the continuous fractional resolvent operator. Numerical experiments are presented for several typical time fractional evolutional equations, including time fractional sub-diffusion equations, fractional linear system and semi-linear F-ODEs. All the numerical results exhibit the typical long-time polynomial decay rate, which is fully consistent with our theoretical predictions., Comment: All comments are welcome!

This paper is concerned with the numerical stability of time fractional delay differential equations (F-DDEs) based on Gr\"{u}nwald-Letnikov (GL) approximation (also called fraction backward Euler scheme) for the Caputo fractional derivative, in particular, the numerical stability region and the Mittag-Leffler stability. Using the boundary locus technique, we first derive the exact expression of the numerically stability region in the parameter plane, and show that the fractional backward Euler scheme based on GL scheme is not $\tau(0)$-stable, which is different from the backward Euler scheme for integer DDE models. Secondly, we also prove the numerical Mittag-Leffler stability for the numerical solutions provided that the parameters fall into the numerical stability region, by employing the singularity analysis of generating function. Our results show that the numerical solutions of F-DDEs are completely different from the classical integer order DDEs, both in terms of $\tau(0)$-stabililty and the long-time decay rate.

We introduce a new class of parametricization structure-preserving partitioned Runge-Kutta ($\alpha$-PRK) methods for Hamiltonian systems with holonomic constraints. When the scalar parameter $\alpha=0$, the methods are reduced to the usual symplectic PRK methods like Shake-Rattle method or PRK schemes based on Lobatto IIIA-IIIB pairs, which can preserve all the quadratic invariants and the constraints. When $\alpha\neq 0$, the methods are also shown to preserve all the quadratic invariants and the constraints manifold exactly. At the same time, for any given consistent initial values $(p_{0}, q_0)$ and small step size $h>0$, it is proved that there exists $\alpha^*=\alpha(h, p_0, q_0)$ such that the Hamiltonian energy can also be exactly preserved at each step. We provide a new variational formulation for symplectic PRK schemes and use it to prove that the parametrized PRK methods can preserve the quadratic invariants for Hamiltonian systems subject to holonomic constraints. The parametric $\alpha$-PRK methods are shown to have the same convergence rate as the usual PRK methods and perform very well in various numerical experiments.

The time fractional ODEs are equivalent to convolutional Volterra integral equations with completely monotone kernels. We therefore introduce the concept of complete monotonicity-preserving ($\mathcal{CM}$-preserving) numerical methods for fractional ODEs, in which the discrete convolutional kernels inherit the $\mathcal{CM}$ property as the continuous equations. We prove that $\mathcal{CM}$-preserving schemes are at least $A(\pi/2)$ stable and can preserve the monotonicity of solutions to scalar nonlinear autonomous fractional ODEs, both of which are novel. Significantly, by improving a result of Li and Liu (Quart. Appl. Math., 76(1):189-198, 2018), we show that the $\mathcal{L}$1 scheme is $\mathcal{CM}$-preserving, so that the $\mathcal{L}$1 scheme is at least $A(\pi/2)$ stable, which is an improvement on stability analysis for $\mathcal{L}$1 scheme given in Jin, Lazarov and Zhou (IMA J. Numer. Analy. 36:197-221, 2016). The good signs of the coefficients for such class of schemes ensure the discrete fractional comparison principles, and allow us to establish the convergence in a unified framework when applied to time fractional sub-diffusion equations and fractional ODEs. The main tools in the analysis are a characterization of convolution inverses for completely monotone sequences and a characterization of completely monotone sequences using Pick functions due to Liu and Pego (Trans. Amer. Math. Soc. 368(12):8499-8518, 2016). The results for fractional ODEs are extended to $\mathcal{CM}$-preserving numerical methods for Volterra integral equations with general completely monotone kernels. Numerical examples are presented to illustrate the main theoretical results.

In this article, we are concerned with the analysis on the numerical reconstruction of the spatial component in the source term of a time-fractional diffusion equation. This ill-posed problem is solved through a stabilized nonlinear minimization system by an appropriately selected Tikhonov regularization. The existence and the stability of the optimization system are demonstrated. The nonlinear optimization problem is approximated by a fully discrete scheme, whose convergence is established under a novel result verified in this study that the $H^1$-norm of the solution to the discrete forward system is uniformly bounded. The iterative thresholding algorithm is proposed to solve the discrete minimization, and several numerical experiments are presented to show the efficiency and the accuracy of the algorithm., Comment: 17 pages, 2 figures, 2 tables

In this work, we study the long time behaviors, including asymptotic contractivity and dissipativity, of the solutions to several numerical methods for fractional ordinary differential equations (F-ODEs). The existing algebraic contractivity and dissipativity rates of the solutions to the scalar F-ODEs are first improved. In order to study the long time behavior of numerical solutions to fractional backward differential formulas (F-BDFs), two crucial analytical techniques are developed, with the first one for the discrete version of the fractional generalization of the traditional Leibniz rule, and the other for the algebraic decay rate of the solution to a linear Volterra difference equation. By mens of these auxiliary tools and some natural conditions, the solutions to F-BDFs are shown to be contractive and dissipative, and also preserve the exact contractivity rate of the continuous solutions. Two typical F-BDFs, based on the Grunwald-Letnikov formula and L1 method respectively, are studied. For high order F-BDFs, including some second order F-BDFs and $3-\alpha$ order method, their numerical contractivity and dissipativity are also developed under some slightly stronger conditions. Numerical experiments are presented to validate the long time qualitative characteristics of the solutions to F-BDFs, revealing very different decay rates of the numerical solutions in terms of the the initial values between F-ODEs and integer ODEs and demonstrating the superiority of the structure-preserving numerical methods., Comment: 20 pages, 4 figures