Parametrization and Schur algorithm for the integral representation of Hankel forms in \(\mathbb{T}^ 2\) (Q1318628): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q686397
Property / author
 
Property / author: Q1318627 / rank
Normal rank
 

Revision as of 10:00, 20 February 2024

scientific article
Language Label Description Also known as
English
Parametrization and Schur algorithm for the integral representation of Hankel forms in \(\mathbb{T}^ 2\)
scientific article

    Statements

    Parametrization and Schur algorithm for the integral representation of Hankel forms in \(\mathbb{T}^ 2\) (English)
    0 references
    6 April 1994
    0 references
    The parametrization problem of the minimal unitary extensions of an isometric operator allows its application, through the spectral theorem, to the case of the Fourier representations of a bounded Hankel form with respect to the norms \((\int| f|^ 2 d\mu_ 1)^{1/2}\) and \((\int| f|^ 2 d\mu_ 2)^{1/2}\) where \(\mu_ 1,\mu_ 2\geq 0\) are finite measures in \(\mathbb{T}\sim[0,2\pi)\). In this work we develop a similar procedure for the two-parametric case, where \(\mu_ 1,\mu_ 2\geq 0\) are measures defined in \(\mathbb{T}^ 2\sim [0,2\pi)\times [0,2\pi)\). With this purpose, we define the generalized Toeplitz forms on the space of two-variable trigonometric polynomials and use the lifting existence theorems of Cotlar and Sadosky. We provide a parametrization formula which is also valid in the special case of the Nehari problem and gives rise to a Schur-type algorithm for this problem.
    0 references
    parametrization problem
    0 references
    minimal unitary extensions of an isometric operator
    0 references
    spectral theorem
    0 references
    Fourier representations of a bounded Hankel form
    0 references
    two-parametric case
    0 references
    space of two-variable trigonometric polynomials
    0 references
    Nehari problem
    0 references
    Schur-type algorithm
    0 references

    Identifiers