Pole assignment with optimal spectral conditioning
From MaRDI portal
Recommendations
- On optimal pole assignment in a specified region
- Optimal pole allocation and weighting matrix selection
- Pole Allocation Using Matrix Perturbations
- Perturbation Analysis of the Pole Assignment Problem
- Parameter-insensitive pole assignment
- On pole structure assignment in linear systems
- scientific article; zbMATH DE number 4116413
- Approaches to robust pole assignment
- On Pole Placement via Eigenstructure Assignment Approach
- Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 50653 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- A Schur method for pole assignment
- A gradient flow approach to the robust pole‐placement problem
- Approaches to robust pole assignment
- Matrix Analysis
- Parametric state-feedback control for arbitrary eigenvalue assignment with minimum sensitivity
- Pole assignment via Sylvester's equation
- Robust pole assignment in linear state feedback
Cited in
(13)- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
- Communication parameter design for networked control systems with the slotted ALOHA access protocol
- Approaches to robust pole assignment
- Multiobjective controller synthesis via eigenstructure assignment with state feedback
- Gradient-based maximal convergence rate iterative method for solving linear matrix equations
- A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations
- Full delayed state feedback pole assignment of discrete-time time-delay systems
- Stability robustness of networked control systems with respect to packet loss
- scientific article; zbMATH DE number 4087839 (Why is no real title available?)
- Unfalsifying Pole Locations Using a Fading Memory Cost Function
- Iterative algorithm for minimal norm least squares solution to general linear matrix equations
- Convergence of an iterative method for solving Sylvester matrix equations over reflexive matrices
- A modified optimization method for robust partial quadratic eigenvalue assignment using receptances and system matrices
This page was built for publication: Pole assignment with optimal spectral conditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1391870)
