DocumentCode
2859123
Title
An extension of the Faddeev’s algorithms
Author
Vu, Ky M.
Author_Institution
AuLac Technologies Inc., Ottawa, Ontario, Canada
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 Faddeev’s 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
Algorithm design and analysis; Control systems; Eigenvalues and eigenfunctions; Equations; Helium; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Control Systems, 2008. CACSD 2008. IEEE International Conference on
Conference_Location
San Antonio, TX, USA
Print_ISBN
978-1-4244-2221-0
Type
conf
DOI
10.1109/CACSD.2008.4627337
Filename
4627337
Link To Document