首页> 外文期刊>Numerical linear algebra with applications >Algebraic analysis of aggregation-based multigrid
【24h】

Algebraic analysis of aggregation-based multigrid

机译:基于聚集的多重网格的代数分析

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

摘要

A convergence analysis of two-grid methods based on coarsening by (unsmoothed) aggregation is presented. For diagonally dominant symmetric (M-)matrices, it is shown that the analysis can be conducted locally; that is, the convergence factor can be bounded above by computing separately for each aggregate a parameter, which in some sense measures its quality. The procedure is purely algebraic and can be used to control a posteriori the quality of automatic coarsening algorithms. Assuming the aggregation pattern is sufficiently regular, it is further shown that the resulting bound is asymptotically sharp for a large class of elliptic boundary value problems, including problems with variable and discontinuous coefficients. In particular, the analysis of typical examples shows that the convergence rate is insensitive to discontinuities under some reasonable assumptions on the aggregation scheme.
机译:提出了基于(不平滑)聚集的粗化两网格方法的收敛性分析。对于对角线占优势的​​对称(M-)矩阵,它表明分析可以局部进行。也就是说,可以通过为每个集合分别计算一个参数(在某种意义上衡量其质量)来限制收敛因子。该过程是纯代数的,可用于控制后验自动粗化算法的质量。假设聚集模式足够规则,则进一步表明,对于一大类椭圆边界值问题(包括具有可变系数和不连续系数的问题),结果边界渐近尖锐。特别是,对典型示例的分析表明,在对聚合方案进行一些合理的假设下,收敛速度对不连续性不敏感。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号