@Article{JCM-26-2,
author = {},
title = {The Restrictively Preconditioned Conjugate Gradient Methods on Normal Residual for Block Two-by-Two Linear Systems},
journal = {Journal of Computational Mathematics},
year = {2008},
volume = {26},
number = {2},
pages = {240--249},
abstract = {<p style="text-align: justify;">The $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 $restrictively$ $preconditioned$ $conjugate$ $gradient$ $on$ $normal$ $residual$ (RPCGNR), is more robust and effective than either the known RPCG method or the standard $conjugate$ $gradient$ $on$ $normal$ $residual$ (CGNR) method when being used for solving the large sparse saddle point problems.</p>},
issn = {1991-7139},
doi = {https://doi.org/2008-JCM-8621},
url = {https://global-sci.com/article/84919/the-restrictively-preconditioned-conjugate-gradient-methods-on-normal-residual-for-block-two-by-two-linear-systems}
}