Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning

0404751 - UIVT-O 20020076 RIV US eng J - Článek v odborném periodiku
Rozložník, Miroslav - Simoncini, V.
Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning.
SIAM Journal on Matrix Analysis and Applications. Roč. 24, č. 2 (2002), s. 368-391. ISSN 0895-4798. E-ISSN 1095-7162
Grant CEP: GA ČR GA101/00/1035; GA ČR GA201/00/0080
Výzkumný záměr: AV0Z1030915
Klíčová slova: saddle point problems * preconditioning * indefinite linear systems * finite precision arithmetic * conjugate gradients
Kód oboru RIV: BA - Obecná matematika
Impakt faktor: 0.753, rok: 2002

In this paper we analyze the null-space projection (constraint) indefinite preconditioner applied to the solution of large-scale saddle point problems. Nonsymmetric Krylov subspace solvers are analyzed; moreover, it is shown that the behavior of short-term recurrence methods can be related to the behavior of preconditioned conjugate gradient method (PCG). Theoretical properties of PCG are studied in detail and simple procedures for correcting possible misconvergence are proposed. The numerical behavior ...
Trvalý link: http://hdl.handle.net/11104/0124987