A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +)

DOI10.1080/03081087.2013.860600zbMath1308.65063OpenAlexW1999756099MaRDI QIDQ2938337

Mahtab Mirzaei Khalilabadi, Behnam Hashemi, Hanieh Tavakolipour

Publication date: 14 January 2015

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2013.860600

zbMATH Keywords

algorithmtensor productmax-plus algebraSylvester matrix equationprincipal solution

Mathematics Subject Classification ID

Cites Work

• Relation equations in residuated lattices
• Universal algorithms for solving the matrix Bellman equations over semirings
• Interval systems over idempotent semiring
• Max-algebra: The linear algebra of combinatorics?
• Residuation in fuzzy algebra and some applications
• Rank preservers of matrices over max algebra
• Z-matrix equations in max-algebra, nonnegative linear algebra and other semirings
• Max-linear Systems: Theory and Algorithms

This page was built for publication: A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +)