Abstract
A complete description of the eigenspace structure for a given n × n Monge matrix in a max-plus algebra is presented. Based on the description, an O ( n 2 ) algorithm for computing the eigenspace dimension is formulated, which is faster than the previously known algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
