Universal algorithms for solving the matrix Bellman equations over semirings

Abstract

This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software implementations are discussed.

40 pages. arXiv admin note: substantial text overlap with arXiv:1005.1252, arXiv:1209.1721

References in corpus (2)

• Interval systems over idempotent semiring
• Universal algorithms, mathematics of semirings and parallel computations

Cited by in corpus (1)

• The Markov chain tree theorem and the state reduction algorithm in commutative semirings