اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA new fractional derivative without singular kernel: Application to the modelling of the steady heat flow
361
0
0.0
(
0
)
تأليف
Xiao-Jun Yang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we propose a new fractional derivative without singular kernel. We consider the potential application for modeling the steady heat-conduction problem. The analytical solution of the fractional-order heat flow is also obtained by means of the Laplace transform.
قيم البحث
اقرأ أيضاً
In this paper, a new fractional derivative involving the normalized sinc function without singular kernel is proposed. The Laplace transform is used to find the analytical solution of the anomalous heat-diffusion problems. The comparative results bet
ween classical and fractional-order operators are presented. The results are significant in the analysis of one-dimensional anomalous heat-transfer problems.
This paper addresses the mathematical models for the heat-conduction equations and the Navier-Stokes equations via fractional derivatives without singular kernel.
We study the long-time behavior of the Cesaro means of fundamental solutions for fractional evolution equations corresponding to random time changes in the Brownian motion and other Markov processes. We consider both stable subordinators leading to e
quations with the Caputo-Djrbashian fractional derivative and more general cases corresponding to differential-convolution operators, in particular, distributed order derivatives.
In this note we provide a direct approach to the most basic operator in this theory namely the exterior derivative. The crucial ingredient is a calculus lemma based on determinants. We maintain the view that in a first course at least this direct app
roach is preferable to the more abstract one based on characterization of the exterior derivative in terms of its properties.
We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one source/sink pair
among the n distinguished source/sink pairs at a time and treat the given multicommodity network as a single commodity network for such chosen source/sink pair. Then applying standard labeling algorithm, separately for each sink/source pair, the feasible flow which is max flow and the corresponding minimum cut corresponding to each source/sink pair is obtained. A record is made of these cuts and the paths flowing through the edges of these cuts. This record is then utilized to develop our algorithm to obtain max flow for multicommodity flow. In this paper we have pinpointed the difficulty behind not getting a max flow min cut type theorem for multicommodity flow and found out a remedy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
