Decomposable non-negative matrices in a dynamic programming problem

Petr Mandl

Displaying similar documents to “Decomposable non-negative matrices in a dynamic programming problem”

Solution in large of control problem $\dot{x} = (A u + B v) x$

Jan Kučera (1967)

Czechoslovak Mathematical Journal

Similarity:

Characterization of α1 and α2-matrices

Rafael Bru, Ljiljana Cvetković, Vladimir Kostić, Francisco Pedroche (2010)

Open Mathematics

Similarity:

This paper deals with some properties of α1-matrices and α2-matrices which are subclasses of nonsingular H-matrices. In particular, new characterizations of these two subclasses are given, and then used for proving algebraic properties related to subdirect sums and Hadamard products.

Schur complements of diagonally dominant matrices

David Carlson, Thomas L. Markham (1979)

Czechoslovak Mathematical Journal

Similarity:

Studying the various properties of MIN and MAX matrices - elementary vs. more advanced methods

Mika Mattila, Pentti Haukkanen (2016)

Special Matrices

Similarity:

Let T = {z1, z2, . . . , zn} be a finite multiset of real numbers, where z1 ≤ z2 ≤ · · · ≤ zn. The purpose of this article is to study the different properties of MIN and MAX matrices of the set T with min(zi , zj) and max(zi , zj) as their ij entries, respectively.We are going to do this by interpreting these matrices as so-called meet and join matrices and by applying some known results for meet and join matrices. Once the theorems are found with the aid of advanced methods, we also...

Displaying similar documents to “Decomposable non-negative matrices in a dynamic programming problem”

Solution in large of control problem x ˙ = ( A u + B v ) x

Characterization of α1 and α2-matrices

Schur complements of diagonally dominant matrices

Studying the various properties of MIN and MAX matrices - elementary vs. more advanced methods

Solution in large of control problem $\dot{x} = (A u + B v) x$