...
首页> 外文期刊>SIAM Journal on Matrix Analysis and Applications >A COMPARISON OF TWO-LEVEL PRECONDITIONERS BASED ON MULTIGRID AND DEFLATION
【24h】

A COMPARISON OF TWO-LEVEL PRECONDITIONERS BASED ON MULTIGRID AND DEFLATION

机译:基于多重网格和偏差的两层预处理器的比较

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

摘要

It is well known that two-level and multilevel preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coefficient matrices are symmetric and positive definite. A two-level PCG method combines a traditional (one-level) preconditioner, such as incomplete Cholesky, with a projection-type preconditioner to get rid of the effect of both small and large eigenvalues of the coefficient matrix; multilevel approaches arise by recursively applying the two-level technique within the projection step. In the literature, various such preconditioners are known, coming from the fields of deflation, domain decomposition, and multigrid (MG). At first glance, these methods seem to be quite distinct; however, from an abstract point of view, they are closely related. The aim of this paper is to relate two-level PCG methods with symmetric two-grid (V(1,1)-cycle) preconditioners (derived from MG approaches), in their abstract form, to deflation methods and a two-level domain-decomposition approach inspired by the balancing Neumann-Neumann method. The MG-based preconditioner is often expected to be more effective than these other two-level preconditioners, but this is shown to be not always true. For common choices of the parameters, MG leads to larger error reductions in each iteration, but the work per iteration is more expensive, which makes this comparison unfair. We show that, for special choices of the underlying one-level preconditioners in the deflation or domain-decomposition methods, the work per iteration of these preconditioners is approximately the same as that for the MG preconditioner, and the convergence properties of the resulting two-level PCG methods will also be (approximately) the same. This means that, in this respect, the particular choice of the two-level preconditioner is less important than the choice of the parameters. Numerical experiments are presented to emphasize the theoretical results.
机译:众所周知,两级和多级预处理共轭梯度(PCG)方法为求解系数矩阵为对称且正定的大型和稀疏线性系统提供了有效的技术。二级PCG方法将传统的(一级)预处理器(例如不完整的Cholesky)与投影型预处理器结合在一起,以消除系数矩阵的较小和较大特征值的影响。多级方法是通过在投影步骤中递归应用二级技术而产生的。在文献中,已知各种这样的预处理器,它们来自放气,域分解和多重网格(MG)。乍一看,这些方法似乎截然不同。但是,从抽象的角度来看,它们是密切相关的。本文的目的是将具有对称两网格(V(1,1)-循环)预处理器(源自MG方法)的两级PCG方法以抽象形式与放气方法和两级域相关联分解法受平衡Neumann-Neumann方法的启发。人们通常希望基于MG的预处理器比其他两级预处理器更有效,但事实并非总是如此。对于常见的参数选择,MG会在每次迭代中减少更大的错误,但是每次迭代的工作成本更高,这使得这种比较是不公平的。我们表明,对于通缩或域分解方法中底层一级预处理器的特殊选择,这些预处理器的每次迭代工作与MG预处理器的每次迭代工作大致相同,并且所得到的两个预处理器的收敛性PCG级别的方法也将(大约)相同。这意味着在这方面,两级预处理器的特定选择不如参数选择重要。进行数值实验以强调理论结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号