• Journal of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.929-967
• /
• 2016

Let p(t, x) be the fundamental solution to the problem $${\partial}^{\alpha}_tu=-(-{\Delta})^{\beta}u,\;{\alpha}{\in}(0,2),\;{\beta}{\in}(0,{\infty})$$. If ${\alpha},{\beta}{\in}(0,1)$, then the kernel p(t, x) becomes the transition density of a Levy process delayed by an inverse subordinator. In this paper we provide the asymptotic behaviors and sharp upper bounds of p(t, x) and its space and time fractional derivatives $$D^n_x(-{\Delta}_x)^{\gamma}D^{\sigma}_tI^{\delta}_tp(t,x),\;{\forall}n{\in}{\mathbb{Z}}_+,\;{\gamma}{\in}[0,{\beta}],\;{\sigma},{\delta}{\in}[0,{\infty})$$, where $D^n_x$ x is a partial derivative of order n with respect to x, $(-{\Delta}_x)^{\gamma}$ is a fractional Laplace operator and $D^{\sigma}_t$ and $I^{\delta}_t$ are Riemann-Liouville fractional derivative and integral respectively.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.187-193
• /
• 2010

In this paper, the moments of the Riesz-N$\acute{a}$gy-Tak$\acute{a}$cs(RNT) distribution over a general interval [a, b] $\subset$ [0, 1], are found through the moments of the RNT distribution over the unit interval, [0, 1]. This is done using some special features of the distribution and the fact that [0, 1] is a self-similar set in a dynamical system generated by the RNT distribution. The results are important for the study of the orthogonal polynomials with respect to the RNT distribution over a general interval.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.4
• /
• pp.283-300
• /
• 2019

In this paper, we propose a new semi-analytic approach based on the generalized Taylor series for solving nonlinear differential equations of fractional order. Assuming the solution is expanded as the generalized Taylor series, the coefficients of the series can be computed by solving the corresponding recursive relation of the coefficients which is generated by the given problem. This method is called the generalized differential transform method(GDTM). In several literatures the standard GDTM was applied in each sub-domain to obtain an accurate approximation. As noticed in [19], however, a direct application of the GDTM in each sub-domain loses a term of memory which causes an inaccurate approximation. In this work, we derive a new recursive relation of the coefficients that reflects an effect of memory. Several illustrative examples are demonstrated to show the effectiveness of the proposed method. It is shown that the proposed method is robust and accurate for solving nonlinear differential equations of fractional order.

• East Asian mathematical journal
• /
• v.18 no.1
• /
• pp.111-125
• /
• 2002

Many different families of infinite series were recently observed to be summable in closed forms by means of certain operators of fractional calculus(that is, calculus of integrals and derivatives of any arbitrary real or complex order). In this sequel to some of these recent investigations, the authors present yet another instance of applications of certain fractional calculus operators. Alternative derivations without using these fractional calculus operators are shown to lead naturally a family of analogous infinite sums involving hypergeometric functions.

• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.869-878
• /
• 2016

This paper presents an ecient fractional shifted Legendre polynomial method to solve the fractional Volterra's model for population growth model. The fractional derivatives are described based on the Caputo sense by using Riemann-Liouville fractional integral operator. The theoretical analysis, such as convergence analysis and error bound for the proposed technique has been demonstrated. In applications, the reliability of the technique is demonstrated by the error function based on the accuracy of the approximate solution. The numerical applications have provided the eciency of the method with dierent coecients of the population growth model. Finally, the obtained results reveal that the proposed technique is very convenient and quite accurate to such considered problems.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.101-109
• /
• 2011

The Riemann's zeta function $\zeta(s)$ has been known as answer for a number of primes $\pi$(x) less than given number x. In prime number theorem, there are another approximation function $\frac{x}{lnx}$,Li(x), and R(x). The error about $\pi$(x) is R(x) < Li(x) < $\frac{x}{lnx}$. The logarithmic integral function is Li(x) = $\int_{2}^{x}\frac{1}{lnt}dt$ ~ $\frac{x}{lnx}\sum\limits_{k=0}^{\infty}\frac{k!}{(lnx)^k}=\frac{x}{lnx}(1+\frac{1!}{(lnx)^1}+\frac{2!}{(lnx)^2}+\cdots)$. This paper shows that the $\pi$(x) can be represent with finite Li(x), and presents generalized prime counting function $\sqrt{{\alpha}x}{\pm}{\beta}$. Firstly, the $\pi$(x) can be represent to $Li_3(x)=\frac{x}{lnx}(\sum\limits_{t=0}^{{\alpha}}\frac{k!}{(lnx)^k}{\pm}{\beta})$ and $Li_4(x)=\lfloor\frac{x}{lnx}(1+{\alpha}\frac{k!}{(lnx)^k}{\pm}{\beta})}k\geq2$ such that $0{\leq}t{\leq}2k$. Then, $Li_3$(x) is adjusted by $\pi(x){\simeq}Li_3(x)$ with ${\alpha}$ and error compensation value ${\beta}$. As a results, this paper get the $Li_3(x)=Li_4(x)=\pi(x)$ for $x=10^k$. Then, this paper suggests a generalized function $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$. The $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$ function superior than Riemann's zeta function in representation of prime counting.