.png){kind=icon}
返回
Stability of multidimensional systems using genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2003.813968.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
BIBO-STABILITY
2-D
TESTS
SINGULARITIES
FILTERS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.8K
被引数:
2.2W
机构
暂无机构信息
引用论文
分享收藏
ANOTHER PROOF AND A GENERALIZATION OF A THEOREM ON N-DIMENSIONAL STABILITY.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
分享收藏分享收藏STABILITY-CRITERION FOR N-DIMENSIONAL ZERO-PHASE RECURSIVE DIGITAL-FILTERSPROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
查看更多内容