Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms

Roman L. Weil and Paul Kettler ()
Additional contact information
Roman L. Weil: University of Chicago

Management Science, 1971, vol. 18, issue 1, 98-108

Abstract: The rows and columns of an arbitrary coefficient matrix of large numerical problems can often be permuted so that substantial time can be saved in computations. For example, if a large linear programming problem has a suitable block-angular structure, one of the time-saving decomposition algorithms can be used. This article presents a systematic method for effecting such a block-angular permutation. An example and the results of manipulations of matrices with more than 300 rows and 2500 columns are shown.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.1.98 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:18:y:1971:i:1:p:98-108

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().