A new scheme of computing the approximate inverse preconditioner for the reduced linear systems

作者:

Highlights:

摘要

In this paper, we propose a new implementation of the Newton scheme of an approximate preconditioner for the reduced linear system. In the original Newton scheme, the trouble is that the computation cost of the matrix–matrix product is always so expensive. On the other hand, the proposed implementation computes the preconditioner implicitly and reduces the cost of constructing the preconditioner by using the matrix–vector product form. We also show that the proposed implementation is less expensive than computing the preconditioner in explicit form.

论文关键词:Reduced linear system,Schur complement,Greedy algorithm,Preconditioner,Newton scheme

论文评审过程:Received 21 December 2004, Available online 24 January 2006.

论文官网地址:https://doi.org/10.1016/j.cam.2005.08.033