In this paper algorithms far the computation of all four Luonbarger canonical forms are presented. The algorithms are based on an appropriate sequence of elementary similarity transformations and are well suited to digital computer implementation. They also provide considerable improvement over existing methods particularly when the transformation matrix as well as the canonical form is required.