Universal algorithms for generalized discrete matrix Bellman equations with symmetric Toeplitz matrix
Sergei Sergeev
math.RAarXiv:math/0612309
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.
Create a lesson
Related papers
Free Novikov-Zinbiel algebra
A. Dauletiyarova, F. Mashurov, B. Sartayev
Very good gradings on structural matrix rings
Patrik Lundström, Johan Öinert, Laura Orozco et al.
Relation graphs of the sedenion algebra
Alexander Guterman, Svetlana Zhilina
On doubly alternative zero divisors in Cayley-Dickson algebras
Svetlana Zhilina
Diameter of the commutativity graph of the real sedenions
Svetlana Zhilina
Functional identities of degree 2 at two-sided zero products on incidence algebras
Hongyu Jia, Zhankui Xiao