DocumentCode :
818807
Title :
On the calculation of matrix polynomials
Author :
Bingulac, S.P.
Author_Institution :
University of Illinois, Urbana, Illinois, USA
Volume :
20
Issue :
3
fYear :
1975
fDate :
6/1/1975 12:00:00 AM
Firstpage :
435
Lastpage :
437
Abstract :
The purpose of this note is to prove a theorem which permits the calculation of the vector b without the necessity of transforming the matrix A into the Jordan form for the Cayley-Hamilton theorem. The only requirement is the calculation of the characteristic polynomial of the matrix A, which may be easily done using the existing computational procedures. The author includes a computer program listing of a subroutine that calculates the coefficients of the n-dimensional vector b. This subroutine makes use of certain standard IBM subroutines, as SMPY, GMPRD, GMSUB, and GMADD, from the IBM 1130 Scitific Subroutine Package, and utilized another subroutine CHEQ described by the author in ibid., vol AC-20, pp. 134-135, Feb. 1975, that calculates the coefficients of the characteristic polynomial of the matrix A.
Keywords :
Polynomial matrices; Cost function; Eigenvalues and eigenfunctions; Laboratories; Minimization methods; Optimal control; Polynomials; Quadratic programming;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/TAC.1975.1100973
Filename :
1100973
Link To Document :
بازگشت