Details:
Title  Computer Algebra for Exact Complex Stability Margin Computation  Author(s)  NainnPing Ke  Type  Technical Report, Misc  Abstract  As previous results, multivariable stability margin (k_M) problem can be formulated as solving polynomial systems by using symbolic computation and stratified Morse theory. Once the solutions are found, the stability margin problem can be easily solved. For complex k_M problem, no matter howmany uncertainties, there is only one onedimensional polynomial system which needs to be solved in order to find all singularities to determine whether the boundary of Horowitz template intercept the origin or not. The objective of this paper is to describe how to use Groebner Basis method to solve this polynomial system. Due to the continuity property of complex µ ,numerical solutions are good enough for complex µ computation. In addition, we can sample this onedimensional polynomial system into several zerodimensional polynomial systems. There are many
efficient algorithm to solve these zerodimensional polynomial systems. Therefore, we have an efficient way of singularity related method to compute exact complex k_M.  Keywords  Groebner basis, symbolic computation, robustness, stability 
Language  English  Pages  6 p.  Year  2005  Edition  0  Translation 
No  Refereed 
No 
