Skip to Main Content
This paper suggests a new algorithm for solving sparse linear systems which is readily parallelized and is very efficient for matrices arising in such domains as reservoir modeling. The algorithm is, in fact, a variant of the incomplete block factorization technique, accelerated by Biconjugate Gradient iterations or by another acceleration method. Implementation on a vector computer such as the IBM 3090 Vector Facility is described. We also suggest some refinements of known preconditioning methods enabling their parallel computation. Numerical experiments are presented to display the performance of the suggested methods. Special attention is given to fully implicit, multiphase models which yield asymmetrical systems.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.