On the conditioning analysis of block approximate factorization methods (Q1176525)

For computing the solution of large sparse positive definite linear systems derived from discrete elliptic partial differential equations, much effort focuses on polynomially accelerated preconditioned iterative methods. This leads to the use of incomplete block factorizations as preconditioners. This paper deals with a conditioning analysis of modifed block incomplete factorizations of a Stieltjes matrix. New results are obtained and are compared with existing ones. A numerical example is treated.