Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 345-352 |
Number of pages | 8 |
Journal | Journal of Computational and Applied Mathematics |
Volume | 199 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2007 Feb 15 |
Externally published | Yes |
Keywords
- Greedy algorithm
- Newton scheme
- Preconditioner
- Reduced linear system
- Schur complement
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics