Computing Hard Bounds for Probabilistic Robustness
暂无分享,去创建一个
[1] C. V. Hollot,et al. The stability of a family of polynomials can be deduced from a finite number 0(k/sup 3/) of frequency checks , 1989 .
[2] Yun Huang,et al. Soft vs. hard bounds in probabilistic robustness analysis , 1996, Proceedings of 35th IEEE Conference on Decision and Control.
[3] J. K. Hunter,et al. Measure Theory , 2007 .
[4] M. Safonov,et al. Exact calculation of the multiloop stability margin , 1988 .
[5] V. Kharitonov. Asympotic stability of an equilibrium position of a family of systems of linear differntial equations , 1978 .
[6] R. Tempo,et al. Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .
[7] Thomas D. Sandry,et al. Probabilistic and Randomized Methods for Design Under Uncertainty , 2007, Technometrics.
[8] B. Ross Barmish,et al. New Tools for Robustness of Linear Systems , 1993 .