A variant of the fraction Gee form of Gaussian elimination is presente
d. This algorithm reduces the amount of arithmetic involved when the m
atrix has many zero entries. The advantage can be great for matrices w
ith symbolic entries (integers, polynomials, expressions in trigonomet
ric functions, etc.). These claims are supported with some analysis an
d experimental data.