Fast enclosure for solutions of generalized Sylvester equations
From MaRDI portal
(Redirected from Publication:403840)
Recommendations
- Fast enclosure for solutions of Sylvester equations
- Fast enclosing the solution set of the parametric Sylvester matrix equations
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations
- On the numerical solution of generalized Sylvester matrix equations
- On the construction of a general solution of the generalized Sylvester equation
- On the solution of the generalized matrix Sylvester equations
- New approaches for solving large Sylvester equations
- On the construction of general solution of the generalized Sylvester equation
Cites work
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 1977010 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1440909 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Error bounds for approximate solutions of systems of equations
- Fast enclosure for solutions of Sylvester equations
- Numerical enclosure for each eigenvalue in generalized eigenvalue problem
- Robust assignment of poles in large-scale interval systems
- The interval Sylvester equation
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- Verified error bounds for solutions of Sylvester matrix equations
Cited in
(4)
This page was built for publication: Fast enclosure for solutions of generalized Sylvester equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403840)
