We consider the application of the generalized Convolution Quadrature (gCQ) of the first order to approximate fractional integrals and associated fractional diffusion equations. The gCQ is a generalization of Lubich's Convolution Quadrature (CQ) which allows for variable steps. In this paper we analyze the application of the gCQ to fractional integrals, with a focus on the low regularity case. It is well known that in this situation the original CQ presents an order reduction close to the singularity. The available theory for the gCQ does not cover this situation. Here we use a different expression for the numerical approximation and the associated error, which allows us to significantly relax the regularity requirements for the application of the gCQ method. In particular we are able to eliminate the a priori regularization step required in the original derivation of the gCQ. We show first order of convergence for a general time mesh under much weaker regularity requirements than previous results in the literature. We also prove that uniform first order convergence is achievable for a graded time mesh, which is appropriately refined close to the singularity, according to the order of the fractional integral and the regularity of the data. Then we study how to obtain full order of convergence for the application to linear fractional diffusion equations. An important advantage of the gCQ method is that it allows for a fast and memory reduced implementation. We outline how this algorithm can be implemented and illustrate our theoretical results with several numerical experiments.
翻译:我们考虑将一阶广义卷积积分法(gCQ)用于逼近分数积分和相关的分数扩散方程。gCQ是Lubich卷积积分法的推广,允许使用可变步长。本文分析了gCQ对分数积分的应用,重点关注低正则性情况。众所周知,在这种情况下,原始CQ在奇异点附近呈现出降阶现象。目前gCQ的可用理论并不涵盖这种情况。本文使用了不同的数值逼近及其误差表达式,使得我们能够显著放松gCQ方法应用的正则性要求,并且能够消除原来gCQ的先验正则化步骤。我们在更弱的正则性条件下证明了通用时间网格的一阶收敛性,这种情况下的收敛速率要优于先前研究。我们还证明了,在分数积分的阶数和数据正则性适当的情况下,可以实现均匀一阶收敛性,为此需要采用梯度时序网格,该网格在接近奇异点的位置进行适当细化。然后我们研究如何获得完全的收敛阶数,用于应对线性分数扩散方程。gCQ方法的一个重要优势在于它可以实现快速且占用内存较少的求解过程。我们概述了该算法的实现方法,并通过多个数值实验验证了理论结果。