Generalized spectral factorization problem for discrete time polynomial matrices via quadratic difference forms

被引:0
|
作者
Kaneko, O [1 ]
Fujii, T [1 ]
机构
[1] Osaka Univ, Grad Sch Engn, Toyonaka, Osaka 5608531, Japan
关键词
spectral factorization; discrete time; behavioral approach; quadratic difference forms; dissipativeness;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we address spectral factorization problems for discrete time polynomial matrices, Main concept used in this paper is based on quadratic differential/difference forms and dissipativeness, similarly to [6], [10] and [8] which treat the polynomial matrices with no zeros on the jw axis or the unit circle. Here, by using some inherent techniques in discrete time, we expand the spectral factorization algorithms for polynomial matrices with zeros on the unit circle via quadratic difference forms. Moreover, we show that this algorithm is also available to the singular polynomial matrices in discrete time.
引用
收藏
页码:1954 / 1959
页数:6
相关论文
共 50 条
  • [41] Application of the Rank-Factorization Method to the Analysis of Spectral Characteristics of Multiparameter Polynomial Matrices
    V. N. Kublanovskaya
    Journal of Mathematical Sciences, 2003, 114 (6) : 1820 - 1835
  • [42] LINEAR-QUADRATIC AND POLYNOMIAL NON-NEGATIVE MATRIX FACTORIZATION; APPLICATION TO SPECTRAL UNMIXING
    Meganem, Ines
    Deville, Yannick
    Hosseini, Shahram
    Deliot, Philippe
    Briottet, Xavier
    Duarte, Leonardo T.
    19TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO-2011), 2011, : 1859 - 1863
  • [43] STABILITY ROBUSTNESS OF INTERVAL MATRICES VIA LYAPUNOV QUADRATIC-FORMS
    GAROFALO, F
    CELENTANO, G
    GLIELMO, L
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1993, 38 (02) : 281 - 284
  • [44] BLOCK COMPANION MATRICES, DISCRETE-TIME BLOCK DIAGONAL STABILITY AND POLYNOMIAL MATRICES
    Wimmer, Harald K.
    OPERATORS AND MATRICES, 2009, 3 (01): : 111 - 124
  • [45] On the discrete linear quadratic minimum-time problem
    el Alami, N
    Ouansafi, A
    Znaidi, N
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1998, 335B (03): : 525 - 532
  • [46] On the discrete linear quadratic minimum-time problem
    El Alami, N.
    Ouansafi, A.
    Znaidi, N.
    Journal of the Franklin Institute, 1998, 335 B (03): : 525 - 532
  • [47] A note on a polynomial time solvable case of the quadratic assignment problem
    Erdogan, Gunes
    Tansel, Barbaros
    DISCRETE OPTIMIZATION, 2006, 3 (04) : 380 - 382
  • [48] Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations
    Neiger, Vincent
    PROCEEDINGS OF THE 2016 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC 2016), 2016, : 365 - 372
  • [49] INVERSE SPECTRAL PROBLEM FOR SOME GENERALIZED JACOBI HERMITIAN MATRICES
    Ivasiuk, I. Ya.
    METHODS OF FUNCTIONAL ANALYSIS AND TOPOLOGY, 2009, 15 (04): : 333 - 355
  • [50] Algorithm of J-spectral factorization of polynomial matrices (vol 33, pg 2179, 1997)
    Aliev, FA
    Larin, VB
    AUTOMATICA, 1998, 34 (09) : 1153 - 1153