Limit periodic Schur algorithms, the case \(|\gamma| = 1,\quad \sum d_ n < \infty\) (Q688145)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limit periodic Schur algorithms, the case \(|\gamma| = 1,\quad \sum d_ n < \infty\) |
scientific article |
Statements
Limit periodic Schur algorithms, the case \(|\gamma| = 1,\quad \sum d_ n < \infty\) (English)
0 references
14 December 1993
0 references
Let \(f\) be holomorphic and \(| f(z)|\leq 1\) in the open unit disk \(| z|<1\). The Schur algorithm gives rise to a sequence \(\{\gamma_ n\}\) of complex numbers, \(|\gamma_ n|\leq 1\), terminating iff some \(|\gamma_ n|= 1\). If, in particular, \(\lim_{n\to\infty} \gamma_ n= \gamma\) exists, the Schur algorithm is called limit periodic. In the paper limit periodic Schur algorithms with \(\gamma= e^{i\theta}\), \(0\leq\theta< 2\pi\) are studied. The main result in the paper is: If \(\sum_{n=1}^ \infty d_ n<\infty\), where \(d_ n= \max_{k\geq n} | e^{i\theta}- \gamma_ k|\), then \(f\) has a meromorphic continuation to the whole plane, except possibly for an essential singularity at \(z=-1\). An important step in the proof is to establish a separate convergence result for the coefficients in the expression for a modified approximant. Finally a truncation error estimate is established, showing that the limit periodic Schur algorithm in such a case provides a very good approximation to the function.
0 references
Schur algorithm
0 references
limit periodic
0 references