The problem of minimal Padé approximation was conceived by A. Bultheel
and M. Van Barel in their study of the Euclidean algorithm in the matrix
In the scalar case, the minimal Padé approximants are generically equal to the
classical Padé approximants, but a minimal Padé approximant is not
characterized by a numerator and
a denominator degree, but by two other parameters.
A table with respect to these parameters is considered here.
We characterize the structure of this minimal Padé approximation table by
establishing connections with the classical Padé table. A property of
square block structure of the table is formulated.