On the cost of sequential and parallel algorithms for solving linear system of equations
Salman H. Abbas · International Journal of Computer Mathematics · 2000
In this paper two parallel algorithms for solving dense linear equations are discussed. The algorithms are based on LU-decomposition followed by forward and backward substitutions. The algorithms are numerically stable and have been tested on the Sequent Balance Machine with efficient utilization of all processors.