TY - JOUR

T1 - The Schur algorithm for generalized Schur functions III

T2 - J -unitary matrix polynomials on the circle

AU - Alpay, Daniel

AU - Azizov, Tomas

AU - Dijksma, Aad

AU - Langer, Heinz

N1 - Funding Information:
This research was supported in part by grants from the Russian Foundation for Basic Research RFBR 02-01-00353, the Netherlands Organization for Scientific Research NWO 047-008-008 and NWO 61-453, and by the Research Training Network HPRN-CT-2000-00116 of the European Union.

PY - 2003/8/1

Y1 - 2003/8/1

N2 - The Schur algorithm for generalized Schur functions was used for solving a unitary matrix polynomial on the unit circle. The result obtained for a 2×2 matrix polynomial on the unit circle was essentially a unique product of elementary 2×2 matrix. The paper also described the reproducing of Kernel Pontryagin spaces associated with generalized Schur functions.

AB - The Schur algorithm for generalized Schur functions was used for solving a unitary matrix polynomial on the unit circle. The result obtained for a 2×2 matrix polynomial on the unit circle was essentially a unique product of elementary 2×2 matrix. The paper also described the reproducing of Kernel Pontryagin spaces associated with generalized Schur functions.

KW - Elementary J -unitary matrix polynomials

KW - Generalized Schur algorithm

KW - Generalized Schur functions

KW - Kernels with negative squares

KW - Minimal factorizations

KW - Reproducing kernel Pontryagin spaces

UR - http://www.scopus.com/inward/record.url?scp=0038044595&partnerID=8YFLogxK

U2 - 10.1016/S0024-3795(02)00734-6

DO - 10.1016/S0024-3795(02)00734-6

M3 - Article

AN - SCOPUS:0038044595

VL - 369

SP - 113

EP - 144

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

SN - 0024-3795

IS - SUPP.

ER -