首页> 外文期刊>SIAM Journal on Scientific Computing >A HIERARCHICAL LOW RANK SCHUR COMPLEMENT PRECONDITIONER FOR INDEFINITE LINEAR SYSTEMS
【24h】

A HIERARCHICAL LOW RANK SCHUR COMPLEMENT PRECONDITIONER FOR INDEFINITE LINEAR SYSTEMS

机译:用于无限线性系统的分层低级SCHUR补充剂预处理器

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Nonsymmetric and highly indefinite linear systems can be quite difficult to solve by iterative methods. This paper combines ideas from the multilevel Schur low rank preconditioner developed by Y. Xi, R. Li, and Y. Saad [SIAM J. Matrix Anal., 37 (2016), pp. 235-259] with classic block preconditioning strategies in order to handle this case. The method to be described generates a tree structure T that represents a hierarchical decomposition of the original matrix. This decomposition gives rise to a block structured matrix at each level of T. An approximate inverse of the original matrix based on its block LU factorization is computed at each level via a low rank property that characterizes the difference between the inverses of the Schur complement and another block of the reordered matrix. The low rank correction matrix is computed by several steps of the Arnoldi process. Numerical results illustrate the robustness of the proposed preconditioner with respect to indefiniteness for a few discretized partial differential equations and publicly available test problems.
机译:通过迭代方法可以很难解决非对称和高度无限的线性系统。本文将由Y.Xi,R.Li和Y. Saad开发的多级Schur低排名前提者的想法与Y. Saad [Siam J. Matrix肛门。,37(2016),第235-259],经典块预处理策略为了处理这种情况。要描述的方法生成一个树结构T,其表示原始矩阵的分层分解。该分解在每个级别的T上产生块结构矩阵。通过低秩属性在每个级别计算原始矩阵的近似逆等级,该级别通过低秩属性来表征SCUR补充的逆之间的差异和另一个重新排序的矩阵块。低等级校正矩阵由Arnoldi过程的若干步骤计算。数值结果说明了所提出的预处理器对少数离散化部分微分方程和公开的测试问题的无限度的鲁棒性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号