Refinement methods for state estimation via Sylvester-observer equation
From MaRDI portal
Publication:666381
DOI10.1155/2011/184314zbMath1236.65073WikidataQ58654940 ScholiaQ58654940MaRDI QIDQ666381
Publication date: 8 March 2012
Published in: Advances in Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/184314
numerical results; state estimation; iterative method; projection method; refinement process; matrix equation; continuous-time system; large sparse Sylvester-observer equation
65F50: Computational methods for sparse matrices
65K10: Numerical optimization and variational techniques
93C05: Linear systems in control theory
15A24: Matrix equations and identities
93B07: Observability
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Cross-Gramian based model reduction for data-sparse systems
- A new projection method for solving large Sylvester equations
- ADI preconditioned Krylov methods for large Lyapunov matrix equations
- On the ADI method for Sylvester equations
- Controllability, observability and the solution of AX-XB=C
- Nonsingular solutions of TA-BT=C
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- The Sylvester equation and approximate balanced reduction
- Krylov subspace methods for the generalized Sylvester equation
- A Hessenberg-Schur method for the problem AX + XB= C
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- On the solution of large Sylvester‐observer equations
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Approximation of Large-Scale Dynamical Systems
- Block Krylov subspace methods for solving large Sylvester equations