Factorization of J-unitary matrix polynomials on the line and a Schur algorithm for generalized Nevanlinna functions

D. Alpay, A. Dijksma, H. Langer

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We prove that a 2×2 matrix polynomial which is J-unitary on the real line can be written as a product of normalized elementary J-unitary factors and a J-unitary constant. In the second part we give an algorithm for this factorization using an analog of the Schur transformation.

Original languageEnglish
Pages (from-to)313-342
Number of pages30
JournalLinear Algebra and Its Applications
Volume387
Issue number1-3 SUPPL.
DOIs
StatePublished - 1 Aug 2004

Keywords

  • Elementary factor
  • Generalized Nevanlinna function
  • Indefinite metric
  • J-unitary matrix polynomial
  • Minimal factorization
  • Moment problem
  • Reproducing kernel Pontryagin space
  • Schur transform

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Factorization of J-unitary matrix polynomials on the line and a Schur algorithm for generalized Nevanlinna functions'. Together they form a unique fingerprint.

Cite this