The Schur Algorithm in Terms of System Realization
Bernd Fritzsche, Victor Katsnelson, Bernd Kirstein

TL;DR
This paper explores the Schur algorithm through the lens of System Theory, illustrating how system realizations and colligations provide new insights into rational inner functions and their algebraic properties.
Contribution
It introduces a system-theoretic approach to the Schur algorithm, connecting rational inner functions with unitary matrix realizations and Redheffer coupling.
Findings
System realizations classify rational inner functions by unitary matrices.
Redheffer coupling selects specific representatives in equivalence classes.
The approach offers algebraic insights into the Schur algorithm.
Abstract
The main goal of this paper is to demonstrate the usefulness of certain ideas from System Theory in the study of problems from complex analysis. With this paper, we also aim to encourage analysts, who might not be familiar with System Theory, colligations or operator models to take a closer look at these topics. For this reason, we present a short introduction to the necessary background. The method of system realizations of analytic functions often provides new insights into and interpretations of results relating to the objects under consideration. In this paper we will use a well-studied topic from classical analysis as an example. More precisely, we will look at the classical Schur algorithm from the perspective of System Theory. We will confine our considerations to rational inner functions. This will allow us to avoid questions involving limits and will enable us to concentrate on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Advanced Research in Systems and Signal Processing
