The Schur algorithm for generalized Schur functions III: J -unitary matrix polynomials on the circle

Daniel Alpay, Tomas Azizov, Aad Dijksma, Heinz Langer

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)113-144
Number of pages32
JournalLinear Algebra and Its Applications
Volume369
Issue numberSUPP.
DOIs
StatePublished - 1 Aug 2003

Keywords

  • Elementary J -unitary matrix polynomials
  • Generalized Schur algorithm
  • Generalized Schur functions
  • Kernels with negative squares
  • Minimal factorizations
  • Reproducing kernel Pontryagin spaces

Fingerprint

Dive into the research topics of 'The Schur algorithm for generalized Schur functions III: J -unitary matrix polynomials on the circle'. Together they form a unique fingerprint.

Cite this