株式会社極東書店トップ > 商品一覧 > Domain of Attraction: Analysis and Control via SOS Programming. 2011 ed.
商品詳細
Domain of Attraction: Analysis and Control via SOS Programming. 2011 ed.
・ISBN 978-0-85729-958-1 paper EUR 99.99
¥26,726.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Chesi, Graziano, |
|---|---|
| シリーズ | (Lecture Notes in Control and Information Sciences) |
| 出版社 | (Springer London Ltd, UK) |
| 出版年月 | 2011 |
| ページ数 | 286 pp. |
| 言語 | ENG |
| ニュース番号 | <A05-27602> |
解説
For nonlinear dynamical systems, which represent the majority of real devices, any study of stability requires the investigation of the domain of attraction of an equilibrium point, i.e. the set of initial conditions from which the trajectory of the system converges to equilibrium. Unfortunately, both estimating and attempting to control the domain of attraction are very difficult problems, because of the complex relationship of this set with the model of the system. Domain of Attraction addresses the estimation and control of the domain of attraction of equilibrium points via SOS programming, i.e. optimization techniques based on the sum of squares of polynomials (SOS) that have been recently developed and that amount to solving convex problems with linear matrix inequality constraints. A unified framework for addressing these issues is presented for in various cases depending on the nature of the nonlinear systems considered, including the cases of polynomial, non-polynomial, certain and uncertain systems. The methods proposed are illustrated various example systems such as electric circuits, mechanical devices, and nuclear plants. Domain of Attraction also deals with related problems that can be considered within the proposed framework, such as characterizing the equilibrium points and bounding the trajectories of nonlinear systems, and offers a concise and simple description of the main features of SOS programming, which can be used for general purpose in research and teaching.