Balanced Incomplete Factorization
Abstract
The paper deals with the new algorithm to precondition large, sparse, symmetric and positive definite linear systems. The strategy is based on computing both direct and inverse decomposition of the system matrix and their balancing via dropping rules. It is shown that the resulting decomposition leads to rather robust preconditioning.