A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +)
From MaRDI portal
Publication:2938337
Recommendations
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- scientific article; zbMATH DE number 7695062
- Fast enclosing the solution set of the parametric Sylvester matrix equations
- An efficient algorithm for solving extended Sylvester-conjugate transpose matrix equations
- scientific article; zbMATH DE number 903157
- Algorithms for solving nonhomogeneous generalized Sylvester matrix equations
- An iterative algorithm for solving the generalized Sylvester-conjugate matrix equation
- On the numerical solution of large scale Sylvester matrix equations
- A fast algorithm for solving the Sylvester structured total least squares problem
- On the numerical solution of generalized Sylvester matrix equations
Cites work
- Interval systems over idempotent semiring
- Max-algebra: The linear algebra of combinatorics?
- Max-linear systems. Theory and algorithms.
- Rank preservers of matrices over max algebra
- Relation equations in residuated lattices
- Residuation in fuzzy algebra and some applications
- Universal algorithms for solving the matrix Bellman equations over semirings
- Z-matrix equations in max-algebra, nonnegative linear algebra and other semirings
This page was built for publication: A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938337)
