A comparative study of algorithms for computing the Smith normal form of an integer matrix†
Vangalur Alagar, Asim Kumar Roy · International Journal of Systems Science · 1984
Several algorithms have been studied for computing the Smith normal form of an integer matrix. The algorithms are analysed and their run-time performances are compared. The algorithms that incorporate modular techniques overcome integer overflow problems and increase the computing power by several orders of magnitude.