arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.02863math.NAcs.NA
收藏

变阶分数阶扩散问题的有限元离散

Finite element discretizations for variable-order fractional diffusion problems

Wenyu Lei, George Turkiyyah, Omar Knio

AI总结:

针对变阶分数阶扩散问题,提出一种将刚度矩阵分解为稀疏矩阵、$\mathcal{H}^{2}$矩阵和加权质量矩阵的有限元离散策略,实现整体线性时空复杂度并验证了收敛性。

摘要:

我们提出了一种用于求解具有可变扩散率和分数阶的分数阶扩散问题的有限元格式。我们考虑了定义在一般几何形状和任意有界区域上的这些非局部方程的对称积分形式。在对这些方程进行离散化时遇到了许多挑战。第一个挑战来自分数积分算子中的异构核奇异性。第二个挑战来自稠密的离散算子,其内存占用和算术运算呈二次增长。另一个挑战来自需要处理体积条件——即经典局部边界条件在非局部环境下的推广。满足这些条件要求在离散化中的每个内部点上都能计算出整个区域(包括内部和外部区域)的影响。如果直接执行,这将导致二次复杂度。为了应对这些挑战,我们提出了一种将刚度矩阵分解为三个分量的策略。第一个分量是一个稀疏矩阵,单独处理奇异的近场,并通过将适用于均匀情况的奇异求积技术调整至空间变阶情况来进行计算。第二个分量处理近场中剩余的平滑部分以及远场,并由一个在存储和操作上保持线性复杂度的分层 $\mathcal{H}^{2}$ 矩阵来近似。第三个分量处理每个节点上全局网格的影响,并被写成一个加权质量矩阵,其密度通过快速多极子类型方法计算。因此,所得算法在整体上具有线性的空间和时间复杂度。我们提供了刚度矩阵一致性分析,并进行了数值实验以说明所提算法的收敛性和性能。

英文摘要:

We present a finite element scheme for fractional diffusion problems with varying diffusivity and fractional order. We consider a symmetric integral form of these nonlocal equations defined on general geometries and in arbitrary bounded domains. A number of challenges are encountered when discretizing these equations. The first comes from the heterogeneous kernel singularity in the fractional integral operator. The second comes from the dense discrete operator with its quadratic growth in memory footprint and arithmetic operations. An additional challenge comes from the need to handle volume conditions-the generalization of classical local boundary conditions to the nonlocal setting. Satisfying these conditions requires that the effect of the whole domain, including both the interior and exterior regions, can be computed on every interior point in the discretization. Performed directly, this would result in quadratic complexity. To address these challenges, we propose a strategy that decomposes the stiffness matrix into three components. The first is a sparse matrix that handles the singular near-field separately and is computed by adapting singular quadrature techniques available for the homogeneous case to the case of spatially variable order. The second component handles the remaining smooth part of the near-field as well as the far field and is approximated by a hierarchical $\mathcal{H}^{2}$ matrix that maintains linear complexity in storage and operations. The third component handles the effect of the global mesh at every node and is written as a weighted mass matrix whose density is computed by a fast-multipole type method. The resulting algorithm has therefore overall linear space and time complexity. Analysis of the consistency of the stiffness matrix is provided and numerical experiments are conducted to illustrate the convergence and performance of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑