A modified inversion procedure for product form of the inverse linear programming codes

Authors:
L. J. Larsen
Affiliations:
Eso Research & Engineering Co., Florham Park, NJ
Venue:
Communications of the ACM
Year:
1962

Citing 0
Cited 2

A Survey of Indexing Techniques for Sparse Matrices

ACM Computing Surveys (CSUR)
A Status Report on Computing Algorithms for Mathematical Programming

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	48.22

Visualization

Abstract

This paper describes a new algorithm for the selection of the pivot row in matrix inversion when using the product form of the inverse. This algorithm has been developed for linear programming codes; however, it would be valuable for the inversion of any non-dense matrix.The procedures described in this paper have been thoroughly tested and have been in operation on the Esso Research and Engineering IBM 7090 computer for nine months. Substantial computer cost savings have been realized because of this procedure.