...
首页> 外文期刊>SIAM Journal on Scientific Computing >MULTIPLE GALERKIN ADAPTIVE ALGEBRAIC MULTIGRID ALGORITHM FOR THE HELMHOLTZ EQUATIONS
【24h】

MULTIPLE GALERKIN ADAPTIVE ALGEBRAIC MULTIGRID ALGORITHM FOR THE HELMHOLTZ EQUATIONS

机译:HELMHOLTZ方程的多重伽勒金自适应代数多重网格算法

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

摘要

Introduced in this paper is a multiple Galerkin adaptive algebraic multigrid algorithm for solving linear discrete equations arising from discretization of partial differential operators with a rich and diverse near-kernel. Standard multigrid methods struggle with solving such equations due to their inability to produce accurate coarse correction to all near-kernel components. The motivating model problem here is the indefinite Helmholtz operators for which the character of near-kernel components is, at least approximately, known. In the algorithm, some of these components are used to create multiple prolongation operators and consecutive coarse descriptions which collectively approximate the entire near-kernel. The algorithm consists of two parts, with multiple Galerkin corrections accelerating a standard multigrid V-cycle. Both parts largely employ standard multigrid techniques. The resulting algorithm is then used to precondition the GMRES. Numerical experiments in one and two dimensions are presented, demonstrating the applicability of the method for problems with different types of wave numbers. Further leads in improving and extending the proposed approach conclude the paper.
机译:本文介绍了一种多元Galerkin自适应代数多重网格算法,用于求解由离散微分算子离散化而产生的线性离散方程,其中偏微分算子具有丰富且多样的近核。由于标准多重网格方法无法对所有近核组件进行精确的粗略校正,因此难以解决这些方程。激励模型问题在这里是不确定的亥姆霍兹算子,近核成分的特性至少是已知的。在该算法中,其中一些组件用于创建多个加长运算符和连续的粗略描述,以共同逼近整个近核。该算法由两部分组成,多个Galerkin校正可加速标准的多重网格V周期。这两部分都采用标准的多重网格技术。然后使用所得算法对GMRES进行预处理。进行了一维和二维数值实验,证明了该方法对不同类型波数问题的适用性。本文总结了进一步改进和扩展所提出方法的线索。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号