- Journal Home
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
The Restrictively Preconditioned Conjugate Gradient Methods on Normal Residual for Block
- BibTex
- RIS
- TXT
@Article{JCM-26-240,
author = {},
title = {The Restrictively Preconditioned Conjugate Gradient Methods on Normal Residual for Block},
journal = {Journal of Computational Mathematics},
year = {2008},
volume = {26},
number = {2},
pages = {240--249},
abstract = { The {\em restrictively preconditioned conjugate gradient} (RPCG) method is further developed to solve large sparse system of linear equations of a block two-by-two structure. The basic idea of this new approach is that we apply the RPCG method to the normal-residual equation of the block two-by-two linear system and construct each required approximate matrix by making use of the incomplete orthogonal factorization of the involved matrix blocks. Numerical experiments show that the new method, called the {\em restrictively preconditioned conjugate gradient on normal residual} (RPCGNR), is more robust and effective than either the known RPCG method or the standard {\em conjugate gradient on normal residual} (CGNR) method when being used for solving the large sparse saddle point problems.},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/8621.html}
}
TY - JOUR
T1 - The Restrictively Preconditioned Conjugate Gradient Methods on Normal Residual for Block
JO - Journal of Computational Mathematics
VL - 2
SP - 240
EP - 249
PY - 2008
DA - 2008/04
SN - 26
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8621.html
KW - Block two-by-two linear system
KW - Saddle point problem
KW - Restrictively preconditioned conjugate gradient method
KW - Normal-residual equation
KW - Incomplete orthogonal factorization
AB - The {\em restrictively preconditioned conjugate gradient} (RPCG) method is further developed to solve large sparse system of linear equations of a block two-by-two structure. The basic idea of this new approach is that we apply the RPCG method to the normal-residual equation of the block two-by-two linear system and construct each required approximate matrix by making use of the incomplete orthogonal factorization of the involved matrix blocks. Numerical experiments show that the new method, called the {\em restrictively preconditioned conjugate gradient on normal residual} (RPCGNR), is more robust and effective than either the known RPCG method or the standard {\em conjugate gradient on normal residual} (CGNR) method when being used for solving the large sparse saddle point problems.
Junfeng Yin & Zhongzhi Bai. (1970). The Restrictively Preconditioned Conjugate Gradient Methods on Normal Residual for Block.
Journal of Computational Mathematics. 26 (2).
240-249.
doi:
Copy to clipboard