string stability

时滞系统稳定性必备书That every problem in NP can be polynomially reduced to an NP-hard problem suggests a proof for NP-hardness. It follows that if a problem ℘1 is NP-hard and polynomially reducible to some problem ℘2, then ℘2 must also be NP-hard. In other words, if one is to prove that ℘2 is NP- hard, one may attempt to reduce polynomially a known NP-hard problem ℘1 to ℘2. In particular, it suffices to polynomially reduce ℘1 to just one instance of ℘2, since that particular instance of ℘2 is as difficult as any instance of ℘1, and therefore in the worst case, ℘2 must be as difficult as ℘1. A vast number of NP-hard and NP-complete problems have been discovered in this manner, among them notably are such classical problems as the satisÞability problem and the traveling salesman problem. The same strategy is adopted in our proof of the NP-hardness of the stability problem

TIMOSHENCO弹性结构理论 梁的弹性曲屈

Power System Stability and Control (电力系统稳定与控制) (P. Kundur) PDF自用

这本书讲了店里系统的基本知识，和详细的建模和分析方法，对初次接触者很有帮助。

Design of a Stability Augmentation System for an Unmanned Helicopter Based on Adaptive Control Techniques

The main difficulty in stability analysis of reset control systems comes from their state-dependent reset mechanism. It becomes more challenging when output matrix suffers from uncertainties which make the reset time instants uncertain. In this paper, existing quadratic stability results for uncerta

Stability and static output feedback stabilization for a class of nonlinear discrete-time singular switched systems

In-vitro Electrochemical Stability Evaluation of a Flexible MEMS Microelectrode of a Flexible MEMS Microelectrode

Product Description: Meyn & Tweedie is back! The bible on Markov chains in general state spaces has been brought up to date to reflect developments in the field since 1996 - many of them sparked by publication of the first edition. The pursuit of more efficient simulation algorithms for complex Mar