Simultaneous Frobenius-Padé approximants (Q1763649)

The authors consider simultaneous rational approximation with common denominator in the sense of the so called `German Polynomials' [cf. \textit{K. Mahler}, Perfect Systems, Comp. Math. 19, 95--166 (1968; Zbl 0168.31303)], constructed from formal power series \((f^1,\dots,f^d)\) in orthogonal polynomials \(\{P_k\}_{k\geq 0}\) with respect to a weight \(w(x)\) on \([a,b],\;f^j\in \text{L}^2([a,b],w)\) \[ f_j(z)=\sum_{k=0}^{\infty}\, f_k^jP_k(z),\;f_k^j={1\over | | P_k| | _2^2}\, \int_a^b\, f^j(x)P_k(x)w(x)dx\;(1\leq j\leq d, \,k\geq 0. \] Imposing a determinantal condition to ensure uniqueness of the rational approximants, given two `multi-indices' \((p_1,\ldots,p_d)\) and \((q_1,\dots,q_d)\) of non-negative integers, the authors then study sequences of approximants. They give three `regular algorithms' connected with vertical sequences (degree of denominator \(md+k\), order of approximation \(n\) for all functions), diagonal sequences (numerator degrees \(p\), denominator degree \(md+k\), order of approximation \(p+m+1\) for the first \(k\) functions and \(p+m\) for the others) and a type of `anti-diagonal sequence' (order of approximation fixed \((n_1,\dots,n_d)\), degree of the denominator increases from \(0\) to \(\sum_j\,n_j\) and at the same time the degrees of the numerators decrease from the vector \((n_1,\dots,n_d)\) to \((0,\dots,0)\). Moreover, algorithms are given to calculate the entire Frobenius-Padé table.