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.
No takes yet. Share an insight, caveat, or question.
Sörensen (1985) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: