Invariant subspaces of matrices with applications
Invariant subspaces of matrices with applications
On the limited memory BFGS method for large scale optimization
Mathematical Programming: Series A and B
Robust eigenvalue assignment for generalized systems
Automatica (Journal of IFAC)
Line search algorithms with guaranteed sufficient decrease
ACM Transactions on Mathematical Software (TOMS)
On stabilization methods of descriptor systems
Systems & Control Letters
Minimal Degree Coprime Factorization of Rational Matrices
SIAM Journal on Matrix Analysis and Applications
Stabilizability of the linear algebro-differential one-input control systems
Automation and Remote Control
Robust partial pole assignment problem for high order control systems
Automatica (Journal of IFAC)
Hi-index | 0.00 |
We propose a general, numerically reliable computational approach to solve the pole and eigenstructure assignment problem for descriptor systems. In the multi-input case, the proposed approach addresses the intrinsic non-uniqueness of the pole assignment problem solution by simultaneously minimizing the sensitivity of the feedback gain and of closed-loop eigenvalues. For this purpose, a minimum norm robust pole assignment problem is formulated and solved as an unconstrained minimization problem for a suitably chosen cost function. By using a generalized Sylvester equation-based parameterization, an explicit expression of the gradient of the cost function is derived to allow the efficient solution of the minimization problem by using powerful gradient search-based minimization techniques.