Limit periodic Schur algorithms, the case || = 1, d_ n <
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.
- Improved truncation error bounds for limit periodic continued fractions with additional assumptions on its elements
- A survey of truncation error analysis for Padé and continued fraction approximants
- Convergence of a limit periodic Schur continued fraction
- scientific article; zbMATH DE number 3946963 (Why is no real title available?)
- scientific article; zbMATH DE number 4084238 (Why is no real title available?)
- Convergence of the Schur Algorithm
- Truncation Error for Limit Periodic Schur Algorithms
- scientific article; zbMATH DE number 10575 (Why is no real title available?)
- Contraction of the Schur algorithm for functions bounded in the unit disk
This page was built for publication: Limit periodic Schur algorithms, the case \(|\gamma| = 1,\quad \sum d_ n < \infty\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688145)
