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 language | English |
|---|---|
| Pages (from-to) | 113-144 |
| Number of pages | 32 |
| Journal | Linear Algebra and Its Applications |
| Volume | 369 |
| Issue number | SUPP. |
| DOIs | |
| State | Published - 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
ASJC Scopus subject areas
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics