Determinantal representation of trigonometric polynomial curves via Sylvester method (Q380313): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Let, for an \(n \times n\) complex matrix \(A\), \(\; F_A(t,x,y) := \det(t \, I_n+x \, \mathfrak{R}(A)+y \, \mathfrak{I}(A))\) denote the real ternary form associated with the matrix \(A\), and let \[ \phi(\theta) = \sum_{k=-n}^n c_k \exp (ik\theta) \] be a trigonometric polynomial. Using Sylvester matrices, these authors present an algorithm to construct \(2n \times 2n\) matrices \(C_1\), \(C_2\), \(C_3\) such that, for a given trigonometric polynomial \(\phi(\theta),\) \[ \det (C_1 + \mathfrak{R}(\phi(\theta)) C_2 + \mathfrak{I} (\phi(\theta)) C_3) = 0. \] If \(\phi\) has the special form \(\phi(\theta) = \exp(in\theta) + a \exp(-im\theta)\), \(0 \leq \theta \leq 2\pi\), \(0 < m < n\), \(0 < a < 1\), then the matrices \(C_1\), \(C_2\), \(C_3\) are Hermitian, \(C_1\) is positive definite, and the relation \[ F_{C_0}(t,x,y) \det(C_1) = \det(tC_1+xC_2+yC_3), \] holds, where \(C_0 = C_1^{-1/2} (C_2+iC_3) C_1^{-1/2}.\)
Property / review text: Let, for an \(n \times n\) complex matrix \(A\), \(\; F_A(t,x,y) := \det(t \, I_n+x \, \mathfrak{R}(A)+y \, \mathfrak{I}(A))\) denote the real ternary form associated with the matrix \(A\), and let \[ \phi(\theta) = \sum_{k=-n}^n c_k \exp (ik\theta) \] be a trigonometric polynomial. Using Sylvester matrices, these authors present an algorithm to construct \(2n \times 2n\) matrices \(C_1\), \(C_2\), \(C_3\) such that, for a given trigonometric polynomial \(\phi(\theta),\) \[ \det (C_1 + \mathfrak{R}(\phi(\theta)) C_2 + \mathfrak{I} (\phi(\theta)) C_3) = 0. \] If \(\phi\) has the special form \(\phi(\theta) = \exp(in\theta) + a \exp(-im\theta)\), \(0 \leq \theta \leq 2\pi\), \(0 < m < n\), \(0 < a < 1\), then the matrices \(C_1\), \(C_2\), \(C_3\) are Hermitian, \(C_1\) is positive definite, and the relation \[ F_{C_0}(t,x,y) \det(C_1) = \det(tC_1+xC_2+yC_3), \] holds, where \(C_0 = C_1^{-1/2} (C_2+iC_3) C_1^{-1/2}.\) / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 47A12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 42A05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6226635 / rank
 
Normal rank
Property / zbMATH Keywords
 
trigonometric polynomial curves
Property / zbMATH Keywords: trigonometric polynomial curves / rank
 
Normal rank
Property / zbMATH Keywords
 
determinantal representation of curves
Property / zbMATH Keywords: determinantal representation of curves / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical range
Property / zbMATH Keywords: numerical range / rank
 
Normal rank
Property / zbMATH Keywords
 
Sylvester matrix
Property / zbMATH Keywords: Sylvester matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
Toeplitz matrices
Property / zbMATH Keywords: Toeplitz matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
Bézoutians
Property / zbMATH Keywords: Bézoutians / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank

Revision as of 11:36, 29 June 2023

scientific article
Language Label Description Also known as
English
Determinantal representation of trigonometric polynomial curves via Sylvester method
scientific article

    Statements

    Determinantal representation of trigonometric polynomial curves via Sylvester method (English)
    0 references
    0 references
    0 references
    13 November 2013
    0 references
    Let, for an \(n \times n\) complex matrix \(A\), \(\; F_A(t,x,y) := \det(t \, I_n+x \, \mathfrak{R}(A)+y \, \mathfrak{I}(A))\) denote the real ternary form associated with the matrix \(A\), and let \[ \phi(\theta) = \sum_{k=-n}^n c_k \exp (ik\theta) \] be a trigonometric polynomial. Using Sylvester matrices, these authors present an algorithm to construct \(2n \times 2n\) matrices \(C_1\), \(C_2\), \(C_3\) such that, for a given trigonometric polynomial \(\phi(\theta),\) \[ \det (C_1 + \mathfrak{R}(\phi(\theta)) C_2 + \mathfrak{I} (\phi(\theta)) C_3) = 0. \] If \(\phi\) has the special form \(\phi(\theta) = \exp(in\theta) + a \exp(-im\theta)\), \(0 \leq \theta \leq 2\pi\), \(0 < m < n\), \(0 < a < 1\), then the matrices \(C_1\), \(C_2\), \(C_3\) are Hermitian, \(C_1\) is positive definite, and the relation \[ F_{C_0}(t,x,y) \det(C_1) = \det(tC_1+xC_2+yC_3), \] holds, where \(C_0 = C_1^{-1/2} (C_2+iC_3) C_1^{-1/2}.\)
    0 references
    trigonometric polynomial curves
    0 references
    determinantal representation of curves
    0 references
    numerical range
    0 references
    Sylvester matrix
    0 references
    Toeplitz matrices
    0 references
    Bézoutians
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references