The Schur-Potapov algorithm for sequences of complex \(p\times q\) matrices. I (Q997395)

A Schur sequence is basically the sequence of Taylor coefficients of a Schur function, i.e., a function analytic in the unit disk and bounded by 1. The Schur-Potapov (SP) algorithm is a matrix version of the classical Schur algorithm transforming a matrix valued Schur sequence or a matrix valued Schur function into a sequence of matricial SP parameters. In this paper, the analysis of the algorithm and the related results is developed for infinite \(p\times q\) Schur sequences and Schur functions, but hereby following as much as possible the original ideas of \textit{I. Schur} [Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. I, II. J. Reine Angew. Math. 147, 205--232 (1917); 148, 122--145 (1918; JFM 46.0475.01)]. Only nondegenerate Schur sequences are considered, i.e., all truncated lower triangular block Toeplitz matrices whose entries are the sequence elements and are strictly contractive, and also the underlying Schur functions are strictly contractive which results in SP parameters all being strictly contractive. Thus establishing a one-to-one correspondence between a subset of nondegenerate Schur sequences and sequences of strictly contractive SP parameters. In part two of this paper applications are considered [see \textit{S. Bogner, B. Fritzsche} and \textit{B. Kirstein}, Complex Anal. Oper. Theory 1, No.~2, 235--278 (2007; Zbl 1209.30015)].