The computation of non-perfect Padé-Hermite approximants (Q1187057): Difference between revisions

A simple and efficient algorithm to generate a number of polynomial vectors is described which can be used to describe all possible solutions for a type 1 Padé-Hermite problem. If \(\sigma\) denotes the order of approximation, which is a measure for the size of the Padé-Hermite problem, it uses only order \(n^ 2\) operations, even if the given system is not perfect. To this end, the problem is considered as a special case of a generalized Padé-Hermite problem which is also defined and analyzed.