On estimating the separation between \((A, B)\) and \((C, D)\) associated with the generalized Sylvester equation \(A X D - B X C = E\)
From MaRDI portal
Publication:1675942
DOI10.1016/j.cam.2017.07.025zbMath1376.65065OpenAlexW2744452050MaRDI QIDQ1675942
Publication date: 3 November 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.07.025
numerical examplesboundsFrobenius normseparationSchur decompositiongeneralized Sylvester equationWeierstrass canonical form
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On estimating the separation of two regular matrix pairs
- A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations
- On estimating the separation of two periodic matrix sequences
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- Lower bound estimation for the separation of two matrices
- Numerical solution of generalized Lyapunov equations
- On the Separation of Two Matrices
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXB T + CXD T = E
This page was built for publication: On estimating the separation between \((A, B)\) and \((C, D)\) associated with the generalized Sylvester equation \(A X D - B X C = E\)