On computation of the canonical pencil of a linear system

An algorithm for computing the canonical form of a singular pencil is presented. This algorithm, which is based on well-known linear algebra techniques, offers efficiency and error analysis advantages over previous algorithms presented by Thorp and Gantmacher. These results are useful in exposing the structure of linear multivariable systems.