2005ANZIAM JournalOpen access

Computing the preconditioner for the Schur complement

Kentaro Moriya, Takashi Nodera

Open full text 1 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Computing the preconditioner for the Schur complement — Research Paper | ScholarLens