Description
Using the algorithms in LogarSturmfels and FabianskaQuadrat, this package computes a free basis of a projective module over a polynomial ring with coefficients in the rationals, integers, or a finite field. It also provides methods to solve related problems involving completing a unimodular matrix to a square invertible matrix over a polynomial ring with coefficients in the rationals, integers, or a finite field, or a Laurent polynomial ring with coefficients in the rationals or a finite field.
For mathematical background and applications, see

A. Fabianska. Algorithmic analysis of presentations of groups and modules. http://darwin.bth.rwthaachen.de/opus/volltexte/2009/2950/, Jan 2009.

T. Y. Lam. Serre's problem on projective modules. Springer Monographs in Mathematics. SpringerVerlag, Berlin, 2006.

A. Logar and B. Sturmfels. Algorithms for the QuillenSuslin theorem. J. Algebra, 145(1):231239, 1992.

A. Fabianska and A. Quadrat. Applications of the QuillenSuslin theorem to multidimensional systems theory. Grobner bases in control theory and signal processing. Radon Series Comp. Appl. Math (3):23106, 2007.