The computational cost of the previous procedure to compute accurately the LDU-factorization associated to Gauss elimination with symmetric m.
This phenomenon is similar to that of the backward error in Gauss elimination with partial pivoting, which is usually much smaller than the theoretical exponential bound.
16]) that diagonal dominance by rows or columns is inherited by the Schur complements obtained when performing Gauss elimination.
Although Gauss elimination without pivoting of a positive definite symmetric matrix is stable, it does not guarantee the well conditioning of the triangular factors.
pivoting interchanges the first and second rows and columns in the first step of Gauss elimination and it still produces another row and column exchange in the second step.
3]) comparisons beyond the cost of Gauss elimination with no pivoting) and the rook pivoting (see ,  and ), of lower computational cost (in the worst case, O([n.
2]) elementary operations beyond the cost of Gauss elimination with no pivoting.
But it has few modifications over the Gauss elimination method.
The implementation of the Gauss Elimination algorithm on several parallel machines using shared memory design and message passing programming model is reported in .
The number of arithmetic operations is more in Gauss Jordan method (150) than in Gauss Elimination method (136) since Gauss Jordan method uses backward elimination step.
But the total number of instructions is more for Gauss elimination method.
Brooks III, Gauss Elimination : A case study on Parallel Machines, IEEE International Conference, Compcon Spring '91, March 1991.