An algorithm for finding the scaled basis of the supereigenvector space in max-plus algebra

TL;DR

This paper introduces a novel algorithm for efficiently computing a basis of the supereigenvector space in max-plus algebra, leveraging tropical double description and extremality criteria.

Contribution

The paper presents a new algorithm that improves basis computation in max-plus algebra by combining tropical double description with extremality criteria.

Findings

Algorithm effectively computes the basis of the supereigenvector space.

Utilizes tropical double description method for generator improvement.

Incorporates extremality criteria to enhance the process.

Abstract

We present an algorithm for finding a basis of the supereigenvector space in max-plus algebra. The main ideas of the new algorithm are: finding better generators by exploiting the main operation of the tropical double description method and making use of the previously known extremality criteria.