Year: 1999
Author: Wei-Qing Ren, Jin-Xi Zhao
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 1 : pp. 89–96
Abstract
For the sparse linear equations $Kx=b$, where $K$ arising from optimization and discretization of some PDEs is symmetric and indefinite, it is shown that the $L \overline{L}^T $ factorization can be used to provide an "exact" preconditioner for SYMMLQ and UZAWA algorithms. "Inexact" preconditioner derived from approximate factorization is used in the numerical experiments.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1999-JCM-9084
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 1 : pp. 89–96
Published online: 1999-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: Generalized condition number Indefinite systems Factorization method.