• DocumentCode
    2889886
  • Title

    An extension of the Faddeev’s algorithms

  • Author

    Vu, Ky M.

  • Author_Institution
    AuLac Technol. Inc., Ottawa, ON
  • fYear
    2008
  • fDate
    3-5 Sept. 2008
  • Firstpage
    150
  • Lastpage
    155
  • Abstract
    Two similar algorithms are suggested: one calculates the determinant polynomial and the other calculates the adjoint polynomial of a square polynomial matrix. The algorithms are an extension of the Faddeevpsilas algorithms to calculate the determinant and adjoint polynomials of the resolvent of a square constant matrix. The algorithm to calculate the determinant polynomial gives the coefficients of the polynomial in a recursive manner from a recurrence formula. The algorithm to calculate the adjoint polynomial gives the coefficient matrices directly with the information from the algorithm to calculate the determinant polynomial. Together, they give the inverse of a polynomial matrix.
  • Keywords
    determinants; polynomial matrices; Faddeev algorithms; adjoint polynomials; coefficient matrices; determinant polynomials; polynomial matrix; recurrence formula; square constant matrix; Algorithm design and analysis; Control systems; Eigenvalues and eigenfunctions; Equations; Helium; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control Applications, 2008. CCA 2008. IEEE International Conference on
  • Conference_Location
    San Antonio, TX
  • Print_ISBN
    978-1-4244-2222-7
  • Electronic_ISBN
    978-1-4244-2223-4
  • Type

    conf

  • DOI
    10.1109/CCA.2008.4629573
  • Filename
    4629573