Abstract
Theoretical predictions concerning the fill-in to sparse matrices when similarity transformations are used to reduce them to condensed form are made. These predictions are shown to be consistent with experimental results from runs on several test matrices and some conclusions are drawn as to the advisability of using sparsity techniques in such instances.