SearcharxivSearch

arXiv · 1501.00376

Well-posedness and numerical algorithm for the tempered fractional ordinary differential equations

Abstract

Trapped dynamics widely appears in nature, e.g., the motion of particles in viscous cytoplasm. The famous continuous time random walk (CTRW) model with power law waiting time distribution ({\em having diverging first moment}) describes this phenomenon. Because of the finite lifetime of biological particles, sometimes it is necessary to temper the power law measure such that the waiting time measure has convergent first moment. Then the time operator of the Fokker-Planck equation corresponding to the CTRW model with tempered waiting time measure is the so-called tempered fractional derivative. This paper focus on discussing the properties of the time tempered fractional derivative, and studying the well-posedness and the Jacobi-predictor-corrector algorithm for the tempered fractional ordinary differential equation. By adjusting the parameter of the proposed algorithm, any desired convergence order can be obtained and the computational cost linearly increases with time. And the effectiveness of the algorithm is numerically confirmed.

Explore related subjects

Keep this discovery

BibTeXRIS

Can Li, Weihua Deng, Lijing Zhao. 2015-01-02. Well-posedness and numerical algorithm for the tempered fractional ordinary differential equations. https://doi.org/10.3934/dcdsb.2019022

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

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA