Computing the preconditioner for the Schur complement
Kentaro Moriya, Takashi Nodera
Abstract
Open-access reader
Kentaro Moriya, Takashi Nodera
Abstract
Open-access reader
The Newton scheme is used to construct an approximate inverse preconditioner for the Schur complement. However, this scheme is very expensive because of the computation cost of the matrix-matrix product. In this paper, the computation cost of the Newton scheme is reduced by implementing the preconditioner implicitly using the matrix-vector product. We also show that such an implementation is less expensive than computing the preconditioner explicitly.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Newton scheme is used to construct an approximate inverse preconditioner for the Schur complement. However, this scheme is very expensive because of the computation cost of the matrix-matrix product. In this paper, the computation cost of the Newton scheme is reduced by implementing the preconditioner implicitly using the matrix-vector product. We also show that such an implementation is less expensive than computing the preconditioner explicitly.
Key concepts: Preconditioner, Schur complement, Computation, Complement (music), Matrix (chemical analysis), Scheme (mathematics), Mathematics, Computer science