<p>This paper proposes an effective Schur complement based parallel preconditioner for solving general large sparse linear systems. The basic idea of this new preconditioning procedure is to transform a given original problem into several smaller systems that can be solved in parallel. The preconditioner is based on the domain multicoloring ordering and combines the Schur complement technique with low-rank corrections, and is different from the available existing Schur complement based preconditioners. Each smaller system corresponds to a color and a “local" solution. Numerical examples illustrate that the proposed preconditioner accelerates Krylov subspace iterative methods for large sparse linear systems considerably.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Schur complement based multicoloring low-rank correction preconditioner for linear systems

  • QingQing Zheng

摘要

This paper proposes an effective Schur complement based parallel preconditioner for solving general large sparse linear systems. The basic idea of this new preconditioning procedure is to transform a given original problem into several smaller systems that can be solved in parallel. The preconditioner is based on the domain multicoloring ordering and combines the Schur complement technique with low-rank corrections, and is different from the available existing Schur complement based preconditioners. Each smaller system corresponds to a color and a “local" solution. Numerical examples illustrate that the proposed preconditioner accelerates Krylov subspace iterative methods for large sparse linear systems considerably.