On the conditioning analysis of block approximate factorization methods

AbstractThe paper is devoted to the conditioning analysis of modified block incomplete factorizations of a given Stieltjes matrix. We obtain new results, improve other theories, and compare all existing upper bounds through numerical experiments. Applied to discrete elliptic PDEs, our results show that an O(h−1) spectral bound can be achieved for a large class of problems