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

K. Moriya, T. Nodera

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish
Pages (from-to)345-352
Number of pages8
JournalJournal of Computational and Applied Mathematics
Volume199
Issue number2
DOIs
Publication statusPublished - 2007 Feb 15

Fingerprint

Approximate Inverse
Preconditioner
Linear systems
Linear Systems
Computing
Matrix Product
Product Form
Cross product
Costs

Keywords

  • Greedy algorithm
  • Newton scheme
  • Preconditioner
  • Reduced linear system
  • Schur complement

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Numerical Analysis

Cite this

A new scheme of computing the approximate inverse preconditioner for the reduced linear systems. / Moriya, K.; Nodera, T.

In: Journal of Computational and Applied Mathematics, Vol. 199, No. 2, 15.02.2007, p. 345-352.

Research output: Contribution to journalArticle

@article{a447f2fa18fa4b4686f0269f10e28c2a,
title = "A new scheme of computing the approximate inverse preconditioner for the reduced linear systems",
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.",
keywords = "Greedy algorithm, Newton scheme, Preconditioner, Reduced linear system, Schur complement",
author = "K. Moriya and T. Nodera",
year = "2007",
month = "2",
day = "15",
doi = "10.1016/j.cam.2005.08.033",
language = "English",
volume = "199",
pages = "345--352",
journal = "Journal of Computational and Applied Mathematics",
issn = "0377-0427",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

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

AU - Moriya, K.

AU - Nodera, T.

PY - 2007/2/15

Y1 - 2007/2/15

N2 - 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.

AB - 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.

KW - Greedy algorithm

KW - Newton scheme

KW - Preconditioner

KW - Reduced linear system

KW - Schur complement

UR - http://www.scopus.com/inward/record.url?scp=33749661597&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749661597&partnerID=8YFLogxK

U2 - 10.1016/j.cam.2005.08.033

DO - 10.1016/j.cam.2005.08.033

M3 - Article

AN - SCOPUS:33749661597

VL - 199

SP - 345

EP - 352

JO - Journal of Computational and Applied Mathematics

JF - Journal of Computational and Applied Mathematics

SN - 0377-0427

IS - 2

ER -