Multipoint Schur algorithm and orthogonal rational functions. I: Convergence properties (Q415769): Difference between revisions

The connection between orthogonal polynomials on the unit circle and the Schur algorithm has been known for many years. The Schur algorithm associates to every Schur function a sequence of complex numbers inside the unit disk, called its Schur parameters, which can be viewed as hyperbolic analogues of Taylor coefficients at the origin. They generate a continued fraction expansion of the function whose truncations give rise to the so-called Schur approximants. In general there is no particular reason for the Schur approximants to distinguish the origin. It is thus natural to turn to the multipoints Schur algorithm. The role of orthogonal polynomials in this context is played by orthogonal rational functions, whose poles are located at the reflections through the unit circle of interpolation points. The comprehensive monograph by A. Bultheel et al. deals primarily with the case when such points are compactly supported in the disk. This paper is concerned with the determinate case, when the interpolation points can tend to the unit circle not too fast (out of the Blaschke condition). The authors derive analogues of Khrushchev's results on the convergence of Schur approximants. Next, the authors present a counterpart of the Szegő theory for the associated orthogonal rational functions.