Title :
A computational algorithm for inners
Author :
Jury, E.I. ; Ahn, S.M.
Author_Institution :
University of California, Berkeley, CA, USA
fDate :
8/1/1972 12:00:00 AM
Abstract :
A Gaussian elimination algorithm is proposed to compute the determinants of inners of certain types of matrices. This algorithm applies to the clustering of roots as well as to the roots distribution of a given polynomial. Several examples on stability, relative stability, and aperiodicity for both continuous and discrete systems are presented.
Keywords :
Determinants; Polynomials; Stability; Clustering algorithms; Interconnected systems; Linear matrix inequalities; Lyapunov method; Polynomials; Stability; State estimation;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.1972.1100041
