A new parallel algorithm for solving sparse linear systems

In this paper, we consider the problem of solving a sparse system of linear equations using a new LU factorization based algorithm. The algorithm employs a new technique called two-sided factorization to produce the complete solution by solving only one triangular system after the factorization phase against the solution of two triangular systems in the existing LU factorization based methods. The effectiveness of the new algorithm in solving sparse linear systems on hypercubes is demonstrated using IEEE standard power system networks as benchmarks