Bivariate polynomial and continued fraction interpolation over ortho-triples (Q544061)

The authors generalize an earlier result obtained by \textit{H. E. Salzer} [Numer. Approx., Proc. Sympos. Math. Res. Center, Madison, 1958, 61--98 (1959; Zbl 0086.11302)] regarding an algorithm for divided differences in two variables. In Section 2 ``Bivariate B-net of the interpolating polynomial'', starting with Salzer's algorithm, by means of area coordinate expression, the authors construct the B-net on each triangle. As a special case, they discuss the explicit coefficient expression in the B-net method on one ortho-triple and two ortho-triples respectively with which they obtain some properties including the formulas of multiple integrals on each ortho-triple triangular domain. The main results of the section are Theorem 2.1, Theorem 2.2 (representation of the interpolating polynomial), Property 2.1 (representation of the derivatives in the corners of each ortho-triples), Property 2.2 (representation of multiple integrals on each ortho-triple triangular domain). In Section 3 ``Computation of the bivariate continued fraction interpolation'', by means of new partial inverse divided differences with support points, the bivariate continued fraction is applied to rational interpolation over ortho-triples in \(\mathbb R^2\). The three-term recurrence relation play a vital role on determining the degrees of the numerator and denominator of the rational function. First, the authors develop a new algorithm of partial inverse differences (Algorithm 3.1) and next, to show that all the coefficients can be worked out with the recursive formulas in Algorithm 3.1, the authors prove the property of group symmetry for any of the bracketed expression in the formulas (Lemma 3.1, Lemma 3.2, Theorem 3.1). Based on Algorithm 3.1 and the property of group symmetry, a finite-sum identity is proved (Theorem 3.2). Applying the above results, interesting results in rational interpolation over ortho-triples are obtained (Theorem 3.3, Theorem 3.4, Theorem 3.5). Section 4 contains numerical examples.