Pole assignment with eigenvalue and stability robustness
From MaRDI portal
Recommendations
Cited in
(20)- Robust eigenvalue assignment for generalized systems
- Dynamic pole assignment using global, blow up linearization: Low complexity solutions
- A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations
- Finite iterative solutions to periodic Sylvester matrix equations
- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
- Iterative algorithm for the reflexive solutions of the generalized Sylvester matrix equation
- On stability of dynamical controllers using pole assignment
- Robust eigenstructure assignment in quadratic matrix polynomials: Nonsingular case
- 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
- Estimates of the spectral condition number
- Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
- Regional pole assignment with eigenstructure robustness
- Robust eigenstructure assignment with minimum subspace separation
- scientific article; zbMATH DE number 800028 (Why is no real title available?)
- On eigenstructure assignment using block poles placement
- Gradient-based maximal convergence rate iterative method for solving linear matrix equations
- Lyapunov iteration and equation characterizations for unobservable subspace
- On Smith-type iterative algorithms for the Stein matrix equation
- Robust pole assignment via reflection coefficients of polynomials
This page was built for publication: Pole assignment with eigenvalue and stability robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485291)
