Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
Publication:811087
DOI10.1016/0024-3795(91)90378-AzbMath0734.65037MaRDI QIDQ811087
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Arnoldi methodlarge matricesLuenberger observerHessenberg matrix with preassigned spectumHessenberg-Schur methodpartial pole- assignment problempartial spectrum assignmentSylvester-type matrix equation
Computational methods for sparse matrices (65F50) Numerical optimization and variational techniques (65K10) Pole and zero placement problems (93B55) Matrix equations and identities (15A24)
Related Items (44)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduced order observers: A new algorithm and proof
- The Lanczos-Arnoldi algorithm and controllability
- Synthesis of linear systems with desired equivalent form
- Pole assignment via Sylvester's equation
- Robustness in partial pole placement
- Iterative Solution of Linear Equations in ODE Codes
- The decentralized control of large flexible space structures
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
- Projection and deflation method for partial pole assignment in linear state feedback
- A Hessenberg-Schur method for the problem AX + XB= C
- Trends in large space structure control theory: Fondest hopes, wildest dreams
- On pure structure of dynamic systems
This page was built for publication: Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment