Adapting Silverman's structure algorithm a general, efficient and recursive algorithm is given for the following problem. Given the Laurent expansion at α of a non-singular rational matrixA(p), compute the Laurent expansion of the inverseA(p)−1at α. The use of this algorithm in the inversion of rational and polynomial matrices and in particular the computation of the partial fraction expansion of the inverse are discussed.