On one algorithm of finding a matrix basis minor
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2006), pp. 63-70
Cet article a éte moissonné depuis la source Math-Net.Ru
The simple algorithm of finding a matrix basis minor is formulated, which allows to calculate simaltaneously the rank of matrix, the value of basis minor, the inverse matrix for basis minor matrix, the coordinates of nonbasis rows and columns relative to the basis rows and columns, extreme points and directions of polyhedral sets, and also to answer the question about solvability of the system of linear inequalities.
@article{VUU_2006_1_a4,
author = {G. G. Islamov and Y. V. Kogan},
title = {On one algorithm of finding a matrix basis minor},
journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
pages = {63--70},
year = {2006},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VUU_2006_1_a4/}
}
G. G. Islamov; Y. V. Kogan. On one algorithm of finding a matrix basis minor. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2006), pp. 63-70. http://geodesic.mathdoc.fr/item/VUU_2006_1_a4/