Recursive algorithms for the matrix Padé problem
Adhemar Bultheel · Mathematics of Computation · 1980
A matrix triangularization interpretation is given for the recursive algorithms computing the Padé approximants along a certain path in the Padé table, which makes it possible to unify all known algorithms in this field [5], [6]. For the normal Padé table, all these results carry over to the matrix Padé problem in a straightforward way. Additional features, resulting from the noncommutativity are investigated. A generalization of the Trench-Zohar algorithm and related recursions are studied in greater detail.