Efficient parallel Gauss-Doolittle matrix triangulation

Abstract An efficient parallel procedure for the triangulation of real symmetric (or complex Hermitian) matrices is presented. The methods of Gauss and Doolittle have previously been combined to produce a hybrid sequential method that was computationally faster than both. Numerical results demonstrate that this advantage is retained when MIMD (multiple instruction multiple data) distributed memory parallel processing is employed, so that parallel Gauss-Doolittle triangulation is faster than the equivalently parallelized Gauss elimination method.