Schur algorithm in the class \({\mathcal{SI}}\) of \(J\)-contractive functions intertwining solutions of linear differential equations (Q1946557)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Schur algorithm in the class \({\mathcal{SI}}\) of \(J\)-contractive functions intertwining solutions of linear differential equations
scientific article

    Statements

    Schur algorithm in the class \({\mathcal{SI}}\) of \(J\)-contractive functions intertwining solutions of linear differential equations (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2013
    0 references
    The class \({\mathcal{SI}}\) of \(J\)-contractive functions, depending on a parameter and arising as transfer functions of overdetermined conservative \(2D\) systems invariant in one direction, was introduced in [\textit{A. Melnikov}, Overdetermined \(2D\) systems invariant in one direction and their transfer functions. PhD thesis, Ben Gurion University (2009)]. The present study is devoted to an extension and solving of some problems from the class \({\mathcal{S}}\) of functions contractive in the open right-half plane, and unitary on the imaginary line with respect to some preassigned signature matrix \(J\), to the class \({\mathcal{SI}}\). The paper is organized in five sections. The first one is dedicated to the introduction in the topic and presenting two Nevanlinna-Pick interpolation problems in the \({\mathcal{SI}}\) setting. In the second section, main results from the above quoted paper relevant for the present work are recalled. In the third section, some results from [\textit{D. Alpay} and \textit{H. Dym}, Oper. Theory, Adv. Appl. 18, 89--159 (1986; Zbl 0594.46022)] are adapted to the case of row-valued functions. Also, a new formula for a realization of a Schur function after implementation of the tangential Schur algorithm is presented. A tangential Schur algorithm for a function from \({\mathcal{SI}}\) is developed in the fourth section of the paper, which will help in solving the interpolation problems. The last section of the paper is devoted to a study of the two generalizations of the Nevanlinna-Pick interpolation problems in the class \({\mathcal{SI}}\). The first one is solved using the notion of positive pairs and for the second one, a criterion for solvability in terms of the initial data is presented.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Schur algorithm
    0 references
    time-invariant \(2D\)-systems
    0 references
    linear differential equations
    0 references
    0 references
    0 references