Schur算法的系统实现
The Schur Algorithm in Terms of System Realization
摘要:
本文的主要目的是证明系统理论的某些思想在研究复分析问题中的有用性。通过这篇论文,我们还旨在鼓励分析师,谁可能不熟悉系统理论,聚合或运营商模型,仔细看看这些主题。为此,我们提出了一个简短的介绍必要的背景。解析函数的系统实现方法经常提供与所考虑对象有关的结果的新见解和解释。在本文中,我们将使用经典分析中一个研究得很好的主题作为例子。更准确地说,我们将从系统理论的角度来看待经典的舒尔算法。我们将把我们的考虑限制在理性的内函数上。这将使我们能够避免涉及极限的问题,并使我们能够专注于手头问题的代数方面。给定一个非负整数(n),我们用在所有酉((n + 1)\times(n + 1))-矩阵集合中适当构造的等价关系来描述给定的(n)次有理内函数的所有系统实现.系综的Redheffer耦合的概念使我们有可能从每个等价类中选择一个特定的代表。舒尔算法的合理内函数,因此,描述的状态空间表示。
英文摘要:
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 the algebraic aspects of the problem at hand. Given a non-negative integer (n), we describe all system realizations of a given rational inner function of degree (n) in terms of an appropriately constructed equivalence relation in the set of all unitary ((n + 1) \times (n + 1) )-matrices. The concept of Redheffer coupling of colligations gives us the possibility to choose a particular representative from each equivalence class. The Schur algorithm for a rational inner function is, consequently, described in terms of the state space representation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。