An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
From MaRDI portal
Publication:3753870
DOI10.1109/TAC.1987.1104622zbMATH Open0612.93020MaRDI QIDQ3753870FDOQ3753870
Authors: Biswa N. Datta 
Publication date: 1987
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Recommendations
Numerical optimization and variational techniques (65K10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Pole and zero placement problems (93B55) Linear systems in control theory (93C05)
Cited In (18)
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- Eigenvalue assignment in an upper Hessenberg matrix
- Pole placement preconditioning
- Title not available (Why is that?)
- Assignment of the characteristic polynomial of a Hessenberg matrix†
- Feedback stabilization of a second-order system: A nonmodal approach
- Parallel and large-scale matrix computations in control: Some ideas
- Eigenvalue assignment in a single-input linear system
- A generalized single-input mixed eigenvalue assignment problem
- On eigenvalue and canonical form assignments
- A parallel algorithm for the partial single-input pole assignment problem
- A projection algorithm for partial eigenvalue assignment problem using implicitly restarted Arnoldi method
- An inverse eigenvalue problem: Computing \(B\)-stable Runge-Kutta methods having real poles
- On swapping diagonal blocks in real Schur form
- On the solution of large Sylvester‐observer equations
- Linear and numerical linear algebra in control theory: Some research problems
- Tridiagonal Toeplitz matrices: properties and novel applications
- On the selection of poles in the single-input pole placement problem
This page was built for publication: An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753870)
