For some work I am doing with matrices with polynomial entries in certain parameters, I need to know for which values of the parameters there is a possibility that the rank of the matrix drops down. I tried using fraction free Gaussian elimination in both linalg and LinearAlgebra. The two methods do not always give the same resulting matrix. Moreover, the matrix is not as simple as it should be. I understand that a Gauss-Bareiss algorithm produces a result which I would be happier with. Does anyone know of such an implementation for Maple? I have been having some difficulty finding an explicit form for the algorithm on the net. Everything I have found gives references to it, but does not give an explicit description of the algorithm.