A note on the instability of Gaussian elimination

It is well-known that Gaussian elimination is very sensitive to round-off errors if row interchanges are not performed. In this note we make precise and prove the fact that there exist sets of data for which that algorithm leads to improper results regardless of how many digits are carried in the computation.Our research was supported in part by NSF grant GJ-797.