LU factorization on parallel computers

AbstractA new parallel algorithm for the LU factorization of a given dense matrix A is described. The case of banded matrices is also considered. This algorithm can be combined with Sameh and Brent's [SIAM J. Numer. Anal. 14, 1101–1113, (1977)] to obtain the solution of a linear system of algebraic equations. The arithmetic complexity for the dense case is 13n2 (12bn in the banded case), using 3(n − 1) processors and no square roots