On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
In this paper, to obtain an efficient parallel algorithm to solve sparse block-tridiagonal linear systems, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are suitable when the desired goal is to maximize parallelism. Moreover, some theoretical results concerning these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block tridiagonal H-matrices is also described. In addition, the validity of these preconditioners is illustrated with some numerical experiments arising from the second order elliptic partial differential equations and oil reservoir Simulations. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.
parallel algorithm tridiagonal matrix stair matrix polynomial sparse approximate preconditioning