A new algorithm for calculating Pade approximants and its Matlab implementation

A new algorithm for calculating a Pade approximant is proposed. The algorithm is based on the choice of the Pade approximant's denominator of least degree. It is shown that the new algorithm does not lead to the appearance of the Froissart doublets in contrast to available procedures for calculating Pade approximants in Maple and Mathematica.