
Max-plus Linear Algebra with Scilab
... 1. value iteration, which computes the sequence x(k) = ax(k − 1) ⊕ b, x(0) = 0. If a ∗ b is finite, the sequence converges in a finite (possibly small) time to the minimal solution. Of course, Gauss-Seidel refinements can be implemented (all this is fairly easy to do). 2. policy iteration. This is a ...
... 1. value iteration, which computes the sequence x(k) = ax(k − 1) ⊕ b, x(0) = 0. If a ∗ b is finite, the sequence converges in a finite (possibly small) time to the minimal solution. Of course, Gauss-Seidel refinements can be implemented (all this is fairly easy to do). 2. policy iteration. This is a ...