On approximate factorization methods for block matrices suitable for vector and parallel processors (Q1072329)

Some existence results for methods based on the approximate factorization of block matrices are proven. These methods are based on recursive computations of diagonal block matrices and the approximation of their inverses to preserve sparsity. We also discuss a inverse free factorization method recently proposed by the first author [BIT 25, 166- 187 (1985; Zbl 0566.65017)] and present some numerical tests for it.