In this paper parallel methods for solving large order linear equation
s, i.e. the implicit Matrix Elimination (PIE) and Quadrant Interlockin
g Factorisation (WZ) methods are compared. Timings on a shared memory
computer confirm the superiority of the new methods for both sequentia
l and parallel implementations over the Gaussian Elimination and LU fa
ctorisation methods.