Universal algorithms for generalized discrete matrix Bellman equations with symmetric Toeplitz matrix

Abstract

This paper presents two universal algorithms for generalized Bellman equations with symmetric Toeplitz matrix. The algorithms are semiring extensions of two well-known methods solving Toeplitz systems in the ordinary linear algebra.

11 pages

References in corpus (2)

• Correspondence principle for idempotent calculus and some computer applications
• Exact interval solutions to the discrete Bellman equation and polynomial complexity of problems in interval idempotent linear algebra

Cited by in corpus (1)

• Universal algorithms for solving the matrix Bellman equations over semirings