Analysis of Pairwise Pivoting in Gaussian Elimination
Sörensen · IEEE Transactions on Computers · 1985
The method of Gaussian elimination using triangularization by elementary stabilized matrices constructed by pairwise pivoting is analyzed. It is shown that a variant of this scheme which is suitable for implementation on a paralle computer is numerically stable although the bound is larger than the one for the standard partial pivoting algorithm.