RUS  ENG
Full version
JOURNALS // Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya // Archive

Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2016 Issue 4, Pages 31–43 (Mi vspui308)

This article is cited in 4 papers

Applied mathematics

Solution of the rational interpolation problem via the Hankel polynomial construction

A. Yu. Utesheva, I. I. Baravy

a St. Petersburg State University, 7–9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation

Abstract: The problem of rational interpolant construction is treated as
$$ r(x)=p(x)/q(x),~\ \{r(x_j)=y_j\}_{j=1}^N,~ \{x_j,y_j\}_{j=1}^N \subset \mathbb C , \ \{p(x),q(x)\} \subset \mathbb C[x] \, . $$
At the basis of one result by C. Jacobi, the interpolant is represented as a ratio of two Hankel polynomials, i. e. polynomials of the form $ \mathcal H_{K}(x)= \det [c_{i+j-1}-c_{i+j-2}x]_{i,j=1}^{K} $. The generating sequence for these polynomials is selected as $ \{\sum_{j=1}^N x_j^ky_j/W^{\prime}(x_j) \}_{k\in \mathbb N} $ for $ q(x) $ and as $ \{\sum_{j=1}^N x_j^k/(y_jW^{\prime}(x_j)) \}_{k\in \mathbb N} $ for polynomial $ p(x) $; here $ W(x)=\prod_{j=1}^N(x-x_j) $. The conditions for the solubility of the problem and irreducibility of the obtained fraction are also presented. In addition to formal representation of the solution in determinantal form, the present paper is focused also at the effective computational algorithm for the Hankel polynomials. It is based on a little known identity by Jacobi and Joachimsthal connecting a triple of the Hankel polynomials of successive orders:
$$ \alpha \mathcal H_K(x)-(x+\beta) \mathcal H_{K-1}(x)+ 1/\alpha \mathcal H_{K-2}(x) \equiv 0 \ , $$
here $ \{\alpha,\beta \} \subset \mathbb C $ are some constants. The proof of this relation is also contained in the paper along with discussion of a degenerate case $ \alpha=0 $. With these results, a procedure for the Hankel polynomial computation can be developed which is recursive in its order. This gives an opportunity not only to compute a single interpolant with specialized degrees for $ p(x) $ and $ q(x) $ but also to compose the whole set of interpolants for an arbitrary combination for the degrees: $ \deg p + \deg q \le N-1 $. The results of the paper can be applied for problems of Approximation Theory, Control Theory (transfer function reconstruction from frequency responses) and for error-correcting coding (Berlekamp–Welch algorithm). Although the presented results are formulated for the case of infinite fields, they are applicable for finite fields as well. Refs 12.

Keywords: rational interpolation, Hankel matrices and polynomials, Berlekamp–Massey algorithm.

UDC: 519.65

Received: June 30, 2016
Accepted: September 29, 2016

DOI: 10.21638/11701/spbu10.2016.403



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026