This article is cited in 3 papers

Re-Construction of Inverse Matrices

G. I. Zabinyako

Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences

Abstract: We consider algorithms for re-constructing the inverses to basis matrices, in which the advance determination of the pivots is based on solving assignment problems. Then, in order to memory saving, by symmetric permutations, we set the order in which the pivots are used. The corresponding routines are designed for the software packages for solving mathematical programming problems.

Keywords: linear programming, systems of linear algebraic equations, sparse matrices, assignment problem.

UDC: 519.852.6

Received: 03.12.2008

Bibliographic databases:

•