Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
From MaRDI portal
Publication:811087
The authors propose a numerical method for solving a Sylvester-type equation \(AX-XH=G,\) where, with given \(N\times N\) matrix A (considered here as large and sparse) and \(N\times m\) matrix G, they construct an \(m\times m\) Hessenberg matrix H with a preassigned spectrum, and an \(N\times m\) orthonormal matrix X.
Recommendations
- On the solution of large Sylvester‐observer equations
- Solutions of the generalized Sylvester matrix equation and the application in eigenstructure assignment
- A new projection method for solving large Sylvester equations
- Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
- The global Arnoldi process for solving the Sylvester-observer equation
Cites work
- A Hessenberg-Schur method for the problem AX + XB= C
- An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3912200 (Why is no real title available?)
- scientific article; zbMATH DE number 3789762 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Iterative Solution of Linear Equations in ODE Codes
- On pure structure of dynamic systems
- Pole assignment via Sylvester's equation
- Projection and deflation method for partial pole assignment in linear state feedback
- Reduced order observers: A new algorithm and proof
- Robustness in partial pole placement
- Synthesis of linear systems with desired equivalent form
- The decentralized control of large flexible space structures
- The Lanczos-Arnoldi algorithm and controllability
- Trends in large space structure control theory: Fondest hopes, wildest dreams
Cited in
(50)- Linear and numerical linear algebra in control theory: Some research problems
- A parallel algorithm for the partial single-input pole assignment problem
- Orthogonality and partial pole assignment for the symmetric definite quadratic pencil
- An algorithm for the single-input partial pole assignment problem
- Deflated BiCG with an application to model reduction
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems
- Relaxation strategies for nested Krylov methods
- Accurate conjugate gradient methods for families of shifted systems
- Iterative system solvers for the frequency analysis of linear mechanical systems
- Incomplete partial fractions for parallel evaluation of rational matrix functions
- A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
- Extended and rational Hessenberg methods for the evaluation of matrix functions
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
- Solving shifted linear systems with restarted GMRES augmented with error approximations
- Shifted GMRES for oscillatory integrals
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- Minimal residual-like condition with collinearity for shifted Krylov subspace methods
- Fast, numerically stable computation of oscillatory integrals with stationary points
- BiCR-type methods for families of shifted linear systems
- A block Arnoldi based method for the solution of the Sylvester-observer equation
- Fast generalized cross validation using Krylov subspace methods
- On an integrated Krylov-ADI solver for large-scale Lyapunov equations
- A numerical method for calculating the Green's function arising from electronic structure theory
- Multiobjective controller synthesis via eigenstructure assignment with state feedback
- A projection algorithm for partial eigenvalue assignment problem using implicitly restarted Arnoldi method
- Unique Full-Rank Solution of the Sylvester-Observer Equation and Its Application to State Estimation in Control Design
- A new algorithm for generalized Sylvester-observer equation and its application to state and velocity estimations in vibrating systems.
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
- Computational Methods for Linear Matrix Equations
- Approximate implicit subspace iteration with alternating directions for LTI system model reduction
- Solution of generalized shifted linear systems with complex symmetric matrices
- On Hessenberg type methods for low-rank Lyapunov matrix equations
- Real valued iterative methods for solving complex symmetric linear systems
- On the solution of large Sylvester‐observer equations
- Numerically robust pole assignment for second-order systems
- On the numerical solution of a T-Sylvester type matrix equation arising in the control of stochastic partial differential equations
- A simpler GMRES and its adaptive variant for shifted linear systems.
- Tridiagonal Toeplitz matrices: properties and novel applications
- Global quasi-minimal residual method for the Sylvester equations
- Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems
- The global Arnoldi process for solving the Sylvester-observer equation
- Reduced-order algorithm for eigenvalue assignment of singularly perturbed linear systems
- Data assimilation with an integral-form ensemble square-root filter
- Robust and minimum norm partial eigenvalue assignment in singular vibration systems
- The simpler block CMRH method for linear systems
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Solving the generalized Sylvester matrix equation AV+BW=EVF via a Kronecker map
- Restarted weighted full orthogonalization method for shifted linear systems
- Extended Krylov subspace for parameter dependent systems
This page was built for publication: Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811087)
