Geodesic
Decomposable non-negative matrices in a dynamic programming problem
Czechoslovak Mathematical Journal, Tome 20 (1970) no. 3, pp. 504-510
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1970.100978
Classification : 90.40 
@article{10_21136_CMJ_1970_100978,
     author = {Mandl, Petr},
     title = {Decomposable non-negative matrices in a dynamic programming problem},
     journal = {Czechoslovak Mathematical Journal},
     pages = {504--510},
     year = {1970},
     volume = {20},
     number = {3},
     doi = {10.21136/CMJ.1970.100978},
     mrnumber = {0264978},
     zbl = {0209.22902},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1970.100978/}
}
TY  - JOUR
AU  - Mandl, Petr
TI  - Decomposable non-negative matrices in a dynamic programming problem
JO  - Czechoslovak Mathematical Journal
PY  - 1970
SP  - 504
EP  - 510
VL  - 20
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1970.100978/
DO  - 10.21136/CMJ.1970.100978
LA  - en
ID  - 10_21136_CMJ_1970_100978
ER  - 
%0 Journal Article
%A Mandl, Petr
%T Decomposable non-negative matrices in a dynamic programming problem
%J Czechoslovak Mathematical Journal
%D 1970
%P 504-510
%V 20
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1970.100978/
%R 10.21136/CMJ.1970.100978
%G en
%F 10_21136_CMJ_1970_100978
Mandl, Petr. Decomposable non-negative matrices in a dynamic programming problem. Czechoslovak Mathematical Journal, Tome 20 (1970) no. 3, pp. 504-510. doi: 10.21136/CMJ.1970.100978

[1] P. Mandl: An iterative method for maximizing the characteristic root of positive matrices. Rev. roum. math. pures et appl. 12 (1967), 1317-1322. | MR | Zbl

[2] P. Mandl E. Seneta: The theory of non-negative matrices in a dynamic programming problem. Austral. J. of Stats. 11 (1969), 85-96. | DOI | MR

Cité par Sources :