首页> 外文期刊>Neural computing & applications >Solutions of Bagley–Torvik and Painlevé equations of fractional order using iterative reproducing kernel algorithm with error estimates
【24h】

Solutions of Bagley–Torvik and Painlevé equations of fractional order using iterative reproducing kernel algorithm with error estimates

机译:使用迭代再现内核算法的分数顺序的Bagley-Torvik和Painlevé方程的解决方案

获取原文
获取原文并翻译 | 示例
           

摘要

Abstract This paper presents iterative reproducing kernel algorithm for obtaining the numerical solutions of Bagley–Torvik and Painlevé equations of fractional order. The representation of the exact and the numerical solutions is given in the $$ hat{W}_{2}^{3} left[ {0,1} ight] $$ W ^ 2 3 0 , 1 , $$ W_{2}^{3} left[ {0,1} ight] $$ W 2 3 0 , 1 , and $$ W_{2}^{1} left[ {0,1} ight] $$ W 2 1 0 , 1 inner product spaces. The computation of the required grid points is relying on the $$ hat{R}_{t}^{{left{ 3 ight}}} left( s ight) $$ R ^ t 3 s , $$ R_{t}^{{left{ 3 ight}}} left( s ight) $$ R t 3 s , and $$ R_{t}^{{left{ 1 ight}}} left( s ight) $$ R t 1 s reproducing kernel functions. An efficient construction is given to obtain the numerical solutions for the equations together with an existence proof of the exact solutions based upon the reproducing kernel theory. Numerical solutions of such fractional equations are acquired by interrupting the $$ n $$ n -term of the exact solutions. In this approach, numerical examples were analyzed to illustrate the design procedure and confirm the performance of the proposed algorithm in the form of tabulate data, numerical comparisons, and graphical results. Finally, the utilized results show the significant improvement in the algorithm while saving the convergence accuracy and time.
机译:摘要本文介绍了迭代再生核算法,用于获得分数顺序的Bagley-Torvik和Painlevé方程的数字解决方案。准确和数值解决方案的表示在$$ hat {w} _ {2} ^ {3} left [{0,1} rection] $$ w ^ 2 3 0,1,$ $ w_ {2} ^ {3} left [{0,1} revall] $$ w 2 3 0,1,和$$ w_ {2} ^ {1}左[{0,1} 右] $$ w 2 1 0,1内部产品空间。所需网格点的计算是依赖于$$ hat {r} _ {t} ^ {{ left {3 right }} left(s recte)$$ r ^ t 3 s ,$$ r_ {t} ^ {{ left {3 right }}}左(s over)$$ r t 3 s,和$$ r_ {t} ^ {{ left {1 }}} left(s 右)$$ R T 1 S再现内核功能。提供有效的结构,以获得方程的数值解决方案以及基于再现内核理论的确切解决方案的存在证明。通过中断精确解决方案的$$ N $ N -TERM来获取这种分数方程的数值解。在这种方法中,分析了数值例子以说明设计过程,并以表格数据,数值比较和图形结果的形式确认所提出的算法的性能。最后,利用结果显示了算法的显着改进,同时节省了收敛准确性和时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号