...
首页> 外文期刊>International journal of computer mathematics >Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid
【24h】

Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid

机译:基于图匹配和不精确粗网格的聚合求解代数两个网格

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

摘要

A graph matching is used to construct aggregation-based coarsening for an algebraic two-grid method. Effects of inexact coarse grid sol ve is analysed numerically for a highly discontinuous convection-diffusion coefficient matrix, and for problems from the Florida matrix market collection. The proposed strategy is found to be more robust compared to a classical algebraic multi-grid approach based on strength of connections. Basic properties of two-grid method are outlined.
机译:图匹配用于代数两网格方法构造基于聚集的粗化。对高度不连续的对流扩散系数矩阵以及佛罗里达矩阵市场集合中的问题进行了数值分析,分析了不精确粗网格算法的影响。与基于连接强度的经典代数多网格方法相比,所提出的策略更加健壮。概述了两网格方法的基本特性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号