A reliable method for computing M-Padé approximants on arbitrary staircases (Q1196842)

The M-Padé approximant of type \(n = (n_ 1,n_ 2,\dots, n_ m)\) is a tuple of \(m\) polynomials \(P_ 1(z)\), \(P_ 2(z), \dots, P_ m(z)\) having degrees bounded by \(n_ i\) such that \(P_ 1(z)f_ 1(z) + P_ 2(z) f_ 2(z) + \dots + P_ m(z) f_ m(z)\) has the given zeros \(z_ 0, z_ 1, \dots, z_{N - 1}\) with \(N = n_ 1 + n_ 2 + \dots + n_ m + m-1\), counting multiplicities. The functions \(f_ 1(z), f_ 2(z),\dots,f_ m(z)\) of a complex variable \(z\) are given and satisfy necessary continuity properties. The M-Padé approximation problem includes many classical interpolation problems like Hermite-Padé approximation \((z_ i \equiv 0)\) and rational approximation in the sense of Newton-Padé (\(m = 2\), \(f_ 1 = 1\), \(f_ 2 = f\)). In this paper a simple, efficient and reliable method is derived for computing M-Padé approximants on arbitrary staircases \((n_ k)\), \(1 \leq k \leq K\), consisting of ascending or descending steps. In contrasts to already existing algorithms, this method can also be applied to nonperfect systems with no additional costs.