...
首页> 外文期刊>Journal of Scientific Computing >Fast Iterative Method with a Second-Order Implicit Difference Scheme for Time-Space Fractional Convection-Diffusion Equation
【24h】

Fast Iterative Method with a Second-Order Implicit Difference Scheme for Time-Space Fractional Convection-Diffusion Equation

机译:时空分数对流扩散方程的带二阶隐式差分格式的快速迭代方法

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

摘要

In this paper we intend to establish fast numerical approaches to solve a class of initial-boundary problem of time-space fractional convection-diffusion equations. We present a new unconditionally stable implicit difference method, which is derived from the weighted and shifted Grunwald formula, and converges with the second-order accuracy in both time and space variables. Then, we show that the discretizations lead to Toeplitz-like systems of linear equations that can be efficiently solved by Krylov subspace solvers with suitable circulant preconditioners. Each time level of these methods reduces the memory requirement of the proposed implicit difference scheme from O(N-2) to O(N) and the computational complexity from O(N-3) to O(N log N) in each iterative step, where N is the number of grid nodes. Extensive numerical examples are reported to support our theoretical findings and show the utility of these methods over traditional direct solvers of the implicit difference method, in terms of computational cost and memory requirements.
机译:在本文中,我们打算建立快速的数值方法来解决一类时空分数对流扩散方程的初边界问题。我们提出了一种新的无条件稳定的隐式差分方法,该方法是从加权和移位的格伦瓦尔德公式导出的,并且在时间和空间变量上都收敛于二阶精度。然后,我们证明了离散化导致了线性方程的Toeplitz式系统,该系统可以由带有合适循环前置条件的Krylov子空间求解器有效地求解。这些方法的每个时间级别在每个迭代步骤中都减少了所提出的隐式差分方案从O(N-2)到O(N)的内存需求以及从O(N-3)到O(N log N)的计算复杂度,其中N是网格节点的数量。据报道,大量的数值示例支持了我们的理论发现,并在计算成本和内存需求方面证明了这些方法相对于隐式差分方法的传统直接求解器的实用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号