arrow
Return

Stability of multidimensional systems using genetic algorithms

delete2003-07-01
delete17
PRE
AI
N
Nikos E. Mastorakis
G
Gonos, LF
M
M.N.S. Swamy
DOI:10.1109/TCSI.2003.813968delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The study of the stability of m-dimensional systems is a difficult one especially when m greater than or equal to 3. There exist only a few results in the literature and unfortunately, there does not exist any practical criterion. In this brief, the stability of an m-dimensional system is dealt as a minimization problem of the absolute value of its characteristic polynomial over the boundaries of its variables (i.e., on the m unit circles). This minimization problem is solved by using genetic algorithms (GAs). Using GAs we obtain, in general, better results than other methods of minimization (numerical techniques, neural networks, etc.). Numerical examples are presented.
Keywords:
BIBO-STABILITY
2-D
TESTS
SINGULARITIES
FILTERS

Journal

IEEE Transactions on Circuits and Systems I-Regular Papers cover
IEEE Transactions on Circuits and Systems I-Regular Papers
IF:
5.2
Papers:
9.7K
Citations:
2.2W

Organization

No organization information available