首页> 外文会议>Chemnitz finite element symposium >Comparison Analysis of Two Numerical Methods for Fractional Diffusion Problems Based on the Best Rational Approximations of t~γ on 0, 1
【24h】

Comparison Analysis of Two Numerical Methods for Fractional Diffusion Problems Based on the Best Rational Approximations of t~γ on 0, 1

机译:基于0,1上t〜γ的最佳有理逼近的两种分数阶扩散问题数值方法的比较分析

获取原文

摘要

The paper is devoted to the numerical solution of algebraic systems of the type A~αu = f, 0 < α < 1, where A is a symmetric and positive definite matrix. We assume that A is obtained from finite difference or finite element approximations of second order elliptic problems in R~d, d = 1,2 and we have an optimal method for solving linear systems with matrices A + cI. We study and compare experimentally two methods based on best uniform rational approximation (BURA) of t~γ on [0, 1] with the method of Bonito and Pasciak, (Math Comput 84(295):2083-2110, 2015), that uses exponentially convergent quadratures for the Dunford-Taylor integral representation of the fractional powers of elliptic operators. The first method, introduced in Harizanov et al. (Numer Linear Algebra Appl 25(4):115-128, 2018) and based on the BURA r_α(t) of t~(1-α) on [0, 1], is used to get the BURA of t~(-α) on [1, ∞) through t~(-1)r_α(t). The second method, developed in this paper and denoted by R-BURA, is based on the BURA r_(1-α)(t) of t~α on [0, 1] that approximates t~(-α) on [1, ∞) via r~(-1)_(1-α) (t). Comprehensive numerical experiments on some model problems are used to compare the efficiency of these three algorithms depending on a. The numerical results show that R-BURA method performs well for α close to 1 in contrast to BURA, which performs well for α close to 0. Thus, the two BURA methods have mutually complementary advantages.
机译:本文致力于A〜αu= f,0 <α<1的代数系统的数值解,其中A是一个对称的正定矩阵。我们假设A是从R〜d,d = 1,2的二阶椭圆问题的有限差分或有限元近似获得的,并且我们有一种求解矩阵A + cI的线性系统的最优方法。我们研究并比较了两种基于[0,1]上t〜γ的最佳均匀有理逼近(BURA)的方法与Bonito和Pasciak的方法(Math Comput 84(295):2083-2110,2015),对椭圆算子的分数次幂的Dunford-Taylor积分表示使用指数收敛的正交函数。第一种方法在Harizanov等人中介绍。 (Numer Linear Algebra Appl 25(4):115-128,2018)并基于[0,1]上t〜(1-α)的BURAr_α(t),用于获得t〜(的BURA -[α,∞)到t〜(-1)r_α(t)。本文开发的第二种方法是用R-BURA表示,它基于[0,1]上t〜α的BURA r_(1-α)(t),它近似于[1]上的t〜(-α)。 ,∞)通过r〜(-1)_(1-α)(t)。使用一些模型问题的综合数值实验来比较这三种算法的效率。数值结果表明,与BURA相比,R-BURA方法在α接近1时表现良好,而BURA在α接近0时表现良好。因此,两种BURA方法具有互补的优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号