• DocumentCode
    1744818
  • Title

    Further results on primitive factorizations for nD polynomial matrices

  • Author

    Lin, Zhiping ; Ying, Jiang Qian ; Xu, Li

  • Author_Institution
    Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
  • Volume
    2
  • fYear
    2001
  • fDate
    6-9 May 2001
  • Firstpage
    373
  • Abstract
    This paper presents some further results on primitive factorizations for nD polynomial matrices. A new necessary and sufficient condition is derived for the existence of primitive factorization for an nD polynomial matrix whose content has only simple zeros. This condition is based on testing the common zeros of the reduced minors of some matrices associated with the given matrix, and hence provides a new insight into the primitive factorization problem. The new condition is also easy to implement computationally. A nontrivial example is illustrated. It is then shown via examples that it is still difficult to determine whether or not an nD polynomial matrix admits a primitive factorization when its content has a multiple zero
  • Keywords
    matrix decomposition; polynomial matrices; common zeros; multiple zero; nD polynomial matrices; nontrivial example; primitive factorizations; reduced minors; Equations; Information systems; Neodymium; Polynomials; Seminars; Sufficient conditions; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
  • Conference_Location
    Sydney, NSW
  • Print_ISBN
    0-7803-6685-9
  • Type

    conf

  • DOI
    10.1109/ISCAS.2001.921085
  • Filename
    921085