Optimizing two-level preconditionings for the conjugate gradient method

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The construction of efficient iterative linear equation solversfor ill-conditioned general symmetric positive definite systems is discussed.Certain known two-level conjugate gradient preconditioning techniquesare presented in a uniform way and are further generalized andoptimized with respect to the spectral or the K-condition numbers. Theresulting constructions have shown to be useful for the solution of largescaleill-conditioned symmetric positive definite linear systems.

Cite

CITATION STYLE

APA

Axelsson, O., & Kaporin, I. (2001). Optimizing two-level preconditionings for the conjugate gradient method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2179, pp. 3–21). Springer Verlag. https://doi.org/10.1007/3-540-45346-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free