On the selection of poles in the single-input pole placement problem
From MaRDI portal
Publication:1970446
DOI10.1016/S0024-3795(99)00123-8zbMath0986.93033WikidataQ126866010 ScholiaQ126866010MaRDI QIDQ1970446
Daniela Calvetti, Bryan W. Lewis, Lothar Reichel
Publication date: 13 June 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Sensitivity (robustness) (93B35) Sensitivity, stability, parametric optimization (90C31) Perturbations in control/observation systems (93C73) Pole and zero placement problems (93B55) Numerical solutions to inverse eigenvalue problems (65F18)
Related Items (3)
Pole placement preconditioning ⋮ On the solution of large Sylvester‐observer equations ⋮ New matrix function approximations and quadrature rules based on the Arnoldi process
Uses Software
Cites Work
- Unnamed Item
- A generalized ADI iterative method
- An analysis of the pole placement problem I: The single-input case
- On the solution of Cauchy systems of equations
- An analysis of the pole placement problem. II: The multi-input case
- On interpolation by rational functions
- Rational interpolation with restricted poles
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
- Algorithm 747: a Fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback
- Single-Input Eigenvalue Assignment Algorithms: A Close Look
- Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned
- The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
- Modal control of linear time invariant systems
- The automatic integration of ordinary differential equations
This page was built for publication: On the selection of poles in the single-input pole placement problem
