Istituto di Matematica Applicata e Tecnologie Informatiche     
Rozloznik M., Simoncini V. Short--term recurrences for indefinite preconditioning of saddle point problems. Preprint ercim.cnr.ian//2000-1181, 2000.
We are interested in the numerical solution of large structured indefinite symmetric linear systems arising in mixed finite element approximations of the magnetostatic problem; in particular, we analyze definite block--diagonal and indefinite symmetric preconditioners. Relating the algebraic characteristics of the resulting preconditioned matrix to the properties of the continuous problem and of its finite element discretization, we show that the considered preconditioning strategies make the used Krylov subspace solver insensitive to the mesh refinement parameter, in terms of number of iterations. In order to achieve computational efficiency, we also analyze algebraic approximations to the optimal preconditioners, and discuss their performance on real two and three dimensional application problems.
Subject Iterative methods, indefinite preconditioning, saddle point problems
65F10, 65F15, 65N30

Icona documento 1) Download Document PS

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional