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

V-循环多重网格算法用于非嵌套多边形网格上的不连续伽辽金方法

V-cycle multigrid algorithms for discontinuous Galerkin methods on non-nested polytopic meshes

Politecnico di Milano(米兰理工大学)

P. F. Antonietti, G. Pennesi

AI总结:

本文分析了V-循环多重网格算法在求解多边形网格上不连续伽辽金方法得到的线性方程组的收敛性质,证明了在适当选择平滑步骤数时,算法对网格细度和多项式阶数具有均匀收敛性。

摘要:

本文分析了V-循环多重网格算法在求解由多边形网格上不连续伽辽金离散化得到的二阶椭圆偏微分方程线性方程组的收敛性质。这里,多重网格方案的基础空间序列可能是非嵌套的,并基于聚合和可能的边/面粗化来获得。我们证明,只要平滑步骤数(依赖于p)足够大,方法在网格细度和多项式逼近阶数p方面均收敛。

英文摘要:

In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial differential equations on polytopal meshes. Here, the sequence of spaces that stands at the basis of the multigrid scheme is possibly non nested and is obtained based on employing agglomeration with possible edge/face coarsening. We prove that the method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large.

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

↑