Pole assignment with optimal spectral conditioning

DOI10.1016/S0167-6911(97)90007-4zbMath0901.93025MaRDI QIDQ1391870

Wei-Yong Yan, James Lam

Publication date: 23 July 1998

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

algorithm; robustness; pole assignment; condition number; unconstrained minimizations

Mathematics Subject Classification ID

93B35: Sensitivity (robustness)

93B55: Pole and zero placement problems

Related Items

Gradient-based maximal convergence rate iterative method for solving linear matrix equations, A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations, The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\), Stability robustness of networked control systems with respect to packet loss, Multiobjective controller synthesis via eigenstructure assignment with state feedback, Convergence of an iterative method for solving Sylvester matrix equations over reflexive matrices, Iterative algorithm for minimal norm least squares solution to general linear matrix equations, Full delayed state feedback pole assignment of discrete-time time-delay systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pole assignment via Sylvester's equation
• Parametric state-feedback control for arbitrary eigenvalue assignment with minimum sensitivity
• Robust pole assignment in linear state feedback
• Matrix Analysis
• Approaches to robust pole assignment
• A Schur method for pole assignment
• A gradient flow approach to the robust pole‐placement problem