An algorithm for computing a Padé approximant with minimal degree denominator

In this paper, a new definition of a reduced Pade approximant and an algorithm for its computation are proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant always has nice properties which the classical Pade approximant possesses only in the normal case. The new algorithm allows us to avoid the appearance of Froissart doublets induced by computer roundoff in the non-normal Pade table.