A note on the Sylvester equation over max-plus algebra
Optimization and Control
2017-08-08 v1
Abstract
It is known that the solvability of a Sylvester equation over max-plus algebra can be determined in polynomial time by verifying its principal solution. A succinct representation of the principal solution is presented, with a more accurate computational complexity, for a Sylvester equation over max-plus algebra.
Keywords
Cite
@article{arxiv.1708.02075,
title = {A note on the Sylvester equation over max-plus algebra},
author = {Pingke Li},
journal= {arXiv preprint arXiv:1708.02075},
year = {2017}
}
Comments
6 pages