Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned

DOI10.1137/S0895479896302382zbMath0919.93031MaRDI QIDQ4389098

Volker Mehrmann, Hong-guo Xu

Publication date: 11 May 1998

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

perturbation theorystabilizationpole placementcondition numberJordan formCauchy matrixoptimal conditioningdistance to uncontrollabilityfeedback gain

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Controllability (93B05) Eigenvalue problems (93B60) Pole and zero placement problems (93B55) Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (10)

Pole placement preconditioning ⋮ On the solution of large Sylvester‐observer equations ⋮ A new framework for implicit restarting of the Krylov-Schur algorithm ⋮ Robust multiple-fault detection and isolation: A gradient flow approach ⋮ On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces ⋮ A sharp version of Bauer-Fike's theorem ⋮ On the selection of poles in the single-input pole placement problem ⋮ A complete analysis of a classical Poisson-Nernst-Planck model for ionic flow ⋮ Revisiting IRKA: connections with pole placement and backward stability ⋮ Numerical methods in control

This page was built for publication: Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned